/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:19:51,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:19:51,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:19:51,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:19:51,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:19:51,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:19:51,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:19:51,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:19:51,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:19:51,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:19:51,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:19:51,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:19:51,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:19:51,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:19:51,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:19:51,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:19:51,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:19:51,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:19:51,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:19:51,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:19:51,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:19:51,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:19:51,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:19:51,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:19:51,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:19:51,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:19:51,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:19:51,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:19:51,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:19:51,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:19:51,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:19:51,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:19:51,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:19:51,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:19:51,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:19:51,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:19:51,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:19:51,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:19:51,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:19:51,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:19:51,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:19:51,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:19:51,992 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:19:51,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:19:51,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:19:51,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:19:51,994 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:19:51,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:19:51,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:19:51,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:19:51,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:19:51,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:19:51,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:19:51,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:19:51,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:19:51,996 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:19:51,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:19:51,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:19:51,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:19:51,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:19:51,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:19:51,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:19:51,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:19:51,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:19:51,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:19:51,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:19:51,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:19:51,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:19:51,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:19:51,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:19:51,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:19:51,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:19:52,257 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:19:52,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:19:52,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:19:52,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:19:52,282 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:19:52,283 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-11-23 22:19:52,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0b21cf5/e6fdc66c383a4da9a7c51367d5fa5c9a/FLAG8d0b33788 [2019-11-23 22:19:52,926 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:19:52,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2019-11-23 22:19:52,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0b21cf5/e6fdc66c383a4da9a7c51367d5fa5c9a/FLAG8d0b33788 [2019-11-23 22:19:53,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b0b21cf5/e6fdc66c383a4da9a7c51367d5fa5c9a [2019-11-23 22:19:53,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:19:53,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:19:53,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:19:53,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:19:53,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:19:53,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:53,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46aafeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53, skipping insertion in model container [2019-11-23 22:19:53,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:53,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:19:53,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:19:53,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:19:53,652 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:19:53,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:19:53,812 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:19:53,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53 WrapperNode [2019-11-23 22:19:53,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:19:53,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:19:53,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:19:53,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:19:53,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:53,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:53,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:19:53,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:19:53,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:19:53,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:19:53,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:53,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:53,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:53,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:54,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:54,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:54,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... [2019-11-23 22:19:54,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:19:54,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:19:54,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:19:54,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:19:54,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:19:54,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:19:54,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:19:54,489 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,505 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,508 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,522 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,523 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,527 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,533 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,539 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,546 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,550 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,551 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,557 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,561 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,564 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,565 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,565 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,569 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,572 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,573 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,573 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,575 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,577 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,581 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,586 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,587 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,589 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,590 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,591 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,592 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:54,594 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:55,882 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##658: assume !false; [2019-11-23 22:19:55,882 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##657: assume false; [2019-11-23 22:19:55,882 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##665: assume !false; [2019-11-23 22:19:55,883 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##664: assume false; [2019-11-23 22:19:55,883 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##683: assume false; [2019-11-23 22:19:55,883 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##684: assume !false; [2019-11-23 22:19:55,883 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##609: assume false; [2019-11-23 22:19:55,883 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##610: assume !false; [2019-11-23 22:19:55,884 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##639: assume false; [2019-11-23 22:19:55,884 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##640: assume !false; [2019-11-23 22:19:55,884 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-23 22:19:55,884 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-23 22:19:55,885 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-23 22:19:55,885 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-23 22:19:55,885 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume !false; [2019-11-23 22:19:55,885 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##284: assume false; [2019-11-23 22:19:55,885 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##229: assume !false; [2019-11-23 22:19:55,885 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##228: assume false; [2019-11-23 22:19:55,886 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-23 22:19:55,886 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-23 22:19:55,886 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##369: assume !false; [2019-11-23 22:19:55,886 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-23 22:19:55,886 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-23 22:19:55,887 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2019-11-23 22:19:55,887 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2019-11-23 22:19:55,887 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##357: assume false; [2019-11-23 22:19:55,887 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##358: assume !false; [2019-11-23 22:19:55,887 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##368: assume false; [2019-11-23 22:19:55,888 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume !false; [2019-11-23 22:19:55,888 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##403: assume false; [2019-11-23 22:19:55,888 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume !false; [2019-11-23 22:19:55,888 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##426: assume false; [2019-11-23 22:19:55,888 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##436: assume !false; [2019-11-23 22:19:55,888 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##435: assume false; [2019-11-23 22:19:55,889 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##439: assume false; [2019-11-23 22:19:55,889 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##440: assume !false; [2019-11-23 22:19:55,889 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##463: assume false; [2019-11-23 22:19:55,889 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##464: assume !false; [2019-11-23 22:19:55,890 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##485: assume !false; [2019-11-23 22:19:55,890 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##484: assume false; [2019-11-23 22:19:55,890 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##524: assume !false; [2019-11-23 22:19:55,890 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##523: assume false; [2019-11-23 22:19:55,890 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##558: assume !false; [2019-11-23 22:19:55,890 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##557: assume false; [2019-11-23 22:19:55,891 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##187: assume !false; [2019-11-23 22:19:55,891 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##186: assume false; [2019-11-23 22:19:55,891 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume !false; [2019-11-23 22:19:55,891 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##67: assume false; [2019-11-23 22:19:55,892 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##144: assume false; [2019-11-23 22:19:55,892 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##145: assume !false; [2019-11-23 22:19:55,892 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2019-11-23 22:19:55,892 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2019-11-23 22:19:55,892 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##154: assume !false; [2019-11-23 22:19:55,892 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume false; [2019-11-23 22:19:55,892 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-23 22:19:55,893 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-23 22:19:55,893 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##588: assume !false; [2019-11-23 22:19:55,893 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##587: assume false; [2019-11-23 22:19:55,893 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-23 22:19:55,893 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-23 22:19:55,894 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:19:55,894 INFO L284 CfgBuilder]: Removed 275 assume(true) statements. [2019-11-23 22:19:55,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:19:55 BoogieIcfgContainer [2019-11-23 22:19:55,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:19:55,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:19:55,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:19:55,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:19:55,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:19:53" (1/3) ... [2019-11-23 22:19:55,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a79882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:19:55, skipping insertion in model container [2019-11-23 22:19:55,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:53" (2/3) ... [2019-11-23 22:19:55,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a79882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:19:55, skipping insertion in model container [2019-11-23 22:19:55,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:19:55" (3/3) ... [2019-11-23 22:19:55,903 INFO L109 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2019-11-23 22:19:55,912 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:19:55,921 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2019-11-23 22:19:55,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2019-11-23 22:19:55,964 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:19:55,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:19:55,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:19:55,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:19:55,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:19:55,965 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:19:55,965 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:19:55,965 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:19:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states. [2019-11-23 22:19:56,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:19:56,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:56,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:56,008 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:56,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash 538056098, now seen corresponding path program 1 times [2019-11-23 22:19:56,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:56,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378912132] [2019-11-23 22:19:56,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:56,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378912132] [2019-11-23 22:19:56,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:56,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:56,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867692180] [2019-11-23 22:19:56,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:56,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:56,235 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 3 states. [2019-11-23 22:19:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:56,655 INFO L93 Difference]: Finished difference Result 1130 states and 1620 transitions. [2019-11-23 22:19:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:56,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:19:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:56,686 INFO L225 Difference]: With dead ends: 1130 [2019-11-23 22:19:56,686 INFO L226 Difference]: Without dead ends: 686 [2019-11-23 22:19:56,692 INFO L630 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-11-23 22:19:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-23 22:19:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 663. [2019-11-23 22:19:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-23 22:19:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 902 transitions. [2019-11-23 22:19:56,786 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 902 transitions. Word has length 10 [2019-11-23 22:19:56,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:56,786 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 902 transitions. [2019-11-23 22:19:56,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 902 transitions. [2019-11-23 22:19:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:19:56,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:56,788 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:56,788 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:56,789 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-11-23 22:19:56,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:56,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251878145] [2019-11-23 22:19:56,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:56,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251878145] [2019-11-23 22:19:56,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:56,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:56,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865044950] [2019-11-23 22:19:56,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:56,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:56,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:56,877 INFO L87 Difference]: Start difference. First operand 663 states and 902 transitions. Second operand 3 states. [2019-11-23 22:19:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:56,918 INFO L93 Difference]: Finished difference Result 682 states and 924 transitions. [2019-11-23 22:19:56,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:56,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:19:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:56,922 INFO L225 Difference]: With dead ends: 682 [2019-11-23 22:19:56,922 INFO L226 Difference]: Without dead ends: 663 [2019-11-23 22:19:56,923 INFO L630 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-11-23 22:19:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-11-23 22:19:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-11-23 22:19:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-11-23 22:19:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 901 transitions. [2019-11-23 22:19:56,955 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 901 transitions. Word has length 11 [2019-11-23 22:19:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:56,956 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 901 transitions. [2019-11-23 22:19:56,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 901 transitions. [2019-11-23 22:19:56,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:19:56,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:56,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:56,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1535696421, now seen corresponding path program 1 times [2019-11-23 22:19:56,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:56,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316371845] [2019-11-23 22:19:56,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316371845] [2019-11-23 22:19:57,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585869163] [2019-11-23 22:19:57,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,042 INFO L87 Difference]: Start difference. First operand 663 states and 901 transitions. Second operand 3 states. [2019-11-23 22:19:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,131 INFO L93 Difference]: Finished difference Result 756 states and 1015 transitions. [2019-11-23 22:19:57,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:19:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,136 INFO L225 Difference]: With dead ends: 756 [2019-11-23 22:19:57,136 INFO L226 Difference]: Without dead ends: 732 [2019-11-23 22:19:57,137 INFO L630 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-11-23 22:19:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-11-23 22:19:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 677. [2019-11-23 22:19:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-23 22:19:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 929 transitions. [2019-11-23 22:19:57,166 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 929 transitions. Word has length 16 [2019-11-23 22:19:57,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,166 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 929 transitions. [2019-11-23 22:19:57,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 929 transitions. [2019-11-23 22:19:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:19:57,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:57,169 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash 107438083, now seen corresponding path program 1 times [2019-11-23 22:19:57,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475415036] [2019-11-23 22:19:57,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475415036] [2019-11-23 22:19:57,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539818450] [2019-11-23 22:19:57,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,249 INFO L87 Difference]: Start difference. First operand 677 states and 929 transitions. Second operand 3 states. [2019-11-23 22:19:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,468 INFO L93 Difference]: Finished difference Result 705 states and 963 transitions. [2019-11-23 22:19:57,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:19:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,472 INFO L225 Difference]: With dead ends: 705 [2019-11-23 22:19:57,472 INFO L226 Difference]: Without dead ends: 700 [2019-11-23 22:19:57,473 INFO L630 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-11-23 22:19:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-11-23 22:19:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2019-11-23 22:19:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-11-23 22:19:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 958 transitions. [2019-11-23 22:19:57,500 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 958 transitions. Word has length 19 [2019-11-23 22:19:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,500 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 958 transitions. [2019-11-23 22:19:57,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 958 transitions. [2019-11-23 22:19:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:19:57,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:57,503 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,503 INFO L82 PathProgramCache]: Analyzing trace with hash 98463890, now seen corresponding path program 1 times [2019-11-23 22:19:57,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737922324] [2019-11-23 22:19:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737922324] [2019-11-23 22:19:57,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188486418] [2019-11-23 22:19:57,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,553 INFO L87 Difference]: Start difference. First operand 700 states and 958 transitions. Second operand 3 states. [2019-11-23 22:19:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,637 INFO L93 Difference]: Finished difference Result 1205 states and 1636 transitions. [2019-11-23 22:19:57,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:19:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,642 INFO L225 Difference]: With dead ends: 1205 [2019-11-23 22:19:57,642 INFO L226 Difference]: Without dead ends: 843 [2019-11-23 22:19:57,644 INFO L630 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-11-23 22:19:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2019-11-23 22:19:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 682. [2019-11-23 22:19:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-11-23 22:19:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 934 transitions. [2019-11-23 22:19:57,685 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 934 transitions. Word has length 19 [2019-11-23 22:19:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,686 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 934 transitions. [2019-11-23 22:19:57,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 934 transitions. [2019-11-23 22:19:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:19:57,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:57,693 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash -946930085, now seen corresponding path program 1 times [2019-11-23 22:19:57,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191605384] [2019-11-23 22:19:57,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191605384] [2019-11-23 22:19:57,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:57,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637382140] [2019-11-23 22:19:57,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:57,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:57,765 INFO L87 Difference]: Start difference. First operand 682 states and 934 transitions. Second operand 4 states. [2019-11-23 22:19:57,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,864 INFO L93 Difference]: Finished difference Result 694 states and 947 transitions. [2019-11-23 22:19:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:57,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-23 22:19:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,868 INFO L225 Difference]: With dead ends: 694 [2019-11-23 22:19:57,868 INFO L226 Difference]: Without dead ends: 674 [2019-11-23 22:19:57,869 INFO L630 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-11-23 22:19:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-11-23 22:19:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-11-23 22:19:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-23 22:19:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 924 transitions. [2019-11-23 22:19:57,900 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 924 transitions. Word has length 20 [2019-11-23 22:19:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,901 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 924 transitions. [2019-11-23 22:19:57,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 924 transitions. [2019-11-23 22:19:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-23 22:19:57,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:57,904 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2136813194, now seen corresponding path program 1 times [2019-11-23 22:19:57,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203603822] [2019-11-23 22:19:57,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203603822] [2019-11-23 22:19:57,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707405382] [2019-11-23 22:19:57,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,967 INFO L87 Difference]: Start difference. First operand 674 states and 924 transitions. Second operand 3 states. [2019-11-23 22:19:58,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,150 INFO L93 Difference]: Finished difference Result 674 states and 924 transitions. [2019-11-23 22:19:58,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:58,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-23 22:19:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,155 INFO L225 Difference]: With dead ends: 674 [2019-11-23 22:19:58,155 INFO L226 Difference]: Without dead ends: 658 [2019-11-23 22:19:58,156 INFO L630 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-11-23 22:19:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-23 22:19:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2019-11-23 22:19:58,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-23 22:19:58,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 907 transitions. [2019-11-23 22:19:58,188 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 907 transitions. Word has length 23 [2019-11-23 22:19:58,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,188 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 907 transitions. [2019-11-23 22:19:58,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:58,189 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 907 transitions. [2019-11-23 22:19:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-23 22:19:58,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:58,191 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1059264480, now seen corresponding path program 1 times [2019-11-23 22:19:58,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049842700] [2019-11-23 22:19:58,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049842700] [2019-11-23 22:19:58,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:58,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260518074] [2019-11-23 22:19:58,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:58,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:58,257 INFO L87 Difference]: Start difference. First operand 658 states and 907 transitions. Second operand 4 states. [2019-11-23 22:19:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,312 INFO L93 Difference]: Finished difference Result 671 states and 921 transitions. [2019-11-23 22:19:58,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:58,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-23 22:19:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,317 INFO L225 Difference]: With dead ends: 671 [2019-11-23 22:19:58,317 INFO L226 Difference]: Without dead ends: 656 [2019-11-23 22:19:58,318 INFO L630 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-11-23 22:19:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-11-23 22:19:58,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2019-11-23 22:19:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-23 22:19:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 904 transitions. [2019-11-23 22:19:58,346 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 904 transitions. Word has length 24 [2019-11-23 22:19:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,348 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 904 transitions. [2019-11-23 22:19:58,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 904 transitions. [2019-11-23 22:19:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:19:58,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:58,350 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1371761021, now seen corresponding path program 1 times [2019-11-23 22:19:58,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639901753] [2019-11-23 22:19:58,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639901753] [2019-11-23 22:19:58,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:58,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315911470] [2019-11-23 22:19:58,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:58,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:58,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,383 INFO L87 Difference]: Start difference. First operand 656 states and 904 transitions. Second operand 3 states. [2019-11-23 22:19:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,617 INFO L93 Difference]: Finished difference Result 855 states and 1170 transitions. [2019-11-23 22:19:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:58,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:19:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,622 INFO L225 Difference]: With dead ends: 855 [2019-11-23 22:19:58,622 INFO L226 Difference]: Without dead ends: 847 [2019-11-23 22:19:58,623 INFO L630 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-11-23 22:19:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-11-23 22:19:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 674. [2019-11-23 22:19:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-11-23 22:19:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 931 transitions. [2019-11-23 22:19:58,693 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 931 transitions. Word has length 25 [2019-11-23 22:19:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,694 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 931 transitions. [2019-11-23 22:19:58,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 931 transitions. [2019-11-23 22:19:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:19:58,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:58,696 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash 417423376, now seen corresponding path program 1 times [2019-11-23 22:19:58,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122470688] [2019-11-23 22:19:58,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122470688] [2019-11-23 22:19:58,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:19:58,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070832945] [2019-11-23 22:19:58,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:19:58,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:19:58,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:19:58,759 INFO L87 Difference]: Start difference. First operand 674 states and 931 transitions. Second operand 7 states. [2019-11-23 22:19:59,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,329 INFO L93 Difference]: Finished difference Result 998 states and 1339 transitions. [2019-11-23 22:19:59,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:59,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-23 22:19:59,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,333 INFO L225 Difference]: With dead ends: 998 [2019-11-23 22:19:59,333 INFO L226 Difference]: Without dead ends: 749 [2019-11-23 22:19:59,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:19:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-11-23 22:19:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 657. [2019-11-23 22:19:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-23 22:19:59,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 895 transitions. [2019-11-23 22:19:59,366 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 895 transitions. Word has length 26 [2019-11-23 22:19:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,367 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 895 transitions. [2019-11-23 22:19:59,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:19:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 895 transitions. [2019-11-23 22:19:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:19:59,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:59,370 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,370 INFO L82 PathProgramCache]: Analyzing trace with hash -65691980, now seen corresponding path program 1 times [2019-11-23 22:19:59,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210568625] [2019-11-23 22:19:59,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210568625] [2019-11-23 22:19:59,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:59,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707929820] [2019-11-23 22:19:59,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:59,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:59,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:59,404 INFO L87 Difference]: Start difference. First operand 657 states and 895 transitions. Second operand 4 states. [2019-11-23 22:19:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,459 INFO L93 Difference]: Finished difference Result 670 states and 909 transitions. [2019-11-23 22:19:59,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:59,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-23 22:19:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,463 INFO L225 Difference]: With dead ends: 670 [2019-11-23 22:19:59,464 INFO L226 Difference]: Without dead ends: 655 [2019-11-23 22:19:59,464 INFO L630 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-11-23 22:19:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-11-23 22:19:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-11-23 22:19:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-23 22:19:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 892 transitions. [2019-11-23 22:19:59,531 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 892 transitions. Word has length 26 [2019-11-23 22:19:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,531 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 892 transitions. [2019-11-23 22:19:59,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 892 transitions. [2019-11-23 22:19:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:19:59,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,532 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:59,533 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2044140679, now seen corresponding path program 1 times [2019-11-23 22:19:59,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126219117] [2019-11-23 22:19:59,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126219117] [2019-11-23 22:19:59,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:59,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015577189] [2019-11-23 22:19:59,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:59,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:59,597 INFO L87 Difference]: Start difference. First operand 655 states and 892 transitions. Second operand 4 states. [2019-11-23 22:19:59,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,680 INFO L93 Difference]: Finished difference Result 693 states and 933 transitions. [2019-11-23 22:19:59,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:59,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-23 22:19:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,684 INFO L225 Difference]: With dead ends: 693 [2019-11-23 22:19:59,684 INFO L226 Difference]: Without dead ends: 672 [2019-11-23 22:19:59,685 INFO L630 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-11-23 22:19:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-23 22:19:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 657. [2019-11-23 22:19:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-11-23 22:19:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 894 transitions. [2019-11-23 22:19:59,715 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 894 transitions. Word has length 27 [2019-11-23 22:19:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,715 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 894 transitions. [2019-11-23 22:19:59,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 894 transitions. [2019-11-23 22:19:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:19:59,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,717 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:59,718 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash -610986493, now seen corresponding path program 1 times [2019-11-23 22:19:59,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665306402] [2019-11-23 22:19:59,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665306402] [2019-11-23 22:19:59,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:59,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137279403] [2019-11-23 22:19:59,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:59,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:59,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,762 INFO L87 Difference]: Start difference. First operand 657 states and 894 transitions. Second operand 3 states. [2019-11-23 22:19:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,804 INFO L93 Difference]: Finished difference Result 697 states and 943 transitions. [2019-11-23 22:19:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:59,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:19:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,807 INFO L225 Difference]: With dead ends: 697 [2019-11-23 22:19:59,808 INFO L226 Difference]: Without dead ends: 634 [2019-11-23 22:19:59,808 INFO L630 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-11-23 22:19:59,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-11-23 22:19:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-11-23 22:19:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-23 22:19:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-11-23 22:19:59,837 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 27 [2019-11-23 22:19:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,837 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-11-23 22:19:59,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:59,837 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-11-23 22:19:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:19:59,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,838 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:59,839 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1636712997, now seen corresponding path program 1 times [2019-11-23 22:19:59,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091129888] [2019-11-23 22:19:59,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091129888] [2019-11-23 22:19:59,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:59,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381279485] [2019-11-23 22:19:59,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:59,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:59,901 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 4 states. [2019-11-23 22:19:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,986 INFO L93 Difference]: Finished difference Result 670 states and 898 transitions. [2019-11-23 22:19:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:59,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-23 22:19:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,993 INFO L225 Difference]: With dead ends: 670 [2019-11-23 22:19:59,994 INFO L226 Difference]: Without dead ends: 649 [2019-11-23 22:19:59,996 INFO L630 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-11-23 22:19:59,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-23 22:20:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 632. [2019-11-23 22:20:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-11-23 22:20:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 857 transitions. [2019-11-23 22:20:00,030 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 857 transitions. Word has length 28 [2019-11-23 22:20:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:00,031 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 857 transitions. [2019-11-23 22:20:00,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 857 transitions. [2019-11-23 22:20:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:20:00,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:00,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:00,032 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:00,033 INFO L82 PathProgramCache]: Analyzing trace with hash 615415176, now seen corresponding path program 1 times [2019-11-23 22:20:00,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:00,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308629660] [2019-11-23 22:20:00,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:00,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308629660] [2019-11-23 22:20:00,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:00,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:20:00,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664899674] [2019-11-23 22:20:00,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:20:00,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:00,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:20:00,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:00,115 INFO L87 Difference]: Start difference. First operand 632 states and 857 transitions. Second operand 8 states. [2019-11-23 22:20:00,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:00,659 INFO L93 Difference]: Finished difference Result 654 states and 879 transitions. [2019-11-23 22:20:00,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:00,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-23 22:20:00,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:00,663 INFO L225 Difference]: With dead ends: 654 [2019-11-23 22:20:00,663 INFO L226 Difference]: Without dead ends: 649 [2019-11-23 22:20:00,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-23 22:20:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 642. [2019-11-23 22:20:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 22:20:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 867 transitions. [2019-11-23 22:20:00,699 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 867 transitions. Word has length 29 [2019-11-23 22:20:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:00,699 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 867 transitions. [2019-11-23 22:20:00,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:20:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 867 transitions. [2019-11-23 22:20:00,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:20:00,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:00,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:00,702 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:00,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1368733509, now seen corresponding path program 1 times [2019-11-23 22:20:00,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:00,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150729539] [2019-11-23 22:20:00,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:00,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150729539] [2019-11-23 22:20:00,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:00,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:20:00,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709217795] [2019-11-23 22:20:00,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:20:00,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:00,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:20:00,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:00,783 INFO L87 Difference]: Start difference. First operand 642 states and 867 transitions. Second operand 8 states. [2019-11-23 22:20:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:01,330 INFO L93 Difference]: Finished difference Result 654 states and 878 transitions. [2019-11-23 22:20:01,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:01,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-23 22:20:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:01,333 INFO L225 Difference]: With dead ends: 654 [2019-11-23 22:20:01,334 INFO L226 Difference]: Without dead ends: 649 [2019-11-23 22:20:01,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-23 22:20:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2019-11-23 22:20:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-23 22:20:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 868 transitions. [2019-11-23 22:20:01,367 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 868 transitions. Word has length 30 [2019-11-23 22:20:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:01,368 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 868 transitions. [2019-11-23 22:20:01,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:20:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 868 transitions. [2019-11-23 22:20:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:20:01,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:01,369 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:01,370 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1926882852, now seen corresponding path program 1 times [2019-11-23 22:20:01,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:01,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274452125] [2019-11-23 22:20:01,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:01,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274452125] [2019-11-23 22:20:01,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:01,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:01,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919293086] [2019-11-23 22:20:01,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:01,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:01,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:01,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:01,436 INFO L87 Difference]: Start difference. First operand 643 states and 868 transitions. Second operand 6 states. [2019-11-23 22:20:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:01,572 INFO L93 Difference]: Finished difference Result 697 states and 927 transitions. [2019-11-23 22:20:01,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:01,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-23 22:20:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:01,576 INFO L225 Difference]: With dead ends: 697 [2019-11-23 22:20:01,576 INFO L226 Difference]: Without dead ends: 640 [2019-11-23 22:20:01,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-11-23 22:20:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 620. [2019-11-23 22:20:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-11-23 22:20:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 827 transitions. [2019-11-23 22:20:01,632 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 827 transitions. Word has length 30 [2019-11-23 22:20:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:01,632 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 827 transitions. [2019-11-23 22:20:01,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 827 transitions. [2019-11-23 22:20:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:20:01,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:01,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:01,634 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash 455111851, now seen corresponding path program 1 times [2019-11-23 22:20:01,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:01,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511971627] [2019-11-23 22:20:01,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:01,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511971627] [2019-11-23 22:20:01,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:01,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:01,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32057677] [2019-11-23 22:20:01,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:01,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:01,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:01,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:01,742 INFO L87 Difference]: Start difference. First operand 620 states and 827 transitions. Second operand 9 states. [2019-11-23 22:20:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:02,365 INFO L93 Difference]: Finished difference Result 637 states and 844 transitions. [2019-11-23 22:20:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:20:02,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-23 22:20:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:02,368 INFO L225 Difference]: With dead ends: 637 [2019-11-23 22:20:02,369 INFO L226 Difference]: Without dead ends: 632 [2019-11-23 22:20:02,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:20:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-11-23 22:20:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 620. [2019-11-23 22:20:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-11-23 22:20:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 826 transitions. [2019-11-23 22:20:02,404 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 826 transitions. Word has length 30 [2019-11-23 22:20:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:02,404 INFO L462 AbstractCegarLoop]: Abstraction has 620 states and 826 transitions. [2019-11-23 22:20:02,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:02,404 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 826 transitions. [2019-11-23 22:20:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:02,405 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:02,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:02,406 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:02,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:02,406 INFO L82 PathProgramCache]: Analyzing trace with hash 932056973, now seen corresponding path program 1 times [2019-11-23 22:20:02,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:02,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916403043] [2019-11-23 22:20:02,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:02,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916403043] [2019-11-23 22:20:02,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:02,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:02,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058135923] [2019-11-23 22:20:02,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:02,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:02,447 INFO L87 Difference]: Start difference. First operand 620 states and 826 transitions. Second operand 3 states. [2019-11-23 22:20:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:02,650 INFO L93 Difference]: Finished difference Result 801 states and 1053 transitions. [2019-11-23 22:20:02,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:02,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:20:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:02,654 INFO L225 Difference]: With dead ends: 801 [2019-11-23 22:20:02,654 INFO L226 Difference]: Without dead ends: 778 [2019-11-23 22:20:02,654 INFO L630 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-11-23 22:20:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-23 22:20:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 658. [2019-11-23 22:20:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-23 22:20:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 869 transitions. [2019-11-23 22:20:02,694 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 869 transitions. Word has length 31 [2019-11-23 22:20:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:02,695 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 869 transitions. [2019-11-23 22:20:02,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 869 transitions. [2019-11-23 22:20:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:02,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:02,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:02,696 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 694297730, now seen corresponding path program 1 times [2019-11-23 22:20:02,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:02,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205357511] [2019-11-23 22:20:02,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:02,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-11-23 22:20:02,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205357511] [2019-11-23 22:20:02,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:02,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:02,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579023672] [2019-11-23 22:20:02,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:02,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:02,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:02,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:02,796 INFO L87 Difference]: Start difference. First operand 658 states and 869 transitions. Second operand 9 states. [2019-11-23 22:20:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:03,419 INFO L93 Difference]: Finished difference Result 675 states and 885 transitions. [2019-11-23 22:20:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:20:03,420 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-23 22:20:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:03,425 INFO L225 Difference]: With dead ends: 675 [2019-11-23 22:20:03,425 INFO L226 Difference]: Without dead ends: 670 [2019-11-23 22:20:03,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:20:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-11-23 22:20:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 658. [2019-11-23 22:20:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-23 22:20:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 868 transitions. [2019-11-23 22:20:03,458 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 868 transitions. Word has length 31 [2019-11-23 22:20:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:03,458 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 868 transitions. [2019-11-23 22:20:03,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:03,458 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 868 transitions. [2019-11-23 22:20:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:20:03,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:03,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:03,460 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1700782205, now seen corresponding path program 1 times [2019-11-23 22:20:03,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:03,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453699094] [2019-11-23 22:20:03,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:03,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453699094] [2019-11-23 22:20:03,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:03,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:03,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489680032] [2019-11-23 22:20:03,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:03,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:03,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:03,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:03,514 INFO L87 Difference]: Start difference. First operand 658 states and 868 transitions. Second operand 3 states. [2019-11-23 22:20:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:03,665 INFO L93 Difference]: Finished difference Result 866 states and 1144 transitions. [2019-11-23 22:20:03,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:03,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:20:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:03,668 INFO L225 Difference]: With dead ends: 866 [2019-11-23 22:20:03,668 INFO L226 Difference]: Without dead ends: 660 [2019-11-23 22:20:03,669 INFO L630 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-11-23 22:20:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-11-23 22:20:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-11-23 22:20:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-11-23 22:20:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 871 transitions. [2019-11-23 22:20:03,702 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 871 transitions. Word has length 31 [2019-11-23 22:20:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:03,702 INFO L462 AbstractCegarLoop]: Abstraction has 660 states and 871 transitions. [2019-11-23 22:20:03,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 871 transitions. [2019-11-23 22:20:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:03,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:03,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:03,704 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1153548271, now seen corresponding path program 1 times [2019-11-23 22:20:03,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:03,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848195680] [2019-11-23 22:20:03,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:03,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:03,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848195680] [2019-11-23 22:20:03,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:03,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:03,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149790560] [2019-11-23 22:20:03,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:03,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:03,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:03,751 INFO L87 Difference]: Start difference. First operand 660 states and 871 transitions. Second operand 6 states. [2019-11-23 22:20:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,165 INFO L93 Difference]: Finished difference Result 1317 states and 1722 transitions. [2019-11-23 22:20:04,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:04,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 22:20:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,170 INFO L225 Difference]: With dead ends: 1317 [2019-11-23 22:20:04,170 INFO L226 Difference]: Without dead ends: 1044 [2019-11-23 22:20:04,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:04,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-11-23 22:20:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 723. [2019-11-23 22:20:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-11-23 22:20:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2019-11-23 22:20:04,211 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 32 [2019-11-23 22:20:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,211 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2019-11-23 22:20:04,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2019-11-23 22:20:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:04,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:04,213 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1153536355, now seen corresponding path program 1 times [2019-11-23 22:20:04,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92589042] [2019-11-23 22:20:04,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92589042] [2019-11-23 22:20:04,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:04,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215333447] [2019-11-23 22:20:04,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:04,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:04,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:04,251 INFO L87 Difference]: Start difference. First operand 723 states and 958 transitions. Second operand 6 states. [2019-11-23 22:20:04,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,535 INFO L93 Difference]: Finished difference Result 780 states and 1019 transitions. [2019-11-23 22:20:04,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:04,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 22:20:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,539 INFO L225 Difference]: With dead ends: 780 [2019-11-23 22:20:04,539 INFO L226 Difference]: Without dead ends: 764 [2019-11-23 22:20:04,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-11-23 22:20:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 719. [2019-11-23 22:20:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-11-23 22:20:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 952 transitions. [2019-11-23 22:20:04,586 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 952 transitions. Word has length 32 [2019-11-23 22:20:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,586 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 952 transitions. [2019-11-23 22:20:04,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 952 transitions. [2019-11-23 22:20:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:04,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:04,588 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash -311870270, now seen corresponding path program 1 times [2019-11-23 22:20:04,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276622878] [2019-11-23 22:20:04,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276622878] [2019-11-23 22:20:04,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:04,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980900595] [2019-11-23 22:20:04,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:04,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:04,636 INFO L87 Difference]: Start difference. First operand 719 states and 952 transitions. Second operand 6 states. [2019-11-23 22:20:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,732 INFO L93 Difference]: Finished difference Result 731 states and 963 transitions. [2019-11-23 22:20:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:04,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-23 22:20:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,736 INFO L225 Difference]: With dead ends: 731 [2019-11-23 22:20:04,736 INFO L226 Difference]: Without dead ends: 710 [2019-11-23 22:20:04,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-11-23 22:20:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2019-11-23 22:20:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2019-11-23 22:20:04,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 940 transitions. [2019-11-23 22:20:04,776 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 940 transitions. Word has length 32 [2019-11-23 22:20:04,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,777 INFO L462 AbstractCegarLoop]: Abstraction has 710 states and 940 transitions. [2019-11-23 22:20:04,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 940 transitions. [2019-11-23 22:20:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:20:04,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:04,778 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -909472821, now seen corresponding path program 1 times [2019-11-23 22:20:04,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211336698] [2019-11-23 22:20:04,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211336698] [2019-11-23 22:20:04,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:04,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800820655] [2019-11-23 22:20:04,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:04,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:04,807 INFO L87 Difference]: Start difference. First operand 710 states and 940 transitions. Second operand 3 states. [2019-11-23 22:20:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:04,871 INFO L93 Difference]: Finished difference Result 893 states and 1175 transitions. [2019-11-23 22:20:04,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:04,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:20:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:04,874 INFO L225 Difference]: With dead ends: 893 [2019-11-23 22:20:04,874 INFO L226 Difference]: Without dead ends: 686 [2019-11-23 22:20:04,875 INFO L630 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-11-23 22:20:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-23 22:20:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2019-11-23 22:20:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-23 22:20:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 882 transitions. [2019-11-23 22:20:04,915 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 882 transitions. Word has length 32 [2019-11-23 22:20:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:04,916 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 882 transitions. [2019-11-23 22:20:04,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 882 transitions. [2019-11-23 22:20:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:04,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:04,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:04,917 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash -353842307, now seen corresponding path program 1 times [2019-11-23 22:20:04,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:04,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466265879] [2019-11-23 22:20:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:04,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466265879] [2019-11-23 22:20:04,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:04,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:04,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296222415] [2019-11-23 22:20:04,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:04,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:04,957 INFO L87 Difference]: Start difference. First operand 670 states and 882 transitions. Second operand 5 states. [2019-11-23 22:20:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:05,056 INFO L93 Difference]: Finished difference Result 771 states and 1000 transitions. [2019-11-23 22:20:05,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:05,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-23 22:20:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:05,058 INFO L225 Difference]: With dead ends: 771 [2019-11-23 22:20:05,058 INFO L226 Difference]: Without dead ends: 747 [2019-11-23 22:20:05,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-23 22:20:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 670. [2019-11-23 22:20:05,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-11-23 22:20:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 881 transitions. [2019-11-23 22:20:05,096 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 881 transitions. Word has length 33 [2019-11-23 22:20:05,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:05,096 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 881 transitions. [2019-11-23 22:20:05,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 881 transitions. [2019-11-23 22:20:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:05,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:05,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:05,098 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash -56726392, now seen corresponding path program 1 times [2019-11-23 22:20:05,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:05,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067537703] [2019-11-23 22:20:05,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:05,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067537703] [2019-11-23 22:20:05,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:05,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:05,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074098610] [2019-11-23 22:20:05,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:05,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:05,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:05,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:05,124 INFO L87 Difference]: Start difference. First operand 670 states and 881 transitions. Second operand 3 states. [2019-11-23 22:20:05,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:05,282 INFO L93 Difference]: Finished difference Result 808 states and 1046 transitions. [2019-11-23 22:20:05,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:05,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:20:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:05,286 INFO L225 Difference]: With dead ends: 808 [2019-11-23 22:20:05,286 INFO L226 Difference]: Without dead ends: 765 [2019-11-23 22:20:05,287 INFO L630 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-11-23 22:20:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-23 22:20:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 706. [2019-11-23 22:20:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-11-23 22:20:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 918 transitions. [2019-11-23 22:20:05,327 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 918 transitions. Word has length 33 [2019-11-23 22:20:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:05,327 INFO L462 AbstractCegarLoop]: Abstraction has 706 states and 918 transitions. [2019-11-23 22:20:05,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 918 transitions. [2019-11-23 22:20:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:05,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:05,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:05,329 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1516001350, now seen corresponding path program 1 times [2019-11-23 22:20:05,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:05,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882632883] [2019-11-23 22:20:05,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:05,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882632883] [2019-11-23 22:20:05,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:05,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:05,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246834539] [2019-11-23 22:20:05,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:05,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:05,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:05,361 INFO L87 Difference]: Start difference. First operand 706 states and 918 transitions. Second operand 4 states. [2019-11-23 22:20:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:05,549 INFO L93 Difference]: Finished difference Result 725 states and 938 transitions. [2019-11-23 22:20:05,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:05,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-23 22:20:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:05,552 INFO L225 Difference]: With dead ends: 725 [2019-11-23 22:20:05,552 INFO L226 Difference]: Without dead ends: 599 [2019-11-23 22:20:05,553 INFO L630 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-11-23 22:20:05,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-11-23 22:20:05,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 587. [2019-11-23 22:20:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-23 22:20:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 755 transitions. [2019-11-23 22:20:05,589 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 755 transitions. Word has length 33 [2019-11-23 22:20:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:05,590 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 755 transitions. [2019-11-23 22:20:05,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 755 transitions. [2019-11-23 22:20:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:05,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:05,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:05,591 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:05,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:05,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1819353560, now seen corresponding path program 1 times [2019-11-23 22:20:05,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:05,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9638065] [2019-11-23 22:20:05,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:05,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:05,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9638065] [2019-11-23 22:20:05,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:05,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:20:05,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573181549] [2019-11-23 22:20:05,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:20:05,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:20:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:05,690 INFO L87 Difference]: Start difference. First operand 587 states and 755 transitions. Second operand 10 states. [2019-11-23 22:20:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:06,825 INFO L93 Difference]: Finished difference Result 668 states and 849 transitions. [2019-11-23 22:20:06,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:20:06,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-23 22:20:06,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:06,830 INFO L225 Difference]: With dead ends: 668 [2019-11-23 22:20:06,830 INFO L226 Difference]: Without dead ends: 652 [2019-11-23 22:20:06,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:20:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-11-23 22:20:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 589. [2019-11-23 22:20:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-11-23 22:20:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 757 transitions. [2019-11-23 22:20:06,896 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 757 transitions. Word has length 33 [2019-11-23 22:20:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:06,896 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 757 transitions. [2019-11-23 22:20:06,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:20:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 757 transitions. [2019-11-23 22:20:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:20:06,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:06,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:06,900 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:06,901 INFO L82 PathProgramCache]: Analyzing trace with hash -471627368, now seen corresponding path program 1 times [2019-11-23 22:20:06,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:06,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353738571] [2019-11-23 22:20:06,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:06,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353738571] [2019-11-23 22:20:06,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:06,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:06,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698944777] [2019-11-23 22:20:06,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:06,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:06,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:06,999 INFO L87 Difference]: Start difference. First operand 589 states and 757 transitions. Second operand 5 states. [2019-11-23 22:20:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:07,345 INFO L93 Difference]: Finished difference Result 599 states and 766 transitions. [2019-11-23 22:20:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:07,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-23 22:20:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:07,349 INFO L225 Difference]: With dead ends: 599 [2019-11-23 22:20:07,349 INFO L226 Difference]: Without dead ends: 583 [2019-11-23 22:20:07,351 INFO L630 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-11-23 22:20:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-11-23 22:20:07,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 578. [2019-11-23 22:20:07,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-11-23 22:20:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 743 transitions. [2019-11-23 22:20:07,410 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 743 transitions. Word has length 33 [2019-11-23 22:20:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:07,410 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 743 transitions. [2019-11-23 22:20:07,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 743 transitions. [2019-11-23 22:20:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:07,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:07,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:07,413 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash -935653763, now seen corresponding path program 1 times [2019-11-23 22:20:07,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:07,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960512642] [2019-11-23 22:20:07,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:07,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960512642] [2019-11-23 22:20:07,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:07,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:07,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297247167] [2019-11-23 22:20:07,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:07,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:07,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:07,540 INFO L87 Difference]: Start difference. First operand 578 states and 743 transitions. Second operand 9 states. [2019-11-23 22:20:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:08,627 INFO L93 Difference]: Finished difference Result 947 states and 1209 transitions. [2019-11-23 22:20:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:20:08,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-23 22:20:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:08,630 INFO L225 Difference]: With dead ends: 947 [2019-11-23 22:20:08,630 INFO L226 Difference]: Without dead ends: 924 [2019-11-23 22:20:08,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:20:08,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2019-11-23 22:20:08,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 576. [2019-11-23 22:20:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-11-23 22:20:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 739 transitions. [2019-11-23 22:20:08,664 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 739 transitions. Word has length 35 [2019-11-23 22:20:08,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:08,664 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 739 transitions. [2019-11-23 22:20:08,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:08,664 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 739 transitions. [2019-11-23 22:20:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:08,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:08,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:08,665 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:08,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:08,666 INFO L82 PathProgramCache]: Analyzing trace with hash 749897277, now seen corresponding path program 1 times [2019-11-23 22:20:08,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:08,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542545822] [2019-11-23 22:20:08,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:08,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542545822] [2019-11-23 22:20:08,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:08,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:08,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076670789] [2019-11-23 22:20:08,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:08,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:08,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:08,709 INFO L87 Difference]: Start difference. First operand 576 states and 739 transitions. Second operand 4 states. [2019-11-23 22:20:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:08,881 INFO L93 Difference]: Finished difference Result 637 states and 818 transitions. [2019-11-23 22:20:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:08,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-23 22:20:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:08,883 INFO L225 Difference]: With dead ends: 637 [2019-11-23 22:20:08,883 INFO L226 Difference]: Without dead ends: 598 [2019-11-23 22:20:08,884 INFO L630 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-11-23 22:20:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-23 22:20:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 542. [2019-11-23 22:20:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-11-23 22:20:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 701 transitions. [2019-11-23 22:20:08,924 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 701 transitions. Word has length 35 [2019-11-23 22:20:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:08,924 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 701 transitions. [2019-11-23 22:20:08,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 701 transitions. [2019-11-23 22:20:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:20:08,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:08,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:08,926 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:08,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1333490113, now seen corresponding path program 1 times [2019-11-23 22:20:08,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:08,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179033983] [2019-11-23 22:20:08,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:08,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179033983] [2019-11-23 22:20:08,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:08,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:08,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544744860] [2019-11-23 22:20:08,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:08,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:08,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:08,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:08,966 INFO L87 Difference]: Start difference. First operand 542 states and 701 transitions. Second operand 5 states. [2019-11-23 22:20:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,212 INFO L93 Difference]: Finished difference Result 1248 states and 1619 transitions. [2019-11-23 22:20:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:09,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-23 22:20:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,216 INFO L225 Difference]: With dead ends: 1248 [2019-11-23 22:20:09,216 INFO L226 Difference]: Without dead ends: 1062 [2019-11-23 22:20:09,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-23 22:20:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 549. [2019-11-23 22:20:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-11-23 22:20:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 708 transitions. [2019-11-23 22:20:09,247 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 708 transitions. Word has length 35 [2019-11-23 22:20:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,247 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 708 transitions. [2019-11-23 22:20:09,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:09,247 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 708 transitions. [2019-11-23 22:20:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:20:09,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:09,249 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash -901089383, now seen corresponding path program 1 times [2019-11-23 22:20:09,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392492083] [2019-11-23 22:20:09,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:09,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392492083] [2019-11-23 22:20:09,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:09,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:09,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019224630] [2019-11-23 22:20:09,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:09,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:09,284 INFO L87 Difference]: Start difference. First operand 549 states and 708 transitions. Second operand 3 states. [2019-11-23 22:20:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,366 INFO L93 Difference]: Finished difference Result 809 states and 1043 transitions. [2019-11-23 22:20:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:09,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-23 22:20:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,369 INFO L225 Difference]: With dead ends: 809 [2019-11-23 22:20:09,369 INFO L226 Difference]: Without dead ends: 610 [2019-11-23 22:20:09,370 INFO L630 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-11-23 22:20:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-11-23 22:20:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 537. [2019-11-23 22:20:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-23 22:20:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 690 transitions. [2019-11-23 22:20:09,412 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 690 transitions. Word has length 36 [2019-11-23 22:20:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,412 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 690 transitions. [2019-11-23 22:20:09,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 690 transitions. [2019-11-23 22:20:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:09,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:09,414 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1515814519, now seen corresponding path program 1 times [2019-11-23 22:20:09,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170762662] [2019-11-23 22:20:09,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:09,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170762662] [2019-11-23 22:20:09,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:09,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:09,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101839911] [2019-11-23 22:20:09,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:09,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:09,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:09,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:09,445 INFO L87 Difference]: Start difference. First operand 537 states and 690 transitions. Second operand 5 states. [2019-11-23 22:20:09,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,542 INFO L93 Difference]: Finished difference Result 553 states and 706 transitions. [2019-11-23 22:20:09,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:09,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-23 22:20:09,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,544 INFO L225 Difference]: With dead ends: 553 [2019-11-23 22:20:09,544 INFO L226 Difference]: Without dead ends: 536 [2019-11-23 22:20:09,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-23 22:20:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2019-11-23 22:20:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-11-23 22:20:09,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 688 transitions. [2019-11-23 22:20:09,573 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 688 transitions. Word has length 37 [2019-11-23 22:20:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,573 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 688 transitions. [2019-11-23 22:20:09,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 688 transitions. [2019-11-23 22:20:09,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:09,574 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:09,575 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash -604803074, now seen corresponding path program 1 times [2019-11-23 22:20:09,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83273816] [2019-11-23 22:20:09,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:09,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-11-23 22:20:09,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83273816] [2019-11-23 22:20:09,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:09,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:09,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365754264] [2019-11-23 22:20:09,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:09,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:09,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:09,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:09,609 INFO L87 Difference]: Start difference. First operand 536 states and 688 transitions. Second operand 6 states. [2019-11-23 22:20:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:09,862 INFO L93 Difference]: Finished difference Result 564 states and 714 transitions. [2019-11-23 22:20:09,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:09,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-23 22:20:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:09,865 INFO L225 Difference]: With dead ends: 564 [2019-11-23 22:20:09,866 INFO L226 Difference]: Without dead ends: 530 [2019-11-23 22:20:09,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-11-23 22:20:09,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 520. [2019-11-23 22:20:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-11-23 22:20:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 668 transitions. [2019-11-23 22:20:09,934 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 668 transitions. Word has length 37 [2019-11-23 22:20:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:09,934 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 668 transitions. [2019-11-23 22:20:09,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:09,934 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 668 transitions. [2019-11-23 22:20:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:20:09,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:09,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:09,936 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash 48742328, now seen corresponding path program 1 times [2019-11-23 22:20:09,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:09,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63655846] [2019-11-23 22:20:09,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:10,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63655846] [2019-11-23 22:20:10,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:10,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:10,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629753605] [2019-11-23 22:20:10,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:10,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:10,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:10,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:10,117 INFO L87 Difference]: Start difference. First operand 520 states and 668 transitions. Second operand 4 states. [2019-11-23 22:20:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:10,277 INFO L93 Difference]: Finished difference Result 709 states and 910 transitions. [2019-11-23 22:20:10,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:10,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-23 22:20:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:10,294 INFO L225 Difference]: With dead ends: 709 [2019-11-23 22:20:10,295 INFO L226 Difference]: Without dead ends: 490 [2019-11-23 22:20:10,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-23 22:20:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 485. [2019-11-23 22:20:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-23 22:20:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 617 transitions. [2019-11-23 22:20:10,360 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 617 transitions. Word has length 37 [2019-11-23 22:20:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:10,360 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 617 transitions. [2019-11-23 22:20:10,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:10,361 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 617 transitions. [2019-11-23 22:20:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-23 22:20:10,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:10,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:10,365 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1967560492, now seen corresponding path program 1 times [2019-11-23 22:20:10,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:10,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033339495] [2019-11-23 22:20:10,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:10,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033339495] [2019-11-23 22:20:10,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:10,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:10,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334937598] [2019-11-23 22:20:10,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:10,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:10,432 INFO L87 Difference]: Start difference. First operand 485 states and 617 transitions. Second operand 4 states. [2019-11-23 22:20:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:10,610 INFO L93 Difference]: Finished difference Result 666 states and 850 transitions. [2019-11-23 22:20:10,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:10,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-11-23 22:20:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:10,618 INFO L225 Difference]: With dead ends: 666 [2019-11-23 22:20:10,618 INFO L226 Difference]: Without dead ends: 482 [2019-11-23 22:20:10,619 INFO L630 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-11-23 22:20:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-11-23 22:20:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-11-23 22:20:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-11-23 22:20:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 608 transitions. [2019-11-23 22:20:10,677 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 608 transitions. Word has length 38 [2019-11-23 22:20:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:10,677 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 608 transitions. [2019-11-23 22:20:10,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 608 transitions. [2019-11-23 22:20:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:20:10,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:10,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:10,679 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:10,679 INFO L82 PathProgramCache]: Analyzing trace with hash -147578755, now seen corresponding path program 1 times [2019-11-23 22:20:10,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:10,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794013998] [2019-11-23 22:20:10,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:10,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:10,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794013998] [2019-11-23 22:20:10,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:10,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:10,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825447477] [2019-11-23 22:20:10,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:10,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:10,710 INFO L87 Difference]: Start difference. First operand 482 states and 608 transitions. Second operand 3 states. [2019-11-23 22:20:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:10,870 INFO L93 Difference]: Finished difference Result 843 states and 1061 transitions. [2019-11-23 22:20:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:10,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-23 22:20:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:10,872 INFO L225 Difference]: With dead ends: 843 [2019-11-23 22:20:10,872 INFO L226 Difference]: Without dead ends: 662 [2019-11-23 22:20:10,874 INFO L630 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-11-23 22:20:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-23 22:20:10,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 485. [2019-11-23 22:20:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-23 22:20:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 611 transitions. [2019-11-23 22:20:10,950 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 611 transitions. Word has length 41 [2019-11-23 22:20:10,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:10,950 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 611 transitions. [2019-11-23 22:20:10,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 611 transitions. [2019-11-23 22:20:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-23 22:20:10,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:10,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:10,954 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash 160458813, now seen corresponding path program 1 times [2019-11-23 22:20:10,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:10,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311799178] [2019-11-23 22:20:10,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:11,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311799178] [2019-11-23 22:20:11,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:11,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:11,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108172313] [2019-11-23 22:20:11,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:11,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:11,059 INFO L87 Difference]: Start difference. First operand 485 states and 611 transitions. Second operand 5 states. [2019-11-23 22:20:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:11,317 INFO L93 Difference]: Finished difference Result 828 states and 1031 transitions. [2019-11-23 22:20:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:11,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-23 22:20:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:11,319 INFO L225 Difference]: With dead ends: 828 [2019-11-23 22:20:11,319 INFO L226 Difference]: Without dead ends: 672 [2019-11-23 22:20:11,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:11,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-11-23 22:20:11,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 485. [2019-11-23 22:20:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-23 22:20:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 607 transitions. [2019-11-23 22:20:11,372 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 607 transitions. Word has length 41 [2019-11-23 22:20:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:11,373 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 607 transitions. [2019-11-23 22:20:11,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 607 transitions. [2019-11-23 22:20:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:20:11,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:11,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:11,374 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash -693628121, now seen corresponding path program 1 times [2019-11-23 22:20:11,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:11,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848186176] [2019-11-23 22:20:11,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:11,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848186176] [2019-11-23 22:20:11,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:11,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:11,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443327027] [2019-11-23 22:20:11,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:11,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:11,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:11,404 INFO L87 Difference]: Start difference. First operand 485 states and 607 transitions. Second operand 4 states. [2019-11-23 22:20:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:11,525 INFO L93 Difference]: Finished difference Result 657 states and 807 transitions. [2019-11-23 22:20:11,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:11,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-23 22:20:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:11,527 INFO L225 Difference]: With dead ends: 657 [2019-11-23 22:20:11,527 INFO L226 Difference]: Without dead ends: 580 [2019-11-23 22:20:11,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-23 22:20:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 489. [2019-11-23 22:20:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-11-23 22:20:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 611 transitions. [2019-11-23 22:20:11,582 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 611 transitions. Word has length 42 [2019-11-23 22:20:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:11,583 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 611 transitions. [2019-11-23 22:20:11,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 611 transitions. [2019-11-23 22:20:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:20:11,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:11,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:11,584 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash -81749273, now seen corresponding path program 1 times [2019-11-23 22:20:11,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:11,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486656050] [2019-11-23 22:20:11,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:11,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486656050] [2019-11-23 22:20:11,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:11,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:11,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936673011] [2019-11-23 22:20:11,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:11,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:11,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:11,634 INFO L87 Difference]: Start difference. First operand 489 states and 611 transitions. Second operand 7 states. [2019-11-23 22:20:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:11,828 INFO L93 Difference]: Finished difference Result 635 states and 779 transitions. [2019-11-23 22:20:11,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:11,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-23 22:20:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:11,830 INFO L225 Difference]: With dead ends: 635 [2019-11-23 22:20:11,830 INFO L226 Difference]: Without dead ends: 536 [2019-11-23 22:20:11,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-23 22:20:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 484. [2019-11-23 22:20:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-23 22:20:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 602 transitions. [2019-11-23 22:20:11,891 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 602 transitions. Word has length 42 [2019-11-23 22:20:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:11,891 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 602 transitions. [2019-11-23 22:20:11,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 602 transitions. [2019-11-23 22:20:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-23 22:20:11,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:11,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:11,893 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:11,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:11,893 INFO L82 PathProgramCache]: Analyzing trace with hash -823105571, now seen corresponding path program 1 times [2019-11-23 22:20:11,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:11,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674156630] [2019-11-23 22:20:11,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:11,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674156630] [2019-11-23 22:20:11,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:11,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:11,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156813775] [2019-11-23 22:20:11,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:11,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:11,935 INFO L87 Difference]: Start difference. First operand 484 states and 602 transitions. Second operand 7 states. [2019-11-23 22:20:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:12,212 INFO L93 Difference]: Finished difference Result 512 states and 628 transitions. [2019-11-23 22:20:12,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:12,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-23 22:20:12,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:12,214 INFO L225 Difference]: With dead ends: 512 [2019-11-23 22:20:12,214 INFO L226 Difference]: Without dead ends: 346 [2019-11-23 22:20:12,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-23 22:20:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2019-11-23 22:20:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 22:20:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 399 transitions. [2019-11-23 22:20:12,257 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 399 transitions. Word has length 42 [2019-11-23 22:20:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:12,258 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 399 transitions. [2019-11-23 22:20:12,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 399 transitions. [2019-11-23 22:20:12,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:20:12,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:12,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:12,260 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:12,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1536215993, now seen corresponding path program 1 times [2019-11-23 22:20:12,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:12,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308366205] [2019-11-23 22:20:12,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:12,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308366205] [2019-11-23 22:20:12,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:12,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:12,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530222411] [2019-11-23 22:20:12,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:12,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:12,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:12,315 INFO L87 Difference]: Start difference. First operand 323 states and 399 transitions. Second operand 5 states. [2019-11-23 22:20:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:12,537 INFO L93 Difference]: Finished difference Result 707 states and 889 transitions. [2019-11-23 22:20:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:12,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-23 22:20:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:12,539 INFO L225 Difference]: With dead ends: 707 [2019-11-23 22:20:12,539 INFO L226 Difference]: Without dead ends: 577 [2019-11-23 22:20:12,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:12,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-23 22:20:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 323. [2019-11-23 22:20:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-11-23 22:20:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 398 transitions. [2019-11-23 22:20:12,574 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 398 transitions. Word has length 44 [2019-11-23 22:20:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:12,574 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 398 transitions. [2019-11-23 22:20:12,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 398 transitions. [2019-11-23 22:20:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 22:20:12,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:12,576 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:12,576 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash -702658274, now seen corresponding path program 1 times [2019-11-23 22:20:12,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:12,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030779812] [2019-11-23 22:20:12,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:12,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:12,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030779812] [2019-11-23 22:20:12,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:12,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:12,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767143667] [2019-11-23 22:20:12,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:12,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:12,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:12,614 INFO L87 Difference]: Start difference. First operand 323 states and 398 transitions. Second operand 4 states. [2019-11-23 22:20:12,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:12,665 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2019-11-23 22:20:12,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:12,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-23 22:20:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:12,667 INFO L225 Difference]: With dead ends: 355 [2019-11-23 22:20:12,667 INFO L226 Difference]: Without dead ends: 322 [2019-11-23 22:20:12,667 INFO L630 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-11-23 22:20:12,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-23 22:20:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-11-23 22:20:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-23 22:20:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 396 transitions. [2019-11-23 22:20:12,703 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 396 transitions. Word has length 47 [2019-11-23 22:20:12,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:12,704 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 396 transitions. [2019-11-23 22:20:12,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 396 transitions. [2019-11-23 22:20:12,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-23 22:20:12,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:12,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:12,705 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:12,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:12,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1085716830, now seen corresponding path program 1 times [2019-11-23 22:20:12,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:12,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290886204] [2019-11-23 22:20:12,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:12,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290886204] [2019-11-23 22:20:12,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:12,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:12,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12936011] [2019-11-23 22:20:12,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:12,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:12,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:12,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:12,754 INFO L87 Difference]: Start difference. First operand 322 states and 396 transitions. Second operand 7 states. [2019-11-23 22:20:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:12,854 INFO L93 Difference]: Finished difference Result 327 states and 400 transitions. [2019-11-23 22:20:12,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:20:12,854 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-23 22:20:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:12,855 INFO L225 Difference]: With dead ends: 327 [2019-11-23 22:20:12,855 INFO L226 Difference]: Without dead ends: 261 [2019-11-23 22:20:12,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-23 22:20:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-23 22:20:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-23 22:20:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 321 transitions. [2019-11-23 22:20:12,890 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 321 transitions. Word has length 47 [2019-11-23 22:20:12,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:12,890 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 321 transitions. [2019-11-23 22:20:12,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 321 transitions. [2019-11-23 22:20:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 22:20:12,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:12,891 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:12,891 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1259536918, now seen corresponding path program 1 times [2019-11-23 22:20:12,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:12,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310640559] [2019-11-23 22:20:12,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:12,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310640559] [2019-11-23 22:20:12,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:12,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:20:12,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424508937] [2019-11-23 22:20:12,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:20:12,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:20:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:20:12,919 INFO L87 Difference]: Start difference. First operand 261 states and 321 transitions. Second operand 3 states. [2019-11-23 22:20:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:12,993 INFO L93 Difference]: Finished difference Result 394 states and 491 transitions. [2019-11-23 22:20:12,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:20:12,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-23 22:20:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:12,994 INFO L225 Difference]: With dead ends: 394 [2019-11-23 22:20:12,994 INFO L226 Difference]: Without dead ends: 223 [2019-11-23 22:20:12,995 INFO L630 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-11-23 22:20:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-23 22:20:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-11-23 22:20:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-23 22:20:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 272 transitions. [2019-11-23 22:20:13,024 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 272 transitions. Word has length 48 [2019-11-23 22:20:13,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,024 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 272 transitions. [2019-11-23 22:20:13,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:20:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 272 transitions. [2019-11-23 22:20:13,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:20:13,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:13,026 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash -624507704, now seen corresponding path program 1 times [2019-11-23 22:20:13,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16073886] [2019-11-23 22:20:13,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16073886] [2019-11-23 22:20:13,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:13,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712677197] [2019-11-23 22:20:13,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:13,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:13,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:13,074 INFO L87 Difference]: Start difference. First operand 223 states and 272 transitions. Second operand 7 states. [2019-11-23 22:20:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:13,237 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2019-11-23 22:20:13,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:20:13,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-23 22:20:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:13,238 INFO L225 Difference]: With dead ends: 313 [2019-11-23 22:20:13,238 INFO L226 Difference]: Without dead ends: 295 [2019-11-23 22:20:13,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:13,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-23 22:20:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 223. [2019-11-23 22:20:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-23 22:20:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 271 transitions. [2019-11-23 22:20:13,259 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 271 transitions. Word has length 54 [2019-11-23 22:20:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,259 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 271 transitions. [2019-11-23 22:20:13,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 271 transitions. [2019-11-23 22:20:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:20:13,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:13,260 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2071877734, now seen corresponding path program 1 times [2019-11-23 22:20:13,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258381816] [2019-11-23 22:20:13,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258381816] [2019-11-23 22:20:13,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:20:13,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279900749] [2019-11-23 22:20:13,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:20:13,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:20:13,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:20:13,334 INFO L87 Difference]: Start difference. First operand 223 states and 271 transitions. Second operand 8 states. [2019-11-23 22:20:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:13,547 INFO L93 Difference]: Finished difference Result 289 states and 351 transitions. [2019-11-23 22:20:13,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:13,548 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-11-23 22:20:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:13,549 INFO L225 Difference]: With dead ends: 289 [2019-11-23 22:20:13,549 INFO L226 Difference]: Without dead ends: 223 [2019-11-23 22:20:13,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:20:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-23 22:20:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2019-11-23 22:20:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-23 22:20:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 270 transitions. [2019-11-23 22:20:13,604 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 270 transitions. Word has length 59 [2019-11-23 22:20:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,604 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 270 transitions. [2019-11-23 22:20:13,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:20:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2019-11-23 22:20:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-23 22:20:13,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:13,608 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,609 INFO L82 PathProgramCache]: Analyzing trace with hash -121361867, now seen corresponding path program 1 times [2019-11-23 22:20:13,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222320455] [2019-11-23 22:20:13,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222320455] [2019-11-23 22:20:13,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:13,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250936556] [2019-11-23 22:20:13,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:13,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:13,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:13,674 INFO L87 Difference]: Start difference. First operand 223 states and 270 transitions. Second operand 5 states. [2019-11-23 22:20:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:13,845 INFO L93 Difference]: Finished difference Result 378 states and 455 transitions. [2019-11-23 22:20:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:13,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-23 22:20:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:13,847 INFO L225 Difference]: With dead ends: 378 [2019-11-23 22:20:13,847 INFO L226 Difference]: Without dead ends: 327 [2019-11-23 22:20:13,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-23 22:20:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 190. [2019-11-23 22:20:13,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-23 22:20:13,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 223 transitions. [2019-11-23 22:20:13,874 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 223 transitions. Word has length 59 [2019-11-23 22:20:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:13,874 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 223 transitions. [2019-11-23 22:20:13,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 223 transitions. [2019-11-23 22:20:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:20:13,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:13,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:13,876 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:13,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:13,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1291714983, now seen corresponding path program 1 times [2019-11-23 22:20:13,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:13,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257064029] [2019-11-23 22:20:13,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:13,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257064029] [2019-11-23 22:20:13,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:13,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:13,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125843950] [2019-11-23 22:20:13,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:13,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:13,915 INFO L87 Difference]: Start difference. First operand 190 states and 223 transitions. Second operand 5 states. [2019-11-23 22:20:14,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,005 INFO L93 Difference]: Finished difference Result 278 states and 328 transitions. [2019-11-23 22:20:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:20:14,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-23 22:20:14,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,006 INFO L225 Difference]: With dead ends: 278 [2019-11-23 22:20:14,006 INFO L226 Difference]: Without dead ends: 244 [2019-11-23 22:20:14,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-23 22:20:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 179. [2019-11-23 22:20:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-23 22:20:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 209 transitions. [2019-11-23 22:20:14,030 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 209 transitions. Word has length 60 [2019-11-23 22:20:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,030 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 209 transitions. [2019-11-23 22:20:14,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2019-11-23 22:20:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-23 22:20:14,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,031 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1525268266, now seen corresponding path program 1 times [2019-11-23 22:20:14,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765665622] [2019-11-23 22:20:14,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765665622] [2019-11-23 22:20:14,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:14,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034806062] [2019-11-23 22:20:14,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:14,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:14,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:14,073 INFO L87 Difference]: Start difference. First operand 179 states and 209 transitions. Second operand 6 states. [2019-11-23 22:20:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,179 INFO L93 Difference]: Finished difference Result 324 states and 382 transitions. [2019-11-23 22:20:14,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:14,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-23 22:20:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,180 INFO L225 Difference]: With dead ends: 324 [2019-11-23 22:20:14,180 INFO L226 Difference]: Without dead ends: 269 [2019-11-23 22:20:14,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-11-23 22:20:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 146. [2019-11-23 22:20:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-23 22:20:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 172 transitions. [2019-11-23 22:20:14,204 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 172 transitions. Word has length 61 [2019-11-23 22:20:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,204 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 172 transitions. [2019-11-23 22:20:14,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 172 transitions. [2019-11-23 22:20:14,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-23 22:20:14,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,206 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1218638889, now seen corresponding path program 1 times [2019-11-23 22:20:14,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348485446] [2019-11-23 22:20:14,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348485446] [2019-11-23 22:20:14,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:20:14,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298942002] [2019-11-23 22:20:14,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:20:14,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:20:14,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:14,279 INFO L87 Difference]: Start difference. First operand 146 states and 172 transitions. Second operand 7 states. [2019-11-23 22:20:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:14,536 INFO L93 Difference]: Finished difference Result 376 states and 447 transitions. [2019-11-23 22:20:14,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:20:14,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-11-23 22:20:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:14,538 INFO L225 Difference]: With dead ends: 376 [2019-11-23 22:20:14,538 INFO L226 Difference]: Without dead ends: 356 [2019-11-23 22:20:14,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-11-23 22:20:14,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-23 22:20:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 162. [2019-11-23 22:20:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-23 22:20:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 193 transitions. [2019-11-23 22:20:14,566 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 193 transitions. Word has length 74 [2019-11-23 22:20:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:14,567 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 193 transitions. [2019-11-23 22:20:14,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:20:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 193 transitions. [2019-11-23 22:20:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-23 22:20:14,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:14,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:14,568 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1172490426, now seen corresponding path program 1 times [2019-11-23 22:20:14,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:14,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503098171] [2019-11-23 22:20:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:14,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503098171] [2019-11-23 22:20:14,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:14,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:20:14,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102357489] [2019-11-23 22:20:14,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:20:14,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:14,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:20:14,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:20:14,669 INFO L87 Difference]: Start difference. First operand 162 states and 193 transitions. Second operand 11 states. [2019-11-23 22:20:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,055 INFO L93 Difference]: Finished difference Result 358 states and 429 transitions. [2019-11-23 22:20:15,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:20:15,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-11-23 22:20:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,056 INFO L225 Difference]: With dead ends: 358 [2019-11-23 22:20:15,056 INFO L226 Difference]: Without dead ends: 289 [2019-11-23 22:20:15,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:20:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-23 22:20:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 162. [2019-11-23 22:20:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-23 22:20:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-11-23 22:20:15,075 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 75 [2019-11-23 22:20:15,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,075 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-11-23 22:20:15,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:20:15,075 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-11-23 22:20:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-23 22:20:15,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,076 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:15,077 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 645027120, now seen corresponding path program 1 times [2019-11-23 22:20:15,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235760963] [2019-11-23 22:20:15,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235760963] [2019-11-23 22:20:15,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:15,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904106339] [2019-11-23 22:20:15,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:15,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:15,124 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 4 states. [2019-11-23 22:20:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,178 INFO L93 Difference]: Finished difference Result 215 states and 250 transitions. [2019-11-23 22:20:15,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:15,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-23 22:20:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,179 INFO L225 Difference]: With dead ends: 215 [2019-11-23 22:20:15,179 INFO L226 Difference]: Without dead ends: 195 [2019-11-23 22:20:15,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-23 22:20:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 162. [2019-11-23 22:20:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-23 22:20:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-11-23 22:20:15,206 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 79 [2019-11-23 22:20:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,206 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-11-23 22:20:15,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-11-23 22:20:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:20:15,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,207 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:15,208 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1091776138, now seen corresponding path program 1 times [2019-11-23 22:20:15,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566477350] [2019-11-23 22:20:15,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566477350] [2019-11-23 22:20:15,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:15,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543290330] [2019-11-23 22:20:15,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:15,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:15,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:15,268 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 6 states. [2019-11-23 22:20:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,377 INFO L93 Difference]: Finished difference Result 277 states and 333 transitions. [2019-11-23 22:20:15,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:20:15,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-11-23 22:20:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,378 INFO L225 Difference]: With dead ends: 277 [2019-11-23 22:20:15,378 INFO L226 Difference]: Without dead ends: 212 [2019-11-23 22:20:15,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-23 22:20:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 152. [2019-11-23 22:20:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-23 22:20:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2019-11-23 22:20:15,395 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 80 [2019-11-23 22:20:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,396 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2019-11-23 22:20:15,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2019-11-23 22:20:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 22:20:15,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:15,397 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -839306980, now seen corresponding path program 1 times [2019-11-23 22:20:15,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987958130] [2019-11-23 22:20:15,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987958130] [2019-11-23 22:20:15,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:20:15,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151274972] [2019-11-23 22:20:15,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:20:15,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:20:15,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:20:15,482 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand 10 states. [2019-11-23 22:20:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,742 INFO L93 Difference]: Finished difference Result 381 states and 447 transitions. [2019-11-23 22:20:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-23 22:20:15,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2019-11-23 22:20:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,743 INFO L225 Difference]: With dead ends: 381 [2019-11-23 22:20:15,743 INFO L226 Difference]: Without dead ends: 281 [2019-11-23 22:20:15,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:20:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-23 22:20:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 219. [2019-11-23 22:20:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-23 22:20:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 253 transitions. [2019-11-23 22:20:15,766 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 253 transitions. Word has length 81 [2019-11-23 22:20:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:15,767 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 253 transitions. [2019-11-23 22:20:15,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:20:15,767 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 253 transitions. [2019-11-23 22:20:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 22:20:15,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:15,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:15,768 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash -273318, now seen corresponding path program 1 times [2019-11-23 22:20:15,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:15,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710547530] [2019-11-23 22:20:15,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:15,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:15,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710547530] [2019-11-23 22:20:15,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:15,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:20:15,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981109470] [2019-11-23 22:20:15,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:20:15,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:15,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:20:15,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:20:15,824 INFO L87 Difference]: Start difference. First operand 219 states and 253 transitions. Second operand 6 states. [2019-11-23 22:20:15,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:15,996 INFO L93 Difference]: Finished difference Result 400 states and 466 transitions. [2019-11-23 22:20:15,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:20:15,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-11-23 22:20:15,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:15,997 INFO L225 Difference]: With dead ends: 400 [2019-11-23 22:20:15,997 INFO L226 Difference]: Without dead ends: 380 [2019-11-23 22:20:15,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:20:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-23 22:20:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2019-11-23 22:20:16,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-11-23 22:20:16,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 242 transitions. [2019-11-23 22:20:16,021 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 242 transitions. Word has length 81 [2019-11-23 22:20:16,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,021 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 242 transitions. [2019-11-23 22:20:16,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:20:16,021 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 242 transitions. [2019-11-23 22:20:16,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:20:16,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:16,022 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,023 INFO L82 PathProgramCache]: Analyzing trace with hash 288160049, now seen corresponding path program 1 times [2019-11-23 22:20:16,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135622439] [2019-11-23 22:20:16,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:16,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135622439] [2019-11-23 22:20:16,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:16,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:20:16,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775590296] [2019-11-23 22:20:16,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:20:16,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:20:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:20:16,074 INFO L87 Difference]: Start difference. First operand 212 states and 242 transitions. Second operand 5 states. [2019-11-23 22:20:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:16,173 INFO L93 Difference]: Finished difference Result 314 states and 360 transitions. [2019-11-23 22:20:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:20:16,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-11-23 22:20:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:16,174 INFO L225 Difference]: With dead ends: 314 [2019-11-23 22:20:16,175 INFO L226 Difference]: Without dead ends: 274 [2019-11-23 22:20:16,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:20:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-23 22:20:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 214. [2019-11-23 22:20:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-11-23 22:20:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 244 transitions. [2019-11-23 22:20:16,212 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 244 transitions. Word has length 84 [2019-11-23 22:20:16,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,212 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 244 transitions. [2019-11-23 22:20:16,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:20:16,212 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 244 transitions. [2019-11-23 22:20:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 22:20:16,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:16,213 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1873856217, now seen corresponding path program 1 times [2019-11-23 22:20:16,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581126550] [2019-11-23 22:20:16,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:16,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581126550] [2019-11-23 22:20:16,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:16,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:20:16,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253407651] [2019-11-23 22:20:16,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:20:16,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:20:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:20:16,258 INFO L87 Difference]: Start difference. First operand 214 states and 244 transitions. Second operand 4 states. [2019-11-23 22:20:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:16,314 INFO L93 Difference]: Finished difference Result 262 states and 294 transitions. [2019-11-23 22:20:16,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:20:16,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-23 22:20:16,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:16,315 INFO L225 Difference]: With dead ends: 262 [2019-11-23 22:20:16,315 INFO L226 Difference]: Without dead ends: 241 [2019-11-23 22:20:16,316 INFO L630 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-11-23 22:20:16,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-23 22:20:16,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2019-11-23 22:20:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 22:20:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 246 transitions. [2019-11-23 22:20:16,350 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 246 transitions. Word has length 86 [2019-11-23 22:20:16,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,351 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 246 transitions. [2019-11-23 22:20:16,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:20:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2019-11-23 22:20:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 22:20:16,351 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:16,352 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash 481659239, now seen corresponding path program 1 times [2019-11-23 22:20:16,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41667652] [2019-11-23 22:20:16,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:16,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41667652] [2019-11-23 22:20:16,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:16,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:16,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146917705] [2019-11-23 22:20:16,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:16,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:16,440 INFO L87 Difference]: Start difference. First operand 216 states and 246 transitions. Second operand 9 states. [2019-11-23 22:20:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:16,873 INFO L93 Difference]: Finished difference Result 426 states and 492 transitions. [2019-11-23 22:20:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:20:16,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-11-23 22:20:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:16,874 INFO L225 Difference]: With dead ends: 426 [2019-11-23 22:20:16,874 INFO L226 Difference]: Without dead ends: 288 [2019-11-23 22:20:16,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=445, Unknown=0, NotChecked=0, Total=650 [2019-11-23 22:20:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-23 22:20:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 213. [2019-11-23 22:20:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-11-23 22:20:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 239 transitions. [2019-11-23 22:20:16,899 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 239 transitions. Word has length 86 [2019-11-23 22:20:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:16,899 INFO L462 AbstractCegarLoop]: Abstraction has 213 states and 239 transitions. [2019-11-23 22:20:16,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2019-11-23 22:20:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-23 22:20:16,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:16,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:16,900 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1016683280, now seen corresponding path program 1 times [2019-11-23 22:20:16,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:16,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057705532] [2019-11-23 22:20:16,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:17,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-11-23 22:20:17,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057705532] [2019-11-23 22:20:17,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:17,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 22:20:17,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680358196] [2019-11-23 22:20:17,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:20:17,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:20:17,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:20:17,017 INFO L87 Difference]: Start difference. First operand 213 states and 239 transitions. Second operand 12 states. [2019-11-23 22:20:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:17,456 INFO L93 Difference]: Finished difference Result 392 states and 442 transitions. [2019-11-23 22:20:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 22:20:17,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2019-11-23 22:20:17,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:17,457 INFO L225 Difference]: With dead ends: 392 [2019-11-23 22:20:17,458 INFO L226 Difference]: Without dead ends: 357 [2019-11-23 22:20:17,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:20:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-23 22:20:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 220. [2019-11-23 22:20:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-23 22:20:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 248 transitions. [2019-11-23 22:20:17,484 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 248 transitions. Word has length 87 [2019-11-23 22:20:17,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:17,484 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 248 transitions. [2019-11-23 22:20:17,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:20:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 248 transitions. [2019-11-23 22:20:17,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 22:20:17,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:17,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:17,485 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:17,486 INFO L82 PathProgramCache]: Analyzing trace with hash 895193670, now seen corresponding path program 1 times [2019-11-23 22:20:17,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:17,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781029987] [2019-11-23 22:20:17,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:17,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781029987] [2019-11-23 22:20:17,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:17,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:20:17,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505328666] [2019-11-23 22:20:17,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:20:17,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:20:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:20:17,613 INFO L87 Difference]: Start difference. First operand 220 states and 248 transitions. Second operand 9 states. [2019-11-23 22:20:17,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:17,916 INFO L93 Difference]: Finished difference Result 321 states and 364 transitions. [2019-11-23 22:20:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:20:17,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-11-23 22:20:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:17,917 INFO L225 Difference]: With dead ends: 321 [2019-11-23 22:20:17,917 INFO L226 Difference]: Without dead ends: 136 [2019-11-23 22:20:17,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-11-23 22:20:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-23 22:20:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 130. [2019-11-23 22:20:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-23 22:20:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2019-11-23 22:20:17,934 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 91 [2019-11-23 22:20:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:17,934 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2019-11-23 22:20:17,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:20:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2019-11-23 22:20:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 22:20:17,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:20:17,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:20:17,935 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr45ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr40ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr41ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr49ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr44ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr39ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr48ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr38ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr52ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr43ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr47ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr51ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr37ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr46ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr42ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr50ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:20:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:20:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 116218975, now seen corresponding path program 1 times [2019-11-23 22:20:17,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:20:17,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433639220] [2019-11-23 22:20:17,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:20:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:20:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:20:18,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433639220] [2019-11-23 22:20:18,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:20:18,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-23 22:20:18,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820519345] [2019-11-23 22:20:18,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 22:20:18,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:20:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 22:20:18,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:20:18,075 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand 12 states. [2019-11-23 22:20:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:20:18,362 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2019-11-23 22:20:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-23 22:20:18,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-11-23 22:20:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:20:18,363 INFO L225 Difference]: With dead ends: 166 [2019-11-23 22:20:18,363 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:20:18,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-11-23 22:20:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:20:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:20:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:20:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:20:18,365 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2019-11-23 22:20:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:20:18,365 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:20:18,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 22:20:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:20:18,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:20:18,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:20:18,532 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2019-11-23 22:20:18,769 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 155 [2019-11-23 22:20:19,042 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 157 [2019-11-23 22:20:19,374 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-23 22:20:19,777 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 198 [2019-11-23 22:20:20,201 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 155 [2019-11-23 22:20:20,404 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 191 [2019-11-23 22:20:20,651 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 190 [2019-11-23 22:20:20,841 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 180 [2019-11-23 22:20:20,999 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-23 22:20:21,798 WARN L192 SmtUtils]: Spent 791.00 ms on a formula simplification. DAG size of input: 469 DAG size of output: 442 [2019-11-23 22:20:22,578 WARN L192 SmtUtils]: Spent 739.00 ms on a formula simplification. DAG size of input: 472 DAG size of output: 403 [2019-11-23 22:20:23,351 WARN L192 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 470 DAG size of output: 446 [2019-11-23 22:20:23,510 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-23 22:20:25,104 WARN L192 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 485 DAG size of output: 451 [2019-11-23 22:20:25,473 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 268 [2019-11-23 22:20:26,004 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 158 [2019-11-23 22:20:26,172 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-11-23 22:20:26,315 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-23 22:20:26,493 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-23 22:20:26,653 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 147 [2019-11-23 22:20:26,839 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 176 [2019-11-23 22:20:27,123 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 275 [2019-11-23 22:20:27,269 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 182 [2019-11-23 22:20:27,411 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 163 [2019-11-23 22:20:27,643 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 185 [2019-11-23 22:20:28,053 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 208 [2019-11-23 22:20:28,464 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 202 DAG size of output: 186 [2019-11-23 22:20:28,999 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-23 22:20:29,890 WARN L192 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-23 22:20:30,035 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-23 22:20:30,341 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-23 22:20:30,492 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-23 22:20:30,956 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2019-11-23 22:20:31,113 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-23 22:20:31,939 WARN L192 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 68 [2019-11-23 22:20:33,072 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-23 22:20:33,354 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-23 22:20:34,751 WARN L192 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 196 DAG size of output: 69 [2019-11-23 22:20:35,050 WARN L192 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-23 22:20:35,310 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-11-23 22:20:35,642 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-23 22:20:36,034 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-11-23 22:20:36,312 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-23 22:20:36,588 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-23 22:20:36,997 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-23 22:20:37,932 WARN L192 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 73 [2019-11-23 22:20:38,119 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-11-23 22:20:39,369 WARN L192 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 188 DAG size of output: 92 [2019-11-23 22:20:39,522 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-23 22:20:39,801 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-23 22:20:39,952 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2019-11-23 22:20:41,321 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 188 DAG size of output: 66 [2019-11-23 22:20:42,700 WARN L192 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 177 DAG size of output: 66 [2019-11-23 22:20:43,045 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-11-23 22:20:43,887 WARN L192 SmtUtils]: Spent 840.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 68 [2019-11-23 22:20:44,163 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-23 22:20:48,222 WARN L192 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 438 DAG size of output: 148 [2019-11-23 22:20:48,484 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-11-23 22:20:48,712 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2019-11-23 22:20:53,053 WARN L192 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 393 DAG size of output: 146 [2019-11-23 22:20:58,128 WARN L192 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 440 DAG size of output: 146 [2019-11-23 22:20:59,268 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 184 DAG size of output: 69 [2019-11-23 22:20:59,567 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-23 22:20:59,907 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-11-23 22:21:00,133 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-11-23 22:21:00,272 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-23 22:21:00,407 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-23 22:21:00,586 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-23 22:21:07,375 WARN L192 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 450 DAG size of output: 148 [2019-11-23 22:21:07,860 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-23 22:21:08,252 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-11-23 22:21:10,400 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 257 DAG size of output: 102 [2019-11-23 22:21:11,201 WARN L192 SmtUtils]: Spent 800.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-11-23 22:21:11,941 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 74 [2019-11-23 22:21:12,324 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2019-11-23 22:21:12,435 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-11-23 22:21:12,537 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-11-23 22:21:12,877 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-23 22:21:13,228 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 74 [2019-11-23 22:21:13,551 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-23 22:21:13,840 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-23 22:21:14,131 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2019-11-23 22:21:14,432 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-11-23 22:21:14,567 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 31 [2019-11-23 22:21:14,745 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-11-23 22:21:14,986 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 68 [2019-11-23 22:21:15,259 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 47 [2019-11-23 22:21:16,085 WARN L192 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 83 [2019-11-23 22:21:17,225 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 181 DAG size of output: 91 [2019-11-23 22:21:17,404 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-11-23 22:21:17,797 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-11-23 22:21:18,094 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-23 22:21:18,863 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 77 [2019-11-23 22:21:19,100 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-11-23 22:21:19,288 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-11-23 22:21:19,436 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45