/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/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:18:47,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:18:47,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:18:47,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:18:47,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:18:47,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:18:47,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:18:47,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:18:47,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:18:47,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:18:47,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:18:47,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:18:47,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:18:47,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:18:47,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:18:47,871 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:18:47,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:18:47,872 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:18:47,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:18:47,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:18:47,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:18:47,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:18:47,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:18:47,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:18:47,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:18:47,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:18:47,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:18:47,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:18:47,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:18:47,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:18:47,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:18:47,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:18:47,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:18:47,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:18:47,898 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:18:47,898 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:18:47,899 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:18:47,899 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:18:47,899 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:18:47,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:18:47,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:18:47,903 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:18:47,922 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:18:47,923 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:18:47,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:18:47,925 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:18:47,925 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:18:47,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:18:47,925 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:18:47,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:18:47,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:18:47,926 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:18:47,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:18:47,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:18:47,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:18:47,928 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:18:47,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:18:47,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:18:47,928 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:18:47,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:18:47,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:18:47,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:18:47,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:18:47,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:18:47,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:18:47,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:18:47,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:18:47,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:18:47,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:18:47,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:18:47,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:18:47,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:18:48,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:18:48,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:18:48,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:18:48,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:18:48,209 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:18:48,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-23 22:18:48,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2289f318/63f7a131214a42a4832f905b83996b91/FLAG7bba7804f [2019-11-23 22:18:48,811 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:18:48,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2019-11-23 22:18:48,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2289f318/63f7a131214a42a4832f905b83996b91/FLAG7bba7804f [2019-11-23 22:18:49,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2289f318/63f7a131214a42a4832f905b83996b91 [2019-11-23 22:18:49,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:18:49,112 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:18:49,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:18:49,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:18:49,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:18:49,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:49,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698d7cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49, skipping insertion in model container [2019-11-23 22:18:49,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:49,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:18:49,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:18:49,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:18:49,554 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:18:49,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:18:49,772 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:18:49,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49 WrapperNode [2019-11-23 22:18:49,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:18:49,773 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:18:49,773 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:18:49,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:18:49,780 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:18:49" (1/1) ... [2019-11-23 22:18:49,795 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:18:49" (1/1) ... [2019-11-23 22:18:49,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:18:49,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:18:49,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:18:49,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:18:49,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:49,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:49,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:49,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:49,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:50,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:50,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (1/1) ... [2019-11-23 22:18:50,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:18:50,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:18:50,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:18:50,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:18:50,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (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:18:50,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:18:50,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:18:50,470 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,492 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,498 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,509 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,516 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,519 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,523 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,526 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,529 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,536 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,539 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,540 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,547 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,550 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,551 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,554 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,557 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,563 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,565 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,568 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,573 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:50,577 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:18:51,909 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##674: assume !false; [2019-11-23 22:18:51,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##673: assume false; [2019-11-23 22:18:51,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##618: assume !false; [2019-11-23 22:18:51,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##617: assume false; [2019-11-23 22:18:51,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##296: assume !false; [2019-11-23 22:18:51,910 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##295: assume false; [2019-11-23 22:18:51,911 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##256: assume !false; [2019-11-23 22:18:51,911 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##255: assume false; [2019-11-23 22:18:51,911 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##217: assume !false; [2019-11-23 22:18:51,911 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##216: assume false; [2019-11-23 22:18:51,912 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##247: assume !false; [2019-11-23 22:18:51,912 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##246: assume false; [2019-11-23 22:18:51,912 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##724: assume !false; [2019-11-23 22:18:51,912 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##723: assume false; [2019-11-23 22:18:51,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##375: assume !false; [2019-11-23 22:18:51,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##374: assume false; [2019-11-23 22:18:51,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##326: assume !false; [2019-11-23 22:18:51,913 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume false; [2019-11-23 22:18:51,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##335: assume !false; [2019-11-23 22:18:51,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##334: assume false; [2019-11-23 22:18:51,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##405: assume !false; [2019-11-23 22:18:51,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##404: assume false; [2019-11-23 22:18:51,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##412: assume false; [2019-11-23 22:18:51,914 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##413: assume !false; [2019-11-23 22:18:51,915 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##452: assume false; [2019-11-23 22:18:51,915 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##453: assume !false; [2019-11-23 22:18:51,915 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##483: assume !false; [2019-11-23 22:18:51,915 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##482: assume false; [2019-11-23 22:18:51,916 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##543: assume !false; [2019-11-23 22:18:51,916 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##542: assume false; [2019-11-23 22:18:51,916 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##98: assume !false; [2019-11-23 22:18:51,916 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##97: assume false; [2019-11-23 22:18:51,916 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##80: assume !false; [2019-11-23 22:18:51,917 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##172: assume !false; [2019-11-23 22:18:51,917 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##171: assume false; [2019-11-23 22:18:51,917 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2019-11-23 22:18:51,917 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2019-11-23 22:18:51,917 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##79: assume false; [2019-11-23 22:18:51,917 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##142: assume !false; [2019-11-23 22:18:51,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume false; [2019-11-23 22:18:51,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-23 22:18:51,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-23 22:18:51,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##573: assume !false; [2019-11-23 22:18:51,918 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##572: assume false; [2019-11-23 22:18:51,920 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:18:51,920 INFO L284 CfgBuilder]: Removed 267 assume(true) statements. [2019-11-23 22:18:51,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:18:51 BoogieIcfgContainer [2019-11-23 22:18:51,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:18:51,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:18:51,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:18:51,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:18:51,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:18:49" (1/3) ... [2019-11-23 22:18:51,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28415af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:18:51, skipping insertion in model container [2019-11-23 22:18:51,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:18:49" (2/3) ... [2019-11-23 22:18:51,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28415af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:18:51, skipping insertion in model container [2019-11-23 22:18:51,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:18:51" (3/3) ... [2019-11-23 22:18:51,930 INFO L109 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2019-11-23 22:18:51,941 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:18:51,950 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 51 error locations. [2019-11-23 22:18:51,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2019-11-23 22:18:51,996 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:18:51,997 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:18:51,997 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:18:51,997 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:18:51,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:18:51,997 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:18:51,998 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:18:51,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:18:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states. [2019-11-23 22:18:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-23 22:18:52,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:52,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:18:52,038 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.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.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:18:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash 538061063, now seen corresponding path program 1 times [2019-11-23 22:18:52,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:52,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746136663] [2019-11-23 22:18:52,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:52,246 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:18:52,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746136663] [2019-11-23 22:18:52,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:52,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:52,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909059866] [2019-11-23 22:18:52,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:52,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:52,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:52,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:52,272 INFO L87 Difference]: Start difference. First operand 557 states. Second operand 3 states. [2019-11-23 22:18:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:52,867 INFO L93 Difference]: Finished difference Result 1318 states and 1943 transitions. [2019-11-23 22:18:52,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:52,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-23 22:18:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:52,899 INFO L225 Difference]: With dead ends: 1318 [2019-11-23 22:18:52,900 INFO L226 Difference]: Without dead ends: 816 [2019-11-23 22:18:52,908 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:18:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-11-23 22:18:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 776. [2019-11-23 22:18:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-23 22:18:53,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1090 transitions. [2019-11-23 22:18:53,005 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1090 transitions. Word has length 10 [2019-11-23 22:18:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:53,005 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1090 transitions. [2019-11-23 22:18:53,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:53,005 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1090 transitions. [2019-11-23 22:18:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:18:53,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:53,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:18:53,007 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.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.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:18:53,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:53,008 INFO L82 PathProgramCache]: Analyzing trace with hash 369677969, now seen corresponding path program 1 times [2019-11-23 22:18:53,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:53,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786701613] [2019-11-23 22:18:53,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:53,050 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:18:53,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786701613] [2019-11-23 22:18:53,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:53,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:53,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873926536] [2019-11-23 22:18:53,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:53,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:53,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:53,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:53,054 INFO L87 Difference]: Start difference. First operand 776 states and 1090 transitions. Second operand 3 states. [2019-11-23 22:18:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:53,287 INFO L93 Difference]: Finished difference Result 798 states and 1115 transitions. [2019-11-23 22:18:53,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:53,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:18:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:53,291 INFO L225 Difference]: With dead ends: 798 [2019-11-23 22:18:53,292 INFO L226 Difference]: Without dead ends: 776 [2019-11-23 22:18:53,293 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:18:53,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-11-23 22:18:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2019-11-23 22:18:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-23 22:18:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1089 transitions. [2019-11-23 22:18:53,351 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1089 transitions. Word has length 11 [2019-11-23 22:18:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:53,352 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1089 transitions. [2019-11-23 22:18:53,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1089 transitions. [2019-11-23 22:18:53,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:18:53,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:53,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:18:53,354 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.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.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:18:53,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1128654141, now seen corresponding path program 1 times [2019-11-23 22:18:53,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:53,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974935106] [2019-11-23 22:18:53,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:18:53,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974935106] [2019-11-23 22:18:53,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:53,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:53,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499735692] [2019-11-23 22:18:53,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:53,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:53,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:53,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:53,440 INFO L87 Difference]: Start difference. First operand 776 states and 1089 transitions. Second operand 3 states. [2019-11-23 22:18:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:53,509 INFO L93 Difference]: Finished difference Result 1593 states and 2235 transitions. [2019-11-23 22:18:53,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:53,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:18:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:53,515 INFO L225 Difference]: With dead ends: 1593 [2019-11-23 22:18:53,515 INFO L226 Difference]: Without dead ends: 1020 [2019-11-23 22:18:53,517 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:18:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-11-23 22:18:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 882. [2019-11-23 22:18:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-11-23 22:18:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1243 transitions. [2019-11-23 22:18:53,554 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1243 transitions. Word has length 15 [2019-11-23 22:18:53,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:53,555 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1243 transitions. [2019-11-23 22:18:53,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1243 transitions. [2019-11-23 22:18:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:18:53,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:53,563 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:18:53,563 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.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.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:18:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash 523348127, now seen corresponding path program 1 times [2019-11-23 22:18:53,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:53,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650788461] [2019-11-23 22:18:53,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:53,661 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:18:53,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650788461] [2019-11-23 22:18:53,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:53,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:53,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042474918] [2019-11-23 22:18:53,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:53,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:53,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:53,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:53,664 INFO L87 Difference]: Start difference. First operand 882 states and 1243 transitions. Second operand 3 states. [2019-11-23 22:18:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:53,839 INFO L93 Difference]: Finished difference Result 904 states and 1270 transitions. [2019-11-23 22:18:53,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:53,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:18:53,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:53,845 INFO L225 Difference]: With dead ends: 904 [2019-11-23 22:18:53,845 INFO L226 Difference]: Without dead ends: 899 [2019-11-23 22:18:53,846 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:18:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-11-23 22:18:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 896. [2019-11-23 22:18:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-23 22:18:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1263 transitions. [2019-11-23 22:18:53,874 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1263 transitions. Word has length 20 [2019-11-23 22:18:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:53,874 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1263 transitions. [2019-11-23 22:18:53,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1263 transitions. [2019-11-23 22:18:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-23 22:18:53,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:53,878 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:18:53,878 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.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.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:18:53,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:53,879 INFO L82 PathProgramCache]: Analyzing trace with hash 523903232, now seen corresponding path program 1 times [2019-11-23 22:18:53,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:53,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551228537] [2019-11-23 22:18:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:53,945 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:18:53,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551228537] [2019-11-23 22:18:53,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:53,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:53,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292342129] [2019-11-23 22:18:53,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:53,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:53,947 INFO L87 Difference]: Start difference. First operand 896 states and 1263 transitions. Second operand 3 states. [2019-11-23 22:18:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:54,049 INFO L93 Difference]: Finished difference Result 1617 states and 2298 transitions. [2019-11-23 22:18:54,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:54,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-23 22:18:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:54,063 INFO L225 Difference]: With dead ends: 1617 [2019-11-23 22:18:54,064 INFO L226 Difference]: Without dead ends: 1586 [2019-11-23 22:18:54,064 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:18:54,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2019-11-23 22:18:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1525. [2019-11-23 22:18:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2019-11-23 22:18:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2207 transitions. [2019-11-23 22:18:54,148 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2207 transitions. Word has length 20 [2019-11-23 22:18:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:54,148 INFO L462 AbstractCegarLoop]: Abstraction has 1525 states and 2207 transitions. [2019-11-23 22:18:54,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2207 transitions. [2019-11-23 22:18:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:18:54,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:54,150 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] [2019-11-23 22:18:54,151 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.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.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:18:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash -938497473, now seen corresponding path program 1 times [2019-11-23 22:18:54,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:54,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889864356] [2019-11-23 22:18:54,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:54,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:18:54,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889864356] [2019-11-23 22:18:54,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:54,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:18:54,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21231736] [2019-11-23 22:18:54,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:18:54,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:18:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:18:54,212 INFO L87 Difference]: Start difference. First operand 1525 states and 2207 transitions. Second operand 4 states. [2019-11-23 22:18:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:54,286 INFO L93 Difference]: Finished difference Result 1538 states and 2222 transitions. [2019-11-23 22:18:54,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:18:54,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-23 22:18:54,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:54,295 INFO L225 Difference]: With dead ends: 1538 [2019-11-23 22:18:54,295 INFO L226 Difference]: Without dead ends: 1521 [2019-11-23 22:18:54,296 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:18:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-11-23 22:18:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1521. [2019-11-23 22:18:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1521 states. [2019-11-23 22:18:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2202 transitions. [2019-11-23 22:18:54,350 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2202 transitions. Word has length 21 [2019-11-23 22:18:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:54,350 INFO L462 AbstractCegarLoop]: Abstraction has 1521 states and 2202 transitions. [2019-11-23 22:18:54,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:18:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2202 transitions. [2019-11-23 22:18:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-23 22:18:54,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:54,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] [2019-11-23 22:18:54,353 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.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.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:18:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1808064799, now seen corresponding path program 1 times [2019-11-23 22:18:54,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:54,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418513392] [2019-11-23 22:18:54,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:54,413 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:18:54,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418513392] [2019-11-23 22:18:54,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:54,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:54,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101788807] [2019-11-23 22:18:54,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:54,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:54,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:54,416 INFO L87 Difference]: Start difference. First operand 1521 states and 2202 transitions. Second operand 3 states. [2019-11-23 22:18:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:54,597 INFO L93 Difference]: Finished difference Result 1521 states and 2202 transitions. [2019-11-23 22:18:54,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:54,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-23 22:18:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:54,605 INFO L225 Difference]: With dead ends: 1521 [2019-11-23 22:18:54,606 INFO L226 Difference]: Without dead ends: 1517 [2019-11-23 22:18:54,606 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:18:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2019-11-23 22:18:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517. [2019-11-23 22:18:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1517 states. [2019-11-23 22:18:54,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2198 transitions. [2019-11-23 22:18:54,662 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 2198 transitions. Word has length 21 [2019-11-23 22:18:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:54,663 INFO L462 AbstractCegarLoop]: Abstraction has 1517 states and 2198 transitions. [2019-11-23 22:18:54,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 2198 transitions. [2019-11-23 22:18:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:18:54,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:54,664 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:18:54,665 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.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.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:18:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash -19731506, now seen corresponding path program 1 times [2019-11-23 22:18:54,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:54,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109143590] [2019-11-23 22:18:54,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:54,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:18:54,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109143590] [2019-11-23 22:18:54,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:54,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:18:54,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873329065] [2019-11-23 22:18:54,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:18:54,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:18:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:18:54,761 INFO L87 Difference]: Start difference. First operand 1517 states and 2198 transitions. Second operand 8 states. [2019-11-23 22:18:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:55,369 INFO L93 Difference]: Finished difference Result 1539 states and 2221 transitions. [2019-11-23 22:18:55,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:18:55,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-11-23 22:18:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:55,376 INFO L225 Difference]: With dead ends: 1539 [2019-11-23 22:18:55,377 INFO L226 Difference]: Without dead ends: 1534 [2019-11-23 22:18:55,378 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:18:55,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2019-11-23 22:18:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1527. [2019-11-23 22:18:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-11-23 22:18:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2209 transitions. [2019-11-23 22:18:55,442 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2209 transitions. Word has length 25 [2019-11-23 22:18:55,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:55,445 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 2209 transitions. [2019-11-23 22:18:55,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:18:55,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2209 transitions. [2019-11-23 22:18:55,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:18:55,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:55,451 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:18:55,451 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.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.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:18:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 671330291, now seen corresponding path program 1 times [2019-11-23 22:18:55,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:55,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434084315] [2019-11-23 22:18:55,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:55,494 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:18:55,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434084315] [2019-11-23 22:18:55,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:55,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:18:55,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684537203] [2019-11-23 22:18:55,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:18:55,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:18:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:18:55,497 INFO L87 Difference]: Start difference. First operand 1527 states and 2209 transitions. Second operand 4 states. [2019-11-23 22:18:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:55,570 INFO L93 Difference]: Finished difference Result 1541 states and 2225 transitions. [2019-11-23 22:18:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:18:55,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-23 22:18:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:55,578 INFO L225 Difference]: With dead ends: 1541 [2019-11-23 22:18:55,578 INFO L226 Difference]: Without dead ends: 1525 [2019-11-23 22:18:55,579 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:18:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2019-11-23 22:18:55,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2019-11-23 22:18:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525 states. [2019-11-23 22:18:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2206 transitions. [2019-11-23 22:18:55,639 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2206 transitions. Word has length 25 [2019-11-23 22:18:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:55,639 INFO L462 AbstractCegarLoop]: Abstraction has 1525 states and 2206 transitions. [2019-11-23 22:18:55,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:18:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2206 transitions. [2019-11-23 22:18:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:18:55,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:55,640 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:18:55,641 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.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.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:18:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:55,641 INFO L82 PathProgramCache]: Analyzing trace with hash 213416565, now seen corresponding path program 1 times [2019-11-23 22:18:55,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:55,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704351201] [2019-11-23 22:18:55,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:55,673 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:18:55,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704351201] [2019-11-23 22:18:55,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:55,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:55,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520028721] [2019-11-23 22:18:55,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:55,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:55,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:55,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:55,676 INFO L87 Difference]: Start difference. First operand 1525 states and 2206 transitions. Second operand 3 states. [2019-11-23 22:18:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:55,748 INFO L93 Difference]: Finished difference Result 2137 states and 3070 transitions. [2019-11-23 22:18:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:55,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:18:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:55,753 INFO L225 Difference]: With dead ends: 2137 [2019-11-23 22:18:55,753 INFO L226 Difference]: Without dead ends: 778 [2019-11-23 22:18:55,755 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:18:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2019-11-23 22:18:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2019-11-23 22:18:55,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2019-11-23 22:18:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1064 transitions. [2019-11-23 22:18:55,788 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1064 transitions. Word has length 25 [2019-11-23 22:18:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:55,788 INFO L462 AbstractCegarLoop]: Abstraction has 778 states and 1064 transitions. [2019-11-23 22:18:55,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1064 transitions. [2019-11-23 22:18:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:18:55,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:55,789 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:18:55,790 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.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.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:18:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:55,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1144638529, now seen corresponding path program 1 times [2019-11-23 22:18:55,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:55,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048789515] [2019-11-23 22:18:55,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:55,874 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:18:55,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048789515] [2019-11-23 22:18:55,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:55,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:18:55,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933734732] [2019-11-23 22:18:55,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:18:55,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:18:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:18:55,877 INFO L87 Difference]: Start difference. First operand 778 states and 1064 transitions. Second operand 8 states. [2019-11-23 22:18:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:56,446 INFO L93 Difference]: Finished difference Result 790 states and 1075 transitions. [2019-11-23 22:18:56,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-23 22:18:56,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-23 22:18:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:56,451 INFO L225 Difference]: With dead ends: 790 [2019-11-23 22:18:56,451 INFO L226 Difference]: Without dead ends: 785 [2019-11-23 22:18:56,452 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:18:56,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-23 22:18:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 779. [2019-11-23 22:18:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-11-23 22:18:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1065 transitions. [2019-11-23 22:18:56,489 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1065 transitions. Word has length 26 [2019-11-23 22:18:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:56,489 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1065 transitions. [2019-11-23 22:18:56,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:18:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1065 transitions. [2019-11-23 22:18:56,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:18:56,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:56,490 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:18:56,491 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.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.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:18:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1488013531, now seen corresponding path program 1 times [2019-11-23 22:18:56,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:56,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325867412] [2019-11-23 22:18:56,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:56,535 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:18:56,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325867412] [2019-11-23 22:18:56,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:56,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:18:56,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209407350] [2019-11-23 22:18:56,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:18:56,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:56,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:18:56,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:18:56,538 INFO L87 Difference]: Start difference. First operand 779 states and 1065 transitions. Second operand 5 states. [2019-11-23 22:18:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:56,618 INFO L93 Difference]: Finished difference Result 785 states and 1070 transitions. [2019-11-23 22:18:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:18:56,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-23 22:18:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:56,623 INFO L225 Difference]: With dead ends: 785 [2019-11-23 22:18:56,624 INFO L226 Difference]: Without dead ends: 768 [2019-11-23 22:18:56,624 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:18:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-11-23 22:18:56,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2019-11-23 22:18:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-11-23 22:18:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1052 transitions. [2019-11-23 22:18:56,667 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1052 transitions. Word has length 27 [2019-11-23 22:18:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:56,668 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1052 transitions. [2019-11-23 22:18:56,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:18:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1052 transitions. [2019-11-23 22:18:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:18:56,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:56,669 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:18:56,670 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.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.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:18:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash -458901763, now seen corresponding path program 1 times [2019-11-23 22:18:56,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:56,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489253414] [2019-11-23 22:18:56,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:56,701 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:18:56,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489253414] [2019-11-23 22:18:56,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:56,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:56,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915817356] [2019-11-23 22:18:56,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:56,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:56,704 INFO L87 Difference]: Start difference. First operand 768 states and 1052 transitions. Second operand 3 states. [2019-11-23 22:18:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:56,942 INFO L93 Difference]: Finished difference Result 1101 states and 1508 transitions. [2019-11-23 22:18:56,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:56,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:18:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:56,948 INFO L225 Difference]: With dead ends: 1101 [2019-11-23 22:18:56,948 INFO L226 Difference]: Without dead ends: 1093 [2019-11-23 22:18:56,949 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:18:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2019-11-23 22:18:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 782. [2019-11-23 22:18:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-11-23 22:18:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1068 transitions. [2019-11-23 22:18:56,999 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1068 transitions. Word has length 27 [2019-11-23 22:18:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:56,999 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1068 transitions. [2019-11-23 22:18:56,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1068 transitions. [2019-11-23 22:18:57,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-23 22:18:57,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:57,001 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:18:57,001 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.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.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:18:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash -863755156, now seen corresponding path program 1 times [2019-11-23 22:18:57,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:57,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755073216] [2019-11-23 22:18:57,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:57,028 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:18:57,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755073216] [2019-11-23 22:18:57,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:57,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:57,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966627104] [2019-11-23 22:18:57,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:57,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:57,031 INFO L87 Difference]: Start difference. First operand 782 states and 1068 transitions. Second operand 3 states. [2019-11-23 22:18:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:57,112 INFO L93 Difference]: Finished difference Result 923 states and 1240 transitions. [2019-11-23 22:18:57,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:57,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-23 22:18:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:57,115 INFO L225 Difference]: With dead ends: 923 [2019-11-23 22:18:57,116 INFO L226 Difference]: Without dead ends: 582 [2019-11-23 22:18:57,117 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:18:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-11-23 22:18:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 569. [2019-11-23 22:18:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-11-23 22:18:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 750 transitions. [2019-11-23 22:18:57,143 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 750 transitions. Word has length 27 [2019-11-23 22:18:57,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:57,143 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 750 transitions. [2019-11-23 22:18:57,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 750 transitions. [2019-11-23 22:18:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:18:57,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:57,144 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:18:57,145 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.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.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:18:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1323461075, now seen corresponding path program 1 times [2019-11-23 22:18:57,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:57,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467180468] [2019-11-23 22:18:57,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:57,183 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:18:57,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467180468] [2019-11-23 22:18:57,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:57,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:18:57,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433193987] [2019-11-23 22:18:57,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:18:57,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:57,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:18:57,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:18:57,185 INFO L87 Difference]: Start difference. First operand 569 states and 750 transitions. Second operand 6 states. [2019-11-23 22:18:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:57,446 INFO L93 Difference]: Finished difference Result 619 states and 808 transitions. [2019-11-23 22:18:57,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:18:57,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-23 22:18:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:57,450 INFO L225 Difference]: With dead ends: 619 [2019-11-23 22:18:57,450 INFO L226 Difference]: Without dead ends: 616 [2019-11-23 22:18:57,450 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:18:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-23 22:18:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 576. [2019-11-23 22:18:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-11-23 22:18:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 759 transitions. [2019-11-23 22:18:57,481 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 759 transitions. Word has length 28 [2019-11-23 22:18:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:57,482 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 759 transitions. [2019-11-23 22:18:57,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:18:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 759 transitions. [2019-11-23 22:18:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-23 22:18:57,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:57,483 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:18:57,483 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.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.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:18:57,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:57,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1323472991, now seen corresponding path program 1 times [2019-11-23 22:18:57,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:57,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016403009] [2019-11-23 22:18:57,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:57,525 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:18:57,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016403009] [2019-11-23 22:18:57,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:57,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:18:57,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818087956] [2019-11-23 22:18:57,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:18:57,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:18:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:18:57,527 INFO L87 Difference]: Start difference. First operand 576 states and 759 transitions. Second operand 6 states. [2019-11-23 22:18:57,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:57,820 INFO L93 Difference]: Finished difference Result 1329 states and 1773 transitions. [2019-11-23 22:18:57,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:18:57,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-23 22:18:57,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:57,824 INFO L225 Difference]: With dead ends: 1329 [2019-11-23 22:18:57,824 INFO L226 Difference]: Without dead ends: 912 [2019-11-23 22:18:57,825 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:18:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2019-11-23 22:18:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 596. [2019-11-23 22:18:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-23 22:18:57,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 792 transitions. [2019-11-23 22:18:57,858 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 792 transitions. Word has length 28 [2019-11-23 22:18:57,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:57,858 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 792 transitions. [2019-11-23 22:18:57,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:18:57,858 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 792 transitions. [2019-11-23 22:18:57,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:18:57,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:57,859 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:18:57,860 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.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.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:18:57,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash -520574721, now seen corresponding path program 1 times [2019-11-23 22:18:57,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:57,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940573847] [2019-11-23 22:18:57,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:57,891 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:18:57,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940573847] [2019-11-23 22:18:57,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:57,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:18:57,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819634668] [2019-11-23 22:18:57,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:18:57,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:57,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:18:57,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:18:57,893 INFO L87 Difference]: Start difference. First operand 596 states and 792 transitions. Second operand 5 states. [2019-11-23 22:18:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:57,960 INFO L93 Difference]: Finished difference Result 609 states and 807 transitions. [2019-11-23 22:18:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:18:57,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-23 22:18:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:57,963 INFO L225 Difference]: With dead ends: 609 [2019-11-23 22:18:57,963 INFO L226 Difference]: Without dead ends: 587 [2019-11-23 22:18:57,964 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:18:57,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-11-23 22:18:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-11-23 22:18:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-11-23 22:18:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 781 transitions. [2019-11-23 22:18:58,022 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 781 transitions. Word has length 29 [2019-11-23 22:18:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:58,023 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 781 transitions. [2019-11-23 22:18:58,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:18:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 781 transitions. [2019-11-23 22:18:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:18:58,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:58,024 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:18:58,024 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.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.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:18:58,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1365300265, now seen corresponding path program 1 times [2019-11-23 22:18:58,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:58,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802352815] [2019-11-23 22:18:58,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:58,056 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:18:58,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802352815] [2019-11-23 22:18:58,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:58,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:18:58,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303061947] [2019-11-23 22:18:58,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:18:58,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:58,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:18:58,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:18:58,058 INFO L87 Difference]: Start difference. First operand 587 states and 781 transitions. Second operand 4 states. [2019-11-23 22:18:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:58,331 INFO L93 Difference]: Finished difference Result 820 states and 1092 transitions. [2019-11-23 22:18:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:18:58,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-23 22:18:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:58,335 INFO L225 Difference]: With dead ends: 820 [2019-11-23 22:18:58,336 INFO L226 Difference]: Without dead ends: 796 [2019-11-23 22:18:58,336 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:18:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-11-23 22:18:58,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 570. [2019-11-23 22:18:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-23 22:18:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 759 transitions. [2019-11-23 22:18:58,371 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 759 transitions. Word has length 29 [2019-11-23 22:18:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:58,371 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 759 transitions. [2019-11-23 22:18:58,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:18:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 759 transitions. [2019-11-23 22:18:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:18:58,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:58,372 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:18:58,373 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.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.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:18:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash 226452299, now seen corresponding path program 1 times [2019-11-23 22:18:58,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:58,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495186711] [2019-11-23 22:18:58,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:58,408 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:18:58,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495186711] [2019-11-23 22:18:58,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:58,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:18:58,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032880201] [2019-11-23 22:18:58,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:18:58,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:18:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:18:58,410 INFO L87 Difference]: Start difference. First operand 570 states and 759 transitions. Second operand 3 states. [2019-11-23 22:18:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:58,580 INFO L93 Difference]: Finished difference Result 1005 states and 1353 transitions. [2019-11-23 22:18:58,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:18:58,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-23 22:18:58,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:58,583 INFO L225 Difference]: With dead ends: 1005 [2019-11-23 22:18:58,583 INFO L226 Difference]: Without dead ends: 604 [2019-11-23 22:18:58,584 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:18:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-11-23 22:18:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-11-23 22:18:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-23 22:18:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 805 transitions. [2019-11-23 22:18:58,614 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 805 transitions. Word has length 29 [2019-11-23 22:18:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:58,615 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 805 transitions. [2019-11-23 22:18:58,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:18:58,615 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 805 transitions. [2019-11-23 22:18:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:18:58,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:58,616 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:18:58,616 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.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.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:18:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1706455034, now seen corresponding path program 1 times [2019-11-23 22:18:58,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:58,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516274948] [2019-11-23 22:18:58,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:58,654 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:18:58,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516274948] [2019-11-23 22:18:58,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:58,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:18:58,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627472249] [2019-11-23 22:18:58,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:18:58,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:18:58,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:18:58,656 INFO L87 Difference]: Start difference. First operand 604 states and 805 transitions. Second operand 6 states. [2019-11-23 22:18:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:58,891 INFO L93 Difference]: Finished difference Result 645 states and 851 transitions. [2019-11-23 22:18:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:18:58,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-23 22:18:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:58,894 INFO L225 Difference]: With dead ends: 645 [2019-11-23 22:18:58,895 INFO L226 Difference]: Without dead ends: 620 [2019-11-23 22:18:58,895 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:18:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-11-23 22:18:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 591. [2019-11-23 22:18:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-11-23 22:18:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 789 transitions. [2019-11-23 22:18:58,928 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 789 transitions. Word has length 30 [2019-11-23 22:18:58,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:58,928 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 789 transitions. [2019-11-23 22:18:58,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:18:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 789 transitions. [2019-11-23 22:18:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:18:58,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:58,930 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:18:58,930 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.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.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:18:58,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:58,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1423932086, now seen corresponding path program 1 times [2019-11-23 22:18:58,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:58,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429275642] [2019-11-23 22:18:58,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:58,979 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:18:58,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429275642] [2019-11-23 22:18:58,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:58,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:18:58,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531418111] [2019-11-23 22:18:58,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:18:58,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:58,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:18:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:18:58,981 INFO L87 Difference]: Start difference. First operand 591 states and 789 transitions. Second operand 5 states. [2019-11-23 22:18:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:59,312 INFO L93 Difference]: Finished difference Result 601 states and 797 transitions. [2019-11-23 22:18:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:18:59,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-23 22:18:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:59,318 INFO L225 Difference]: With dead ends: 601 [2019-11-23 22:18:59,318 INFO L226 Difference]: Without dead ends: 596 [2019-11-23 22:18:59,319 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:18:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-23 22:18:59,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 591. [2019-11-23 22:18:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-11-23 22:18:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 788 transitions. [2019-11-23 22:18:59,353 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 788 transitions. Word has length 31 [2019-11-23 22:18:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:59,353 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 788 transitions. [2019-11-23 22:18:59,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:18:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 788 transitions. [2019-11-23 22:18:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:18:59,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:59,354 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:18:59,355 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.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.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:18:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 833030738, now seen corresponding path program 1 times [2019-11-23 22:18:59,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:59,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216727565] [2019-11-23 22:18:59,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:59,413 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:18:59,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216727565] [2019-11-23 22:18:59,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:59,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:18:59,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172005156] [2019-11-23 22:18:59,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:18:59,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:59,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:18:59,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:18:59,415 INFO L87 Difference]: Start difference. First operand 591 states and 788 transitions. Second operand 5 states. [2019-11-23 22:18:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:59,694 INFO L93 Difference]: Finished difference Result 1862 states and 2513 transitions. [2019-11-23 22:18:59,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:18:59,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-23 22:18:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:59,700 INFO L225 Difference]: With dead ends: 1862 [2019-11-23 22:18:59,701 INFO L226 Difference]: Without dead ends: 1425 [2019-11-23 22:18:59,702 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:18:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-11-23 22:18:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 605. [2019-11-23 22:18:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-11-23 22:18:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 802 transitions. [2019-11-23 22:18:59,743 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 802 transitions. Word has length 32 [2019-11-23 22:18:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:59,744 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 802 transitions. [2019-11-23 22:18:59,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:18:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 802 transitions. [2019-11-23 22:18:59,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:18:59,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:59,745 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:18:59,745 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.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.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:18:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:59,745 INFO L82 PathProgramCache]: Analyzing trace with hash -925609947, now seen corresponding path program 1 times [2019-11-23 22:18:59,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:59,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780656346] [2019-11-23 22:18:59,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:59,784 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:18:59,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780656346] [2019-11-23 22:18:59,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:59,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:18:59,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451918664] [2019-11-23 22:18:59,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:18:59,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:59,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:18:59,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:18:59,788 INFO L87 Difference]: Start difference. First operand 605 states and 802 transitions. Second operand 4 states. [2019-11-23 22:18:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:18:59,843 INFO L93 Difference]: Finished difference Result 694 states and 901 transitions. [2019-11-23 22:18:59,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:18:59,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-23 22:18:59,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:18:59,846 INFO L225 Difference]: With dead ends: 694 [2019-11-23 22:18:59,846 INFO L226 Difference]: Without dead ends: 669 [2019-11-23 22:18:59,847 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:18:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-11-23 22:18:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 608. [2019-11-23 22:18:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-11-23 22:18:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 807 transitions. [2019-11-23 22:18:59,883 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 807 transitions. Word has length 32 [2019-11-23 22:18:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:18:59,884 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 807 transitions. [2019-11-23 22:18:59,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:18:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 807 transitions. [2019-11-23 22:18:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:18:59,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:18:59,885 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:18:59,885 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.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.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:18:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:18:59,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1512415961, now seen corresponding path program 1 times [2019-11-23 22:18:59,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:18:59,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780331457] [2019-11-23 22:18:59,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:18:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:18:59,913 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:18:59,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780331457] [2019-11-23 22:18:59,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:18:59,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:18:59,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909144312] [2019-11-23 22:18:59,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:18:59,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:18:59,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:18:59,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:18:59,915 INFO L87 Difference]: Start difference. First operand 608 states and 807 transitions. Second operand 4 states. [2019-11-23 22:19:00,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:00,113 INFO L93 Difference]: Finished difference Result 637 states and 838 transitions. [2019-11-23 22:19:00,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:00,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-23 22:19:00,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:00,115 INFO L225 Difference]: With dead ends: 637 [2019-11-23 22:19:00,116 INFO L226 Difference]: Without dead ends: 604 [2019-11-23 22:19:00,116 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:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-11-23 22:19:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 600. [2019-11-23 22:19:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-23 22:19:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 791 transitions. [2019-11-23 22:19:00,153 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 791 transitions. Word has length 32 [2019-11-23 22:19:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:00,154 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 791 transitions. [2019-11-23 22:19:00,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 791 transitions. [2019-11-23 22:19:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:19:00,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:00,154 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:19:00,155 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.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.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:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1272631589, now seen corresponding path program 1 times [2019-11-23 22:19:00,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:00,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332448820] [2019-11-23 22:19:00,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:00,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332448820] [2019-11-23 22:19:00,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:00,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:00,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808125482] [2019-11-23 22:19:00,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:00,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:00,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:00,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:00,177 INFO L87 Difference]: Start difference. First operand 600 states and 791 transitions. Second operand 3 states. [2019-11-23 22:19:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:00,393 INFO L93 Difference]: Finished difference Result 776 states and 1022 transitions. [2019-11-23 22:19:00,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:00,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:19:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:00,396 INFO L225 Difference]: With dead ends: 776 [2019-11-23 22:19:00,398 INFO L226 Difference]: Without dead ends: 762 [2019-11-23 22:19:00,398 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:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-11-23 22:19:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 596. [2019-11-23 22:19:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-11-23 22:19:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 785 transitions. [2019-11-23 22:19:00,438 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 785 transitions. Word has length 32 [2019-11-23 22:19:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:00,439 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 785 transitions. [2019-11-23 22:19:00,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 785 transitions. [2019-11-23 22:19:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:19:00,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:00,440 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:19:00,440 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.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.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:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1725541029, now seen corresponding path program 1 times [2019-11-23 22:19:00,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:00,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48759887] [2019-11-23 22:19:00,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:00,481 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:00,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48759887] [2019-11-23 22:19:00,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:00,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:00,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487272141] [2019-11-23 22:19:00,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:00,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:00,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:00,484 INFO L87 Difference]: Start difference. First operand 596 states and 785 transitions. Second operand 4 states. [2019-11-23 22:19:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:00,677 INFO L93 Difference]: Finished difference Result 599 states and 787 transitions. [2019-11-23 22:19:00,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:00,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-23 22:19:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:00,679 INFO L225 Difference]: With dead ends: 599 [2019-11-23 22:19:00,679 INFO L226 Difference]: Without dead ends: 580 [2019-11-23 22:19:00,680 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:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-23 22:19:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-11-23 22:19:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-11-23 22:19:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 766 transitions. [2019-11-23 22:19:00,718 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 766 transitions. Word has length 32 [2019-11-23 22:19:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:00,718 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 766 transitions. [2019-11-23 22:19:00,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 766 transitions. [2019-11-23 22:19:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:19:00,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:00,719 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:19:00,720 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.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.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:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:00,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1444430783, now seen corresponding path program 1 times [2019-11-23 22:19:00,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:00,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668027115] [2019-11-23 22:19:00,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:00,746 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:00,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668027115] [2019-11-23 22:19:00,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:00,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:00,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738022620] [2019-11-23 22:19:00,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:00,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:00,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:00,747 INFO L87 Difference]: Start difference. First operand 580 states and 766 transitions. Second operand 3 states. [2019-11-23 22:19:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:00,966 INFO L93 Difference]: Finished difference Result 880 states and 1168 transitions. [2019-11-23 22:19:00,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:00,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:19:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:00,970 INFO L225 Difference]: With dead ends: 880 [2019-11-23 22:19:00,970 INFO L226 Difference]: Without dead ends: 868 [2019-11-23 22:19:00,971 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:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-11-23 22:19:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 604. [2019-11-23 22:19:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-23 22:19:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 802 transitions. [2019-11-23 22:19:01,018 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 802 transitions. Word has length 33 [2019-11-23 22:19:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:01,018 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 802 transitions. [2019-11-23 22:19:01,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:01,018 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 802 transitions. [2019-11-23 22:19:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:19:01,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:01,020 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:19:01,020 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.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.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:01,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:01,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1764502107, now seen corresponding path program 1 times [2019-11-23 22:19:01,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:01,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045355481] [2019-11-23 22:19:01,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:01,152 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:01,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045355481] [2019-11-23 22:19:01,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:01,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:01,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640228308] [2019-11-23 22:19:01,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:01,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:01,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:01,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:01,154 INFO L87 Difference]: Start difference. First operand 604 states and 802 transitions. Second operand 5 states. [2019-11-23 22:19:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:01,396 INFO L93 Difference]: Finished difference Result 988 states and 1314 transitions. [2019-11-23 22:19:01,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:19:01,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-23 22:19:01,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:01,409 INFO L225 Difference]: With dead ends: 988 [2019-11-23 22:19:01,409 INFO L226 Difference]: Without dead ends: 511 [2019-11-23 22:19:01,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:19:01,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2019-11-23 22:19:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 508. [2019-11-23 22:19:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-11-23 22:19:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 660 transitions. [2019-11-23 22:19:01,489 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 660 transitions. Word has length 33 [2019-11-23 22:19:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:01,489 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 660 transitions. [2019-11-23 22:19:01,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 660 transitions. [2019-11-23 22:19:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:19:01,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:01,490 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:19:01,490 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.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.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:01,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:01,491 INFO L82 PathProgramCache]: Analyzing trace with hash 814465285, now seen corresponding path program 1 times [2019-11-23 22:19:01,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:01,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995952945] [2019-11-23 22:19:01,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:01,589 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:01,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995952945] [2019-11-23 22:19:01,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:01,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:19:01,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494407826] [2019-11-23 22:19:01,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:19:01,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:01,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:19:01,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:19:01,591 INFO L87 Difference]: Start difference. First operand 508 states and 660 transitions. Second operand 7 states. [2019-11-23 22:19:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:01,792 INFO L93 Difference]: Finished difference Result 528 states and 680 transitions. [2019-11-23 22:19:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:01,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-23 22:19:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:01,803 INFO L225 Difference]: With dead ends: 528 [2019-11-23 22:19:01,803 INFO L226 Difference]: Without dead ends: 507 [2019-11-23 22:19:01,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:19:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-23 22:19:01,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-11-23 22:19:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-11-23 22:19:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 658 transitions. [2019-11-23 22:19:01,873 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 658 transitions. Word has length 33 [2019-11-23 22:19:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:01,874 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 658 transitions. [2019-11-23 22:19:01,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:19:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 658 transitions. [2019-11-23 22:19:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:19:01,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:01,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] [2019-11-23 22:19:01,875 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.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.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:01,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:01,875 INFO L82 PathProgramCache]: Analyzing trace with hash 673475342, now seen corresponding path program 1 times [2019-11-23 22:19:01,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:01,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465460413] [2019-11-23 22:19:01,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:01,918 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:01,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465460413] [2019-11-23 22:19:01,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:01,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:01,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734271687] [2019-11-23 22:19:01,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:01,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:01,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:01,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:01,919 INFO L87 Difference]: Start difference. First operand 507 states and 658 transitions. Second operand 4 states. [2019-11-23 22:19:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:02,109 INFO L93 Difference]: Finished difference Result 882 states and 1154 transitions. [2019-11-23 22:19:02,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:02,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-23 22:19:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:02,111 INFO L225 Difference]: With dead ends: 882 [2019-11-23 22:19:02,111 INFO L226 Difference]: Without dead ends: 501 [2019-11-23 22:19:02,112 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:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-23 22:19:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2019-11-23 22:19:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-11-23 22:19:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 640 transitions. [2019-11-23 22:19:02,167 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 640 transitions. Word has length 34 [2019-11-23 22:19:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:02,167 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 640 transitions. [2019-11-23 22:19:02,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 640 transitions. [2019-11-23 22:19:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:19:02,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:02,169 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.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.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:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1424690006, now seen corresponding path program 1 times [2019-11-23 22:19:02,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:02,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337175754] [2019-11-23 22:19:02,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:02,260 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:02,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337175754] [2019-11-23 22:19:02,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:02,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:19:02,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556047717] [2019-11-23 22:19:02,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:19:02,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:19:02,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:19:02,263 INFO L87 Difference]: Start difference. First operand 501 states and 640 transitions. Second operand 6 states. [2019-11-23 22:19:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:02,439 INFO L93 Difference]: Finished difference Result 515 states and 654 transitions. [2019-11-23 22:19:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:19:02,440 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-23 22:19:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:02,441 INFO L225 Difference]: With dead ends: 515 [2019-11-23 22:19:02,441 INFO L226 Difference]: Without dead ends: 512 [2019-11-23 22:19:02,442 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:19:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-23 22:19:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 507. [2019-11-23 22:19:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-11-23 22:19:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 647 transitions. [2019-11-23 22:19:02,491 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 647 transitions. Word has length 34 [2019-11-23 22:19:02,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:02,491 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 647 transitions. [2019-11-23 22:19:02,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:19:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 647 transitions. [2019-11-23 22:19:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:19:02,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:02,492 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] [2019-11-23 22:19:02,492 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.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.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:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1424701922, now seen corresponding path program 1 times [2019-11-23 22:19:02,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:02,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751048755] [2019-11-23 22:19:02,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:02,545 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:02,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751048755] [2019-11-23 22:19:02,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:02,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:02,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270067480] [2019-11-23 22:19:02,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:02,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:02,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:02,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:02,548 INFO L87 Difference]: Start difference. First operand 507 states and 647 transitions. Second operand 4 states. [2019-11-23 22:19:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:02,735 INFO L93 Difference]: Finished difference Result 512 states and 651 transitions. [2019-11-23 22:19:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:02,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-23 22:19:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:02,736 INFO L225 Difference]: With dead ends: 512 [2019-11-23 22:19:02,736 INFO L226 Difference]: Without dead ends: 485 [2019-11-23 22:19:02,737 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:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-23 22:19:02,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-11-23 22:19:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-11-23 22:19:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 620 transitions. [2019-11-23 22:19:02,803 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 620 transitions. Word has length 34 [2019-11-23 22:19:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:02,803 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 620 transitions. [2019-11-23 22:19:02,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 620 transitions. [2019-11-23 22:19:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-23 22:19:02,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:02,805 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:19:02,805 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.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.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:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:02,806 INFO L82 PathProgramCache]: Analyzing trace with hash 251442499, now seen corresponding path program 1 times [2019-11-23 22:19:02,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:02,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175098237] [2019-11-23 22:19:02,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:02,871 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:02,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175098237] [2019-11-23 22:19:02,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:02,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:19:02,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360737188] [2019-11-23 22:19:02,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:19:02,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:02,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:19:02,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:19:02,873 INFO L87 Difference]: Start difference. First operand 485 states and 620 transitions. Second operand 7 states. [2019-11-23 22:19:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:03,082 INFO L93 Difference]: Finished difference Result 485 states and 620 transitions. [2019-11-23 22:19:03,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:03,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-23 22:19:03,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:03,083 INFO L225 Difference]: With dead ends: 485 [2019-11-23 22:19:03,084 INFO L226 Difference]: Without dead ends: 457 [2019-11-23 22:19:03,085 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:19:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-11-23 22:19:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2019-11-23 22:19:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-11-23 22:19:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 589 transitions. [2019-11-23 22:19:03,127 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 589 transitions. Word has length 36 [2019-11-23 22:19:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:03,127 INFO L462 AbstractCegarLoop]: Abstraction has 457 states and 589 transitions. [2019-11-23 22:19:03,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:19:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 589 transitions. [2019-11-23 22:19:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:19:03,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:03,128 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:19:03,128 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.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.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:03,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash -889586860, now seen corresponding path program 1 times [2019-11-23 22:19:03,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:03,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021880431] [2019-11-23 22:19:03,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:03,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:03,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021880431] [2019-11-23 22:19:03,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:03,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:03,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916051211] [2019-11-23 22:19:03,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:03,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:03,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:03,156 INFO L87 Difference]: Start difference. First operand 457 states and 589 transitions. Second operand 3 states. [2019-11-23 22:19:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:03,235 INFO L93 Difference]: Finished difference Result 882 states and 1127 transitions. [2019-11-23 22:19:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:03,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-23 22:19:03,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:03,236 INFO L225 Difference]: With dead ends: 882 [2019-11-23 22:19:03,236 INFO L226 Difference]: Without dead ends: 517 [2019-11-23 22:19:03,237 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:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-11-23 22:19:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 415. [2019-11-23 22:19:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-11-23 22:19:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 517 transitions. [2019-11-23 22:19:03,290 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 517 transitions. Word has length 37 [2019-11-23 22:19:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:03,291 INFO L462 AbstractCegarLoop]: Abstraction has 415 states and 517 transitions. [2019-11-23 22:19:03,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 517 transitions. [2019-11-23 22:19:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-23 22:19:03,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:03,294 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:19:03,294 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.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.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:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1160861440, now seen corresponding path program 1 times [2019-11-23 22:19:03,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:03,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739084453] [2019-11-23 22:19:03,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:03,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739084453] [2019-11-23 22:19:03,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:03,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:03,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014853631] [2019-11-23 22:19:03,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:03,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:03,370 INFO L87 Difference]: Start difference. First operand 415 states and 517 transitions. Second operand 5 states. [2019-11-23 22:19:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:03,668 INFO L93 Difference]: Finished difference Result 1220 states and 1536 transitions. [2019-11-23 22:19:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:03,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-23 22:19:03,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:03,671 INFO L225 Difference]: With dead ends: 1220 [2019-11-23 22:19:03,671 INFO L226 Difference]: Without dead ends: 891 [2019-11-23 22:19:03,672 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:19:03,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-11-23 22:19:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 433. [2019-11-23 22:19:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-23 22:19:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 533 transitions. [2019-11-23 22:19:03,736 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 533 transitions. Word has length 37 [2019-11-23 22:19:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:03,736 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 533 transitions. [2019-11-23 22:19:03,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:03,736 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 533 transitions. [2019-11-23 22:19:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-23 22:19:03,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:03,737 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:19:03,738 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.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.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:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash 407636716, now seen corresponding path program 1 times [2019-11-23 22:19:03,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:03,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279167881] [2019-11-23 22:19:03,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:03,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279167881] [2019-11-23 22:19:03,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:03,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:03,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256642104] [2019-11-23 22:19:03,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:03,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:03,766 INFO L87 Difference]: Start difference. First operand 433 states and 533 transitions. Second operand 3 states. [2019-11-23 22:19:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:03,921 INFO L93 Difference]: Finished difference Result 710 states and 880 transitions. [2019-11-23 22:19:03,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:03,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-23 22:19:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:03,923 INFO L225 Difference]: With dead ends: 710 [2019-11-23 22:19:03,923 INFO L226 Difference]: Without dead ends: 369 [2019-11-23 22:19:03,924 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:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-11-23 22:19:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2019-11-23 22:19:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-11-23 22:19:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 449 transitions. [2019-11-23 22:19:03,961 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 449 transitions. Word has length 44 [2019-11-23 22:19:03,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:03,961 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 449 transitions. [2019-11-23 22:19:03,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:03,961 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 449 transitions. [2019-11-23 22:19:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:19:03,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:03,967 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] [2019-11-23 22:19:03,967 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.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.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:03,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:03,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1964567156, now seen corresponding path program 1 times [2019-11-23 22:19:03,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:03,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176153497] [2019-11-23 22:19:03,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:04,062 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:04,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176153497] [2019-11-23 22:19:04,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:04,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:19:04,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328460046] [2019-11-23 22:19:04,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:19:04,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:19:04,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:19:04,066 INFO L87 Difference]: Start difference. First operand 369 states and 449 transitions. Second operand 11 states. [2019-11-23 22:19:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:04,519 INFO L93 Difference]: Finished difference Result 1099 states and 1352 transitions. [2019-11-23 22:19:04,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:19:04,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2019-11-23 22:19:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:04,520 INFO L225 Difference]: With dead ends: 1099 [2019-11-23 22:19:04,520 INFO L226 Difference]: Without dead ends: 787 [2019-11-23 22:19:04,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2019-11-23 22:19:04,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-11-23 22:19:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 350. [2019-11-23 22:19:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-11-23 22:19:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 422 transitions. [2019-11-23 22:19:04,558 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 422 transitions. Word has length 51 [2019-11-23 22:19:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:04,558 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 422 transitions. [2019-11-23 22:19:04,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:19:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 422 transitions. [2019-11-23 22:19:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:19:04,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:04,559 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] [2019-11-23 22:19:04,560 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.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.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:04,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:04,560 INFO L82 PathProgramCache]: Analyzing trace with hash -32479085, now seen corresponding path program 1 times [2019-11-23 22:19:04,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:04,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226953994] [2019-11-23 22:19:04,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:04,657 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:04,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226953994] [2019-11-23 22:19:04,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:04,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 22:19:04,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504138000] [2019-11-23 22:19:04,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-23 22:19:04,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-23 22:19:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-23 22:19:04,659 INFO L87 Difference]: Start difference. First operand 350 states and 422 transitions. Second operand 11 states. [2019-11-23 22:19:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:05,212 INFO L93 Difference]: Finished difference Result 761 states and 936 transitions. [2019-11-23 22:19:05,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-23 22:19:05,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-23 22:19:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:05,214 INFO L225 Difference]: With dead ends: 761 [2019-11-23 22:19:05,214 INFO L226 Difference]: Without dead ends: 691 [2019-11-23 22:19:05,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:19:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-11-23 22:19:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 550. [2019-11-23 22:19:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-11-23 22:19:05,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 666 transitions. [2019-11-23 22:19:05,288 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 666 transitions. Word has length 56 [2019-11-23 22:19:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:05,288 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 666 transitions. [2019-11-23 22:19:05,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-23 22:19:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 666 transitions. [2019-11-23 22:19:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:19:05,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:05,290 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] [2019-11-23 22:19:05,290 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.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.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:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:05,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1796530747, now seen corresponding path program 1 times [2019-11-23 22:19:05,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:05,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665943664] [2019-11-23 22:19:05,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:05,377 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:05,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665943664] [2019-11-23 22:19:05,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:05,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:19:05,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756795890] [2019-11-23 22:19:05,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:19:05,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:05,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:19:05,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:19:05,379 INFO L87 Difference]: Start difference. First operand 550 states and 666 transitions. Second operand 10 states. [2019-11-23 22:19:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:05,706 INFO L93 Difference]: Finished difference Result 1116 states and 1344 transitions. [2019-11-23 22:19:05,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:19:05,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-23 22:19:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:05,708 INFO L225 Difference]: With dead ends: 1116 [2019-11-23 22:19:05,709 INFO L226 Difference]: Without dead ends: 1057 [2019-11-23 22:19:05,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:19:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-11-23 22:19:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 557. [2019-11-23 22:19:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-11-23 22:19:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 673 transitions. [2019-11-23 22:19:05,782 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 673 transitions. Word has length 58 [2019-11-23 22:19:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:05,782 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 673 transitions. [2019-11-23 22:19:05,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:19:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 673 transitions. [2019-11-23 22:19:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-23 22:19:05,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:05,783 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] [2019-11-23 22:19:05,784 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.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.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:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:05,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1111651139, now seen corresponding path program 1 times [2019-11-23 22:19:05,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:05,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981270547] [2019-11-23 22:19:05,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:05,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981270547] [2019-11-23 22:19:05,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:05,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:19:05,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345667048] [2019-11-23 22:19:05,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:19:05,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:19:05,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:19:05,870 INFO L87 Difference]: Start difference. First operand 557 states and 673 transitions. Second operand 10 states. [2019-11-23 22:19:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:06,182 INFO L93 Difference]: Finished difference Result 1072 states and 1295 transitions. [2019-11-23 22:19:06,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:19:06,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-23 22:19:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:06,185 INFO L225 Difference]: With dead ends: 1072 [2019-11-23 22:19:06,185 INFO L226 Difference]: Without dead ends: 1013 [2019-11-23 22:19:06,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-23 22:19:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-11-23 22:19:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 506. [2019-11-23 22:19:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-11-23 22:19:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 617 transitions. [2019-11-23 22:19:06,240 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 617 transitions. Word has length 58 [2019-11-23 22:19:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:06,240 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 617 transitions. [2019-11-23 22:19:06,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:19:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 617 transitions. [2019-11-23 22:19:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-23 22:19:06,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:06,241 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:19:06,241 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.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.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:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:06,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1160235172, now seen corresponding path program 1 times [2019-11-23 22:19:06,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:06,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142986036] [2019-11-23 22:19:06,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:06,280 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:06,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142986036] [2019-11-23 22:19:06,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:06,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:06,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317326203] [2019-11-23 22:19:06,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:06,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:06,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:06,282 INFO L87 Difference]: Start difference. First operand 506 states and 617 transitions. Second operand 5 states. [2019-11-23 22:19:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:06,586 INFO L93 Difference]: Finished difference Result 1350 states and 1660 transitions. [2019-11-23 22:19:06,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:06,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-23 22:19:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:06,588 INFO L225 Difference]: With dead ends: 1350 [2019-11-23 22:19:06,588 INFO L226 Difference]: Without dead ends: 1014 [2019-11-23 22:19:06,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:19:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-11-23 22:19:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 476. [2019-11-23 22:19:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-23 22:19:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 576 transitions. [2019-11-23 22:19:06,672 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 576 transitions. Word has length 60 [2019-11-23 22:19:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:06,673 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 576 transitions. [2019-11-23 22:19:06,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 576 transitions. [2019-11-23 22:19:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:19:06,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:06,674 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] [2019-11-23 22:19:06,675 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.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.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:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:06,676 INFO L82 PathProgramCache]: Analyzing trace with hash -624824160, now seen corresponding path program 1 times [2019-11-23 22:19:06,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:06,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125361994] [2019-11-23 22:19:06,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:06,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:19:06,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125361994] [2019-11-23 22:19:06,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:06,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:19:06,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421019447] [2019-11-23 22:19:06,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:19:06,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:06,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:19:06,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:19:06,781 INFO L87 Difference]: Start difference. First operand 476 states and 576 transitions. Second operand 10 states. [2019-11-23 22:19:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:07,031 INFO L93 Difference]: Finished difference Result 951 states and 1148 transitions. [2019-11-23 22:19:07,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:19:07,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-11-23 22:19:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:07,033 INFO L225 Difference]: With dead ends: 951 [2019-11-23 22:19:07,033 INFO L226 Difference]: Without dead ends: 909 [2019-11-23 22:19:07,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:19:07,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-11-23 22:19:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 521. [2019-11-23 22:19:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-11-23 22:19:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 627 transitions. [2019-11-23 22:19:07,110 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 627 transitions. Word has length 63 [2019-11-23 22:19:07,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:07,110 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 627 transitions. [2019-11-23 22:19:07,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:19:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 627 transitions. [2019-11-23 22:19:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:19:07,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:07,112 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] [2019-11-23 22:19:07,112 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.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.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:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -423000226, now seen corresponding path program 1 times [2019-11-23 22:19:07,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:07,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557207240] [2019-11-23 22:19:07,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:07,194 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:07,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557207240] [2019-11-23 22:19:07,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:07,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-23 22:19:07,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373988052] [2019-11-23 22:19:07,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:19:07,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:07,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:19:07,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:19:07,195 INFO L87 Difference]: Start difference. First operand 521 states and 627 transitions. Second operand 10 states. [2019-11-23 22:19:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:07,446 INFO L93 Difference]: Finished difference Result 723 states and 862 transitions. [2019-11-23 22:19:07,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-23 22:19:07,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-11-23 22:19:07,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:07,448 INFO L225 Difference]: With dead ends: 723 [2019-11-23 22:19:07,448 INFO L226 Difference]: Without dead ends: 681 [2019-11-23 22:19:07,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:19:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-23 22:19:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 248. [2019-11-23 22:19:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-23 22:19:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 290 transitions. [2019-11-23 22:19:07,475 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 290 transitions. Word has length 63 [2019-11-23 22:19:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:07,475 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 290 transitions. [2019-11-23 22:19:07,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:19:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 290 transitions. [2019-11-23 22:19:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 22:19:07,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:07,476 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] [2019-11-23 22:19:07,477 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.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.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:07,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1951490124, now seen corresponding path program 1 times [2019-11-23 22:19:07,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:07,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084115111] [2019-11-23 22:19:07,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:07,540 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:07,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084115111] [2019-11-23 22:19:07,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:07,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:07,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621871809] [2019-11-23 22:19:07,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:07,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:07,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:07,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:07,543 INFO L87 Difference]: Start difference. First operand 248 states and 290 transitions. Second operand 5 states. [2019-11-23 22:19:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:07,748 INFO L93 Difference]: Finished difference Result 529 states and 621 transitions. [2019-11-23 22:19:07,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:07,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-23 22:19:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:07,749 INFO L225 Difference]: With dead ends: 529 [2019-11-23 22:19:07,749 INFO L226 Difference]: Without dead ends: 380 [2019-11-23 22:19:07,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:19:07,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-23 22:19:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 254. [2019-11-23 22:19:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-23 22:19:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 296 transitions. [2019-11-23 22:19:07,791 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 296 transitions. Word has length 83 [2019-11-23 22:19:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:07,792 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 296 transitions. [2019-11-23 22:19:07,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 296 transitions. [2019-11-23 22:19:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:19:07,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:07,793 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:19:07,794 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.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.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:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash 393428419, now seen corresponding path program 1 times [2019-11-23 22:19:07,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:07,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160068719] [2019-11-23 22:19:07,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:07,835 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:07,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160068719] [2019-11-23 22:19:07,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:07,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:07,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980194164] [2019-11-23 22:19:07,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:07,837 INFO L87 Difference]: Start difference. First operand 254 states and 296 transitions. Second operand 4 states. [2019-11-23 22:19:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:07,925 INFO L93 Difference]: Finished difference Result 464 states and 540 transitions. [2019-11-23 22:19:07,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:19:07,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-23 22:19:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:07,926 INFO L225 Difference]: With dead ends: 464 [2019-11-23 22:19:07,927 INFO L226 Difference]: Without dead ends: 262 [2019-11-23 22:19:07,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:07,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-23 22:19:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2019-11-23 22:19:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-23 22:19:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 292 transitions. [2019-11-23 22:19:07,975 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 292 transitions. Word has length 84 [2019-11-23 22:19:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:07,976 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 292 transitions. [2019-11-23 22:19:07,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 292 transitions. [2019-11-23 22:19:07,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 22:19:07,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:07,978 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:19:07,978 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.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.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:07,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:07,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1591839229, now seen corresponding path program 1 times [2019-11-23 22:19:07,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:07,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982701194] [2019-11-23 22:19:07,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:08,047 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:08,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982701194] [2019-11-23 22:19:08,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:08,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:08,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783042080] [2019-11-23 22:19:08,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:08,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:08,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:08,049 INFO L87 Difference]: Start difference. First operand 254 states and 292 transitions. Second operand 5 states. [2019-11-23 22:19:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:08,312 INFO L93 Difference]: Finished difference Result 480 states and 551 transitions. [2019-11-23 22:19:08,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:08,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-11-23 22:19:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:08,313 INFO L225 Difference]: With dead ends: 480 [2019-11-23 22:19:08,313 INFO L226 Difference]: Without dead ends: 385 [2019-11-23 22:19:08,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:19:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-23 22:19:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 235. [2019-11-23 22:19:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-23 22:19:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 268 transitions. [2019-11-23 22:19:08,375 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 268 transitions. Word has length 84 [2019-11-23 22:19:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:08,375 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 268 transitions. [2019-11-23 22:19:08,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 268 transitions. [2019-11-23 22:19:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 22:19:08,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:08,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:08,377 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.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.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:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash 368402400, now seen corresponding path program 1 times [2019-11-23 22:19:08,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:08,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125951840] [2019-11-23 22:19:08,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:08,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125951840] [2019-11-23 22:19:08,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:08,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:08,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519933006] [2019-11-23 22:19:08,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:08,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:08,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:08,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:08,438 INFO L87 Difference]: Start difference. First operand 235 states and 268 transitions. Second operand 5 states. [2019-11-23 22:19:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:08,592 INFO L93 Difference]: Finished difference Result 339 states and 383 transitions. [2019-11-23 22:19:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:19:08,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-11-23 22:19:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:08,593 INFO L225 Difference]: With dead ends: 339 [2019-11-23 22:19:08,593 INFO L226 Difference]: Without dead ends: 303 [2019-11-23 22:19:08,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:19:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-11-23 22:19:08,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 218. [2019-11-23 22:19:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-11-23 22:19:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 247 transitions. [2019-11-23 22:19:08,638 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 247 transitions. Word has length 105 [2019-11-23 22:19:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:08,638 INFO L462 AbstractCegarLoop]: Abstraction has 218 states and 247 transitions. [2019-11-23 22:19:08,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 247 transitions. [2019-11-23 22:19:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 22:19:08,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:08,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:08,640 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.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.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:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:08,640 INFO L82 PathProgramCache]: Analyzing trace with hash -685336258, now seen corresponding path program 1 times [2019-11-23 22:19:08,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:08,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210733264] [2019-11-23 22:19:08,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:08,696 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:08,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210733264] [2019-11-23 22:19:08,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:08,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:08,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135237622] [2019-11-23 22:19:08,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:08,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:08,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:08,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:08,698 INFO L87 Difference]: Start difference. First operand 218 states and 247 transitions. Second operand 5 states. [2019-11-23 22:19:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:08,863 INFO L93 Difference]: Finished difference Result 267 states and 301 transitions. [2019-11-23 22:19:08,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:19:08,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-11-23 22:19:08,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:08,865 INFO L225 Difference]: With dead ends: 267 [2019-11-23 22:19:08,865 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:19:08,866 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:19:08,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:19:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:19:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:19:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:19:08,867 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-11-23 22:19:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:08,867 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:19:08,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:19:08,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:19:08,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:19:08,989 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2019-11-23 22:19:09,400 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 245 [2019-11-23 22:19:09,625 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 163 [2019-11-23 22:19:09,742 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 125 [2019-11-23 22:19:10,035 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 273 DAG size of output: 252 [2019-11-23 22:19:10,236 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 127 [2019-11-23 22:19:10,457 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 127 [2019-11-23 22:19:10,886 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 279 [2019-11-23 22:19:11,215 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 271 DAG size of output: 250 [2019-11-23 22:19:11,534 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 154 [2019-11-23 22:19:11,727 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 159 [2019-11-23 22:19:11,918 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 163 [2019-11-23 22:19:12,088 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 131 [2019-11-23 22:19:12,275 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 163 [2019-11-23 22:19:12,720 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 153 [2019-11-23 22:19:12,848 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 149 [2019-11-23 22:19:12,975 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 154 [2019-11-23 22:19:13,132 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 159 [2019-11-23 22:19:13,338 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 163 [2019-11-23 22:19:13,834 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 162 [2019-11-23 22:19:14,398 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 159 [2019-11-23 22:19:14,564 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 163 [2019-11-23 22:19:14,831 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 154 [2019-11-23 22:19:14,947 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 245 [2019-11-23 22:19:15,241 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 146 [2019-11-23 22:19:15,455 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 160 [2019-11-23 22:19:15,680 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 163 [2019-11-23 22:19:16,014 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 165 [2019-11-23 22:19:16,294 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 168 [2019-11-23 22:19:17,112 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 152 [2019-11-23 22:19:17,296 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 155 [2019-11-23 22:19:17,479 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 164 [2019-11-23 22:19:17,721 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 154 [2019-11-23 22:19:17,882 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 159 [2019-11-23 22:19:18,049 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 146 [2019-11-23 22:19:18,176 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 151 [2019-11-23 22:19:18,303 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 151 [2019-11-23 22:19:18,716 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 48 [2019-11-23 22:19:19,019 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 48 [2019-11-23 22:19:20,950 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 239 DAG size of output: 155 [2019-11-23 22:19:21,180 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2019-11-23 22:19:21,346 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-23 22:19:22,316 WARN L192 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 108 [2019-11-23 22:19:22,848 WARN L192 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 64 [2019-11-23 22:19:23,104 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:19:25,078 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 250 DAG size of output: 157 [2019-11-23 22:19:25,529 WARN L192 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2019-11-23 22:19:26,017 WARN L192 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2019-11-23 22:19:26,528 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 64 [2019-11-23 22:19:27,019 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2019-11-23 22:19:27,307 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-23 22:19:27,671 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-11-23 22:19:30,213 WARN L192 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 277 DAG size of output: 181 [2019-11-23 22:19:30,643 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2019-11-23 22:19:30,906 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:19:31,399 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 64 [2019-11-23 22:19:33,333 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 248 DAG size of output: 155 [2019-11-23 22:19:33,698 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-11-23 22:19:34,088 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-11-23 22:19:34,488 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-11-23 22:19:35,504 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 152 DAG size of output: 71 [2019-11-23 22:19:36,801 WARN L192 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 157 DAG size of output: 71 [2019-11-23 22:19:38,265 WARN L192 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 161 DAG size of output: 71 [2019-11-23 22:19:38,555 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:19:39,000 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2019-11-23 22:19:39,133 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-23 22:19:39,871 WARN L192 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 80 [2019-11-23 22:19:41,446 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 161 DAG size of output: 71 [2019-11-23 22:19:41,721 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:19:42,226 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2019-11-23 22:19:42,611 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-11-23 22:19:42,823 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-23 22:19:43,255 WARN L192 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2019-11-23 22:19:43,784 WARN L192 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 64 [2019-11-23 22:19:44,140 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-11-23 22:19:44,433 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 44 [2019-11-23 22:19:45,348 WARN L192 SmtUtils]: Spent 913.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 77 [2019-11-23 22:19:45,487 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-23 22:19:46,239 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-11-23 22:19:46,409 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-23 22:19:47,321 WARN L192 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 99 [2019-11-23 22:19:48,303 WARN L192 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 71 [2019-11-23 22:19:48,488 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-23 22:19:49,798 WARN L192 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 157 DAG size of output: 71 [2019-11-23 22:19:50,274 WARN L192 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2019-11-23 22:19:50,894 WARN L192 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2019-11-23 22:19:52,366 WARN L192 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 161 DAG size of output: 71 [2019-11-23 22:19:52,569 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-11-23 22:19:53,450 WARN L192 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2019-11-23 22:19:53,962 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2019-11-23 22:19:54,497 WARN L192 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-23 22:19:54,733 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 44 [2019-11-23 22:19:55,674 WARN L192 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 77 [2019-11-23 22:19:55,897 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-23 22:19:56,173 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2019-11-23 22:19:57,361 WARN L192 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 153 DAG size of output: 77 [2019-11-23 22:19:57,692 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-11-23 22:19:58,123 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-11-23 22:19:58,579 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2019-11-23 22:19:59,202 WARN L192 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 64 [2019-11-23 22:19:59,766 WARN L192 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 64 [2019-11-23 22:20:00,088 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:20:00,458 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-23 22:20:00,949 WARN L192 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 76 [2019-11-23 22:20:01,127 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-11-23 22:20:01,741 WARN L192 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 76 [2019-11-23 22:20:02,465 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2019-11-23 22:20:02,740 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-23 22:20:02,864 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-23 22:20:03,187 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 73 [2019-11-23 22:20:03,591 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-11-23 22:20:03,803 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-11-23 22:20:05,121 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 157 DAG size of output: 71 [2019-11-23 22:20:06,659 WARN L192 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 161 DAG size of output: 71 [2019-11-23 22:20:06,842 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-23 22:20:07,366 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2019-11-23 22:20:07,790 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2019-11-23 22:20:08,162 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-11-23 22:20:09,165 WARN L192 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 152 DAG size of output: 71 [2019-11-23 22:20:11,171 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 239 DAG size of output: 155 [2019-11-23 22:20:11,792 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2019-11-23 22:20:11,919 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-23 22:20:12,113 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-11-23 22:20:12,637 WARN L192 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 67 [2019-11-23 22:20:13,507 WARN L192 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 76 [2019-11-23 22:20:14,739 WARN L192 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 141 DAG size of output: 63 [2019-11-23 22:20:16,415 WARN L192 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 158 DAG size of output: 68