/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/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:19:54,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:19:54,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:19:54,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:19:54,120 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:19:54,122 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:19:54,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:19:54,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:19:54,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:19:54,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:19:54,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:19:54,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:19:54,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:19:54,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:19:54,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:19:54,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:19:54,134 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:19:54,135 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:19:54,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:19:54,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:19:54,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:19:54,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:19:54,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:19:54,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:19:54,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:19:54,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:19:54,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:19:54,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:19:54,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:19:54,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:19:54,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:19:54,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:19:54,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:19:54,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:19:54,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:19:54,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:19:54,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:19:54,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:19:54,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:19:54,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:19:54,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:19:54,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:19:54,168 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:19:54,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:19:54,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:19:54,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:19:54,169 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:19:54,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:19:54,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:19:54,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:19:54,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:19:54,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:19:54,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:19:54,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:19:54,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:19:54,171 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:19:54,171 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:19:54,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:19:54,172 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:19:54,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:19:54,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:19:54,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:19:54,173 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:19:54,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:19:54,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:19:54,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:19:54,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:19:54,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:19:54,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:19:54,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:19:54,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:19:54,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:19:54,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:19:54,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:19:54,458 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:19:54,459 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:19:54,460 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:19:54,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-23 22:19:54,535 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f60aeec/5757da098afc44a7819bc00fbf07f246/FLAGfe254448a [2019-11-23 22:19:55,053 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:19:55,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2019-11-23 22:19:55,064 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f60aeec/5757da098afc44a7819bc00fbf07f246/FLAGfe254448a [2019-11-23 22:19:55,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14f60aeec/5757da098afc44a7819bc00fbf07f246 [2019-11-23 22:19:55,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:19:55,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:19:55,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:19:55,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:19:55,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:19:55,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a64cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55, skipping insertion in model container [2019-11-23 22:19:55,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:19:55,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:19:55,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:19:55,675 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:19:55,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:19:55,848 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:19:55,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55 WrapperNode [2019-11-23 22:19:55,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:19:55,849 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:19:55,849 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:19:55,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:19:55,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:19:55,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:19:55,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:19:55,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:19:55,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... [2019-11-23 22:19:55,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:19:55,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:19:55,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:19:55,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:19:55,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:19:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:19:56,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:19:56,155 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:56,161 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:56,169 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:56,174 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:56,180 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:56,184 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:56,189 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-23 22:19:56,900 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##76: assume !false; [2019-11-23 22:19:56,900 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##75: assume false; [2019-11-23 22:19:56,900 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##184: assume false; [2019-11-23 22:19:56,901 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##185: assume !false; [2019-11-23 22:19:56,901 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##58: assume !false; [2019-11-23 22:19:56,901 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##57: assume false; [2019-11-23 22:19:56,901 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##131: assume !false; [2019-11-23 22:19:56,901 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##130: assume false; [2019-11-23 22:19:56,902 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2019-11-23 22:19:56,902 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2019-11-23 22:19:56,902 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##158: assume !false; [2019-11-23 22:19:56,903 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume false; [2019-11-23 22:19:56,903 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2019-11-23 22:19:56,903 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2019-11-23 22:19:56,905 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:19:56,906 INFO L284 CfgBuilder]: Removed 78 assume(true) statements. [2019-11-23 22:19:56,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:19:56 BoogieIcfgContainer [2019-11-23 22:19:56,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:19:56,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:19:56,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:19:56,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:19:56,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:19:55" (1/3) ... [2019-11-23 22:19:56,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1804c580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:19:56, skipping insertion in model container [2019-11-23 22:19:56,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:19:55" (2/3) ... [2019-11-23 22:19:56,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1804c580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:19:56, skipping insertion in model container [2019-11-23 22:19:56,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:19:56" (3/3) ... [2019-11-23 22:19:56,918 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2019-11-23 22:19:56,928 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:19:56,936 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-11-23 22:19:56,947 INFO L249 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-11-23 22:19:56,984 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:19:56,985 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:19:56,985 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:19:56,985 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:19:56,985 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:19:56,985 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:19:56,985 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:19:56,985 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:19:57,006 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2019-11-23 22:19:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-23 22:19:57,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:57,013 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1311783926, now seen corresponding path program 1 times [2019-11-23 22:19:57,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012185997] [2019-11-23 22:19:57,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012185997] [2019-11-23 22:19:57,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699390341] [2019-11-23 22:19:57,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,250 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2019-11-23 22:19:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,379 INFO L93 Difference]: Finished difference Result 343 states and 509 transitions. [2019-11-23 22:19:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-23 22:19:57,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,404 INFO L225 Difference]: With dead ends: 343 [2019-11-23 22:19:57,404 INFO L226 Difference]: Without dead ends: 165 [2019-11-23 22:19:57,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-23 22:19:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-11-23 22:19:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-23 22:19:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-11-23 22:19:57,511 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 11 [2019-11-23 22:19:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,511 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-11-23 22:19:57,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-11-23 22:19:57,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:19:57,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:57,513 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,514 INFO L82 PathProgramCache]: Analyzing trace with hash -825827361, now seen corresponding path program 1 times [2019-11-23 22:19:57,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019079410] [2019-11-23 22:19:57,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019079410] [2019-11-23 22:19:57,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287041481] [2019-11-23 22:19:57,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,596 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 3 states. [2019-11-23 22:19:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,815 INFO L93 Difference]: Finished difference Result 251 states and 333 transitions. [2019-11-23 22:19:57,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:19:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,818 INFO L225 Difference]: With dead ends: 251 [2019-11-23 22:19:57,819 INFO L226 Difference]: Without dead ends: 200 [2019-11-23 22:19:57,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-23 22:19:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2019-11-23 22:19:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-23 22:19:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2019-11-23 22:19:57,839 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 13 [2019-11-23 22:19:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,840 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2019-11-23 22:19:57,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2019-11-23 22:19:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:19:57,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:57,841 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 169161723, now seen corresponding path program 1 times [2019-11-23 22:19:57,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009456684] [2019-11-23 22:19:57,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:57,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009456684] [2019-11-23 22:19:57,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:57,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:57,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682122848] [2019-11-23 22:19:57,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:57,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:57,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:57,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,891 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand 3 states. [2019-11-23 22:19:57,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:57,928 INFO L93 Difference]: Finished difference Result 297 states and 394 transitions. [2019-11-23 22:19:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:57,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 22:19:57,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:57,930 INFO L225 Difference]: With dead ends: 297 [2019-11-23 22:19:57,930 INFO L226 Difference]: Without dead ends: 214 [2019-11-23 22:19:57,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-23 22:19:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 170. [2019-11-23 22:19:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-23 22:19:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2019-11-23 22:19:57,960 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 14 [2019-11-23 22:19:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:57,965 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2019-11-23 22:19:57,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2019-11-23 22:19:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-23 22:19:57,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:57,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] [2019-11-23 22:19:57,967 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1790313284, now seen corresponding path program 1 times [2019-11-23 22:19:57,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:57,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8100672] [2019-11-23 22:19:57,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8100672] [2019-11-23 22:19:58,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:58,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272429964] [2019-11-23 22:19:58,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:58,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,070 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand 3 states. [2019-11-23 22:19:58,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,160 INFO L93 Difference]: Finished difference Result 170 states and 233 transitions. [2019-11-23 22:19:58,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:58,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-23 22:19:58,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,162 INFO L225 Difference]: With dead ends: 170 [2019-11-23 22:19:58,162 INFO L226 Difference]: Without dead ends: 164 [2019-11-23 22:19:58,163 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-23 22:19:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-23 22:19:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-23 22:19:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2019-11-23 22:19:58,175 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 22 [2019-11-23 22:19:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,175 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2019-11-23 22:19:58,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2019-11-23 22:19:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-23 22:19:58,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:58,178 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1900059442, now seen corresponding path program 1 times [2019-11-23 22:19:58,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522888085] [2019-11-23 22:19:58,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522888085] [2019-11-23 22:19:58,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:58,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605539672] [2019-11-23 22:19:58,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:58,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,249 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand 3 states. [2019-11-23 22:19:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,321 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2019-11-23 22:19:58,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:58,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-23 22:19:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,323 INFO L225 Difference]: With dead ends: 208 [2019-11-23 22:19:58,323 INFO L226 Difference]: Without dead ends: 161 [2019-11-23 22:19:58,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-23 22:19:58,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-23 22:19:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-23 22:19:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2019-11-23 22:19:58,340 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 25 [2019-11-23 22:19:58,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,340 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2019-11-23 22:19:58,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:58,341 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2019-11-23 22:19:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-23 22:19:58,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:19:58,345 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash 88593490, now seen corresponding path program 1 times [2019-11-23 22:19:58,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856659704] [2019-11-23 22:19:58,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856659704] [2019-11-23 22:19:58,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:58,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783769671] [2019-11-23 22:19:58,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:58,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:58,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,414 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand 3 states. [2019-11-23 22:19:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,436 INFO L93 Difference]: Finished difference Result 220 states and 298 transitions. [2019-11-23 22:19:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:58,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-23 22:19:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,438 INFO L225 Difference]: With dead ends: 220 [2019-11-23 22:19:58,438 INFO L226 Difference]: Without dead ends: 169 [2019-11-23 22:19:58,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-23 22:19:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2019-11-23 22:19:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-23 22:19:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-11-23 22:19:58,465 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 26 [2019-11-23 22:19:58,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,465 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-11-23 22:19:58,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-11-23 22:19:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:19:58,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,470 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:19:58,470 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 721476524, now seen corresponding path program 1 times [2019-11-23 22:19:58,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960653300] [2019-11-23 22:19:58,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960653300] [2019-11-23 22:19:58,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:58,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18199724] [2019-11-23 22:19:58,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:58,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:58,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:58,572 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 5 states. [2019-11-23 22:19:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,755 INFO L93 Difference]: Finished difference Result 303 states and 407 transitions. [2019-11-23 22:19:58,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:19:58,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-23 22:19:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,758 INFO L225 Difference]: With dead ends: 303 [2019-11-23 22:19:58,758 INFO L226 Difference]: Without dead ends: 253 [2019-11-23 22:19:58,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-23 22:19:58,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2019-11-23 22:19:58,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-23 22:19:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 270 transitions. [2019-11-23 22:19:58,772 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 270 transitions. Word has length 29 [2019-11-23 22:19:58,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,772 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 270 transitions. [2019-11-23 22:19:58,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 270 transitions. [2019-11-23 22:19:58,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-23 22:19:58,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,774 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:19:58,774 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,775 INFO L82 PathProgramCache]: Analyzing trace with hash 679460228, now seen corresponding path program 1 times [2019-11-23 22:19:58,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963569522] [2019-11-23 22:19:58,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:58,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:58,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963569522] [2019-11-23 22:19:58,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:58,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:58,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670554727] [2019-11-23 22:19:58,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:58,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:58,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:58,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:58,849 INFO L87 Difference]: Start difference. First operand 192 states and 270 transitions. Second operand 5 states. [2019-11-23 22:19:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:58,975 INFO L93 Difference]: Finished difference Result 275 states and 365 transitions. [2019-11-23 22:19:58,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:19:58,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-23 22:19:58,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:58,979 INFO L225 Difference]: With dead ends: 275 [2019-11-23 22:19:58,980 INFO L226 Difference]: Without dead ends: 230 [2019-11-23 22:19:58,981 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:19:58,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-23 22:19:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 174. [2019-11-23 22:19:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-23 22:19:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 240 transitions. [2019-11-23 22:19:58,993 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 240 transitions. Word has length 29 [2019-11-23 22:19:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:58,994 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 240 transitions. [2019-11-23 22:19:58,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 240 transitions. [2019-11-23 22:19:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-23 22:19:58,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:58,997 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:19:58,997 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:58,998 INFO L82 PathProgramCache]: Analyzing trace with hash 883394074, now seen corresponding path program 1 times [2019-11-23 22:19:58,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:58,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147582134] [2019-11-23 22:19:58,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147582134] [2019-11-23 22:19:59,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:19:59,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989329022] [2019-11-23 22:19:59,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:19:59,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:19:59,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:19:59,062 INFO L87 Difference]: Start difference. First operand 174 states and 240 transitions. Second operand 4 states. [2019-11-23 22:19:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,172 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2019-11-23 22:19:59,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:19:59,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-23 22:19:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,174 INFO L225 Difference]: With dead ends: 218 [2019-11-23 22:19:59,174 INFO L226 Difference]: Without dead ends: 170 [2019-11-23 22:19:59,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-23 22:19:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-11-23 22:19:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-23 22:19:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2019-11-23 22:19:59,186 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 234 transitions. Word has length 30 [2019-11-23 22:19:59,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,186 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 234 transitions. [2019-11-23 22:19:59,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:19:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 234 transitions. [2019-11-23 22:19:59,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-23 22:19:59,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,188 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:19:59,188 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1219124044, now seen corresponding path program 1 times [2019-11-23 22:19:59,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579063870] [2019-11-23 22:19:59,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579063870] [2019-11-23 22:19:59,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:59,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958963245] [2019-11-23 22:19:59,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:59,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,223 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. Second operand 3 states. [2019-11-23 22:19:59,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,243 INFO L93 Difference]: Finished difference Result 177 states and 244 transitions. [2019-11-23 22:19:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:59,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-23 22:19:59,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,244 INFO L225 Difference]: With dead ends: 177 [2019-11-23 22:19:59,244 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 22:19:59,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 22:19:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-23 22:19:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 22:19:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-11-23 22:19:59,248 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 31 [2019-11-23 22:19:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,250 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-11-23 22:19:59,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-11-23 22:19:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:19:59,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,252 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:59,252 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,253 INFO L82 PathProgramCache]: Analyzing trace with hash 358090674, now seen corresponding path program 1 times [2019-11-23 22:19:59,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315953744] [2019-11-23 22:19:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315953744] [2019-11-23 22:19:59,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:59,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123069501] [2019-11-23 22:19:59,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:59,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:59,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:59,313 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2019-11-23 22:19:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,352 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2019-11-23 22:19:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:19:59,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-23 22:19:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,353 INFO L225 Difference]: With dead ends: 69 [2019-11-23 22:19:59,353 INFO L226 Difference]: Without dead ends: 65 [2019-11-23 22:19:59,354 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:19:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-23 22:19:59,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-11-23 22:19:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-23 22:19:59,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2019-11-23 22:19:59,360 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 32 [2019-11-23 22:19:59,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,361 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2019-11-23 22:19:59,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2019-11-23 22:19:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:19:59,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,362 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:59,363 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 316074378, now seen corresponding path program 1 times [2019-11-23 22:19:59,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752969660] [2019-11-23 22:19:59,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752969660] [2019-11-23 22:19:59,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:59,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002286412] [2019-11-23 22:19:59,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:59,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:59,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,401 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 3 states. [2019-11-23 22:19:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,421 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2019-11-23 22:19:59,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:59,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:19:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,422 INFO L225 Difference]: With dead ends: 65 [2019-11-23 22:19:59,422 INFO L226 Difference]: Without dead ends: 50 [2019-11-23 22:19:59,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-23 22:19:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-23 22:19:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-23 22:19:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2019-11-23 22:19:59,426 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2019-11-23 22:19:59,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,427 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2019-11-23 22:19:59,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2019-11-23 22:19:59,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:19:59,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,427 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:59,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,428 INFO L82 PathProgramCache]: Analyzing trace with hash -493272248, now seen corresponding path program 1 times [2019-11-23 22:19:59,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611803338] [2019-11-23 22:19:59,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611803338] [2019-11-23 22:19:59,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:59,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977177384] [2019-11-23 22:19:59,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:59,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:59,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,454 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 3 states. [2019-11-23 22:19:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,478 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2019-11-23 22:19:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:59,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:19:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,479 INFO L225 Difference]: With dead ends: 62 [2019-11-23 22:19:59,479 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 22:19:59,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 22:19:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-11-23 22:19:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 22:19:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-11-23 22:19:59,483 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 32 [2019-11-23 22:19:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,483 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-11-23 22:19:59,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-11-23 22:19:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-23 22:19:59,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,484 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:59,484 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1452502264, now seen corresponding path program 1 times [2019-11-23 22:19:59,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805698498] [2019-11-23 22:19:59,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805698498] [2019-11-23 22:19:59,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:59,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532095154] [2019-11-23 22:19:59,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:59,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,511 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 3 states. [2019-11-23 22:19:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,529 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-11-23 22:19:59,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:59,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-23 22:19:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,530 INFO L225 Difference]: With dead ends: 52 [2019-11-23 22:19:59,530 INFO L226 Difference]: Without dead ends: 48 [2019-11-23 22:19:59,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-23 22:19:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-11-23 22:19:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-23 22:19:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-23 22:19:59,534 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 32 [2019-11-23 22:19:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,534 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-23 22:19:59,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-23 22:19:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:19:59,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,535 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:59,536 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1791632684, now seen corresponding path program 1 times [2019-11-23 22:19:59,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848499733] [2019-11-23 22:19:59,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848499733] [2019-11-23 22:19:59,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:19:59,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041151367] [2019-11-23 22:19:59,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:19:59,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:19:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:19:59,607 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 5 states. [2019-11-23 22:19:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,653 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-11-23 22:19:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-23 22:19:59,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-23 22:19:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,655 INFO L225 Difference]: With dead ends: 53 [2019-11-23 22:19:59,655 INFO L226 Difference]: Without dead ends: 47 [2019-11-23 22:19:59,655 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:19:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-23 22:19:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2019-11-23 22:19:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-23 22:19:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-11-23 22:19:59,659 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2019-11-23 22:19:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,659 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-11-23 22:19:59,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:19:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-11-23 22:19:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-23 22:19:59,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:19:59,660 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:59,660 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:19:59,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:19:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1200712151, now seen corresponding path program 1 times [2019-11-23 22:19:59,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:19:59,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448354014] [2019-11-23 22:19:59,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:19:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:19:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:19:59,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448354014] [2019-11-23 22:19:59,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:19:59,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:19:59,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173977681] [2019-11-23 22:19:59,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:19:59,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:19:59,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:19:59,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,693 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 3 states. [2019-11-23 22:19:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:19:59,703 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-23 22:19:59,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:19:59,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-23 22:19:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:19:59,704 INFO L225 Difference]: With dead ends: 38 [2019-11-23 22:19:59,704 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:19:59,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:19:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:19:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:19:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:19:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:19:59,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-23 22:19:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:19:59,705 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:19:59,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:19:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:19:59,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:19:59,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:20:00,678 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-11-23 22:20:00,707 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,707 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,707 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 181) no Hoare annotation was computed. [2019-11-23 22:20:00,707 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 270) no Hoare annotation was computed. [2019-11-23 22:20:00,707 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 281) no Hoare annotation was computed. [2019-11-23 22:20:00,708 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,708 INFO L444 ceAbstractionStarter]: For program point L368(lines 368 372) no Hoare annotation was computed. [2019-11-23 22:20:00,708 INFO L440 ceAbstractionStarter]: At program point L104(lines 103 281) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,708 INFO L440 ceAbstractionStarter]: At program point L534(lines 526 545) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ~s~0 ~NP~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,708 INFO L444 ceAbstractionStarter]: For program point L402(lines 402 410) no Hoare annotation was computed. [2019-11-23 22:20:00,709 INFO L440 ceAbstractionStarter]: At program point L469(lines 442 497) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (= ~MPR1~0 ~s~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~setEventCalled~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5))) [2019-11-23 22:20:00,709 INFO L440 ceAbstractionStarter]: At program point L469-1(lines 442 497) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,709 INFO L440 ceAbstractionStarter]: At program point L469-2(lines 442 497) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,709 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 405) no Hoare annotation was computed. [2019-11-23 22:20:00,709 INFO L440 ceAbstractionStarter]: At program point L469-3(lines 442 497) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,710 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 269) no Hoare annotation was computed. [2019-11-23 22:20:00,710 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 280) no Hoare annotation was computed. [2019-11-23 22:20:00,710 INFO L444 ceAbstractionStarter]: For program point L503(lines 503 509) no Hoare annotation was computed. [2019-11-23 22:20:00,710 INFO L444 ceAbstractionStarter]: For program point L338-1(lines 337 347) no Hoare annotation was computed. [2019-11-23 22:20:00,710 INFO L440 ceAbstractionStarter]: At program point L107(lines 106 280) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,710 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 180) no Hoare annotation was computed. [2019-11-23 22:20:00,710 INFO L440 ceAbstractionStarter]: At program point L174-1(lines 1 582) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,711 INFO L440 ceAbstractionStarter]: At program point L571(lines 563 573) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-23 22:20:00,711 INFO L440 ceAbstractionStarter]: At program point L571-1(lines 563 573) the Hoare annotation is: false [2019-11-23 22:20:00,711 INFO L440 ceAbstractionStarter]: At program point L571-2(lines 563 573) the Hoare annotation is: false [2019-11-23 22:20:00,711 INFO L440 ceAbstractionStarter]: At program point L571-3(lines 563 573) the Hoare annotation is: false [2019-11-23 22:20:00,711 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,711 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 268) no Hoare annotation was computed. [2019-11-23 22:20:00,712 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 279) no Hoare annotation was computed. [2019-11-23 22:20:00,712 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,712 INFO L444 ceAbstractionStarter]: For program point L539(lines 539 543) no Hoare annotation was computed. [2019-11-23 22:20:00,712 INFO L440 ceAbstractionStarter]: At program point L539-1(lines 539 543) the Hoare annotation is: (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,712 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 409) no Hoare annotation was computed. [2019-11-23 22:20:00,712 INFO L440 ceAbstractionStarter]: At program point L374(lines 367 416) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,712 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,713 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,713 INFO L444 ceAbstractionStarter]: For program point L376(lines 376 380) no Hoare annotation was computed. [2019-11-23 22:20:00,713 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,713 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 267) no Hoare annotation was computed. [2019-11-23 22:20:00,713 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 278) no Hoare annotation was computed. [2019-11-23 22:20:00,713 INFO L440 ceAbstractionStarter]: At program point L46(lines 338 343) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,713 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,713 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 446) no Hoare annotation was computed. [2019-11-23 22:20:00,714 INFO L440 ceAbstractionStarter]: At program point L443-1(lines 443 446) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-23 22:20:00,714 INFO L444 ceAbstractionStarter]: For program point L443-2(lines 443 446) no Hoare annotation was computed. [2019-11-23 22:20:00,714 INFO L440 ceAbstractionStarter]: At program point L443-3(lines 443 446) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,714 INFO L444 ceAbstractionStarter]: For program point L443-4(lines 443 446) no Hoare annotation was computed. [2019-11-23 22:20:00,714 INFO L440 ceAbstractionStarter]: At program point L443-5(lines 443 446) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,714 INFO L444 ceAbstractionStarter]: For program point L443-6(lines 443 446) no Hoare annotation was computed. [2019-11-23 22:20:00,714 INFO L440 ceAbstractionStarter]: At program point L443-7(lines 443 446) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 494) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L477-1(lines 477 494) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L477-2(lines 477 494) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L477-3(lines 477 494) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L478-3(lines 478 484) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L478-6(lines 478 484) no Hoare annotation was computed. [2019-11-23 22:20:00,715 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 220) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L478-9(lines 478 484) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 266) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 277) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L579(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L579-1(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L579-2(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L579-3(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L579-4(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L579-5(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,716 INFO L444 ceAbstractionStarter]: For program point L579-6(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-7(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-8(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-9(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-10(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-11(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-12(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-13(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-14(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,717 INFO L444 ceAbstractionStarter]: For program point L579-15(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,718 INFO L440 ceAbstractionStarter]: At program point L580-3(lines 1 582) the Hoare annotation is: (let ((.cse2 (= ~s~0 ~NP~0)) (.cse0 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse1 (not (= 1 ~pended~0))) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse3 .cse4 .cse5)) (= ~setEventCalled~0 1)))) [2019-11-23 22:20:00,718 INFO L440 ceAbstractionStarter]: At program point L580-6(lines 1 582) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,718 INFO L440 ceAbstractionStarter]: At program point L382(lines 375 415) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,718 INFO L440 ceAbstractionStarter]: At program point L580-8(lines 1 582) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,718 INFO L440 ceAbstractionStarter]: At program point L580-9(lines 1 582) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,719 INFO L440 ceAbstractionStarter]: At program point L283(lines 73 285) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,719 INFO L440 ceAbstractionStarter]: At program point L580-11(lines 1 582) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,719 INFO L440 ceAbstractionStarter]: At program point L580-12(lines 1 582) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,719 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 265) no Hoare annotation was computed. [2019-11-23 22:20:00,719 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 276) no Hoare annotation was computed. [2019-11-23 22:20:00,719 INFO L440 ceAbstractionStarter]: At program point L580-14(lines 1 582) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,719 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 560) no Hoare annotation was computed. [2019-11-23 22:20:00,720 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 472) no Hoare annotation was computed. [2019-11-23 22:20:00,720 INFO L444 ceAbstractionStarter]: For program point L449-1(lines 449 472) no Hoare annotation was computed. [2019-11-23 22:20:00,720 INFO L444 ceAbstractionStarter]: For program point L449-2(lines 449 472) no Hoare annotation was computed. [2019-11-23 22:20:00,720 INFO L447 ceAbstractionStarter]: At program point L383(lines 367 416) the Hoare annotation is: true [2019-11-23 22:20:00,720 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 365) no Hoare annotation was computed. [2019-11-23 22:20:00,720 INFO L444 ceAbstractionStarter]: For program point L449-3(lines 449 472) no Hoare annotation was computed. [2019-11-23 22:20:00,720 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:20:00,720 INFO L440 ceAbstractionStarter]: At program point L549(lines 548 560) the Hoare annotation is: (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,720 INFO L440 ceAbstractionStarter]: At program point L450(lines 449 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,721 INFO L440 ceAbstractionStarter]: At program point L450-1(lines 449 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,721 INFO L440 ceAbstractionStarter]: At program point L450-2(lines 449 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,721 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 413) no Hoare annotation was computed. [2019-11-23 22:20:00,721 INFO L440 ceAbstractionStarter]: At program point L351(lines 350 365) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,721 INFO L440 ceAbstractionStarter]: At program point L450-3(lines 449 472) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,721 INFO L447 ceAbstractionStarter]: At program point L418(lines 286 420) the Hoare annotation is: true [2019-11-23 22:20:00,721 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,722 INFO L444 ceAbstractionStarter]: For program point L385(lines 385 412) no Hoare annotation was computed. [2019-11-23 22:20:00,722 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 264) no Hoare annotation was computed. [2019-11-23 22:20:00,722 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 275) no Hoare annotation was computed. [2019-11-23 22:20:00,722 INFO L440 ceAbstractionStarter]: At program point L551(lines 550 560) the Hoare annotation is: (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,722 INFO L440 ceAbstractionStarter]: At program point L518(lines 513 520) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-23 22:20:00,722 INFO L440 ceAbstractionStarter]: At program point L518-1(lines 513 520) the Hoare annotation is: false [2019-11-23 22:20:00,722 INFO L440 ceAbstractionStarter]: At program point L518-2(lines 513 520) the Hoare annotation is: false [2019-11-23 22:20:00,723 INFO L440 ceAbstractionStarter]: At program point L518-3(lines 513 520) the Hoare annotation is: false [2019-11-23 22:20:00,723 INFO L444 ceAbstractionStarter]: For program point L386(lines 386 392) no Hoare annotation was computed. [2019-11-23 22:20:00,723 INFO L440 ceAbstractionStarter]: At program point L353(lines 352 365) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-11-23 22:20:00,723 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 493) no Hoare annotation was computed. [2019-11-23 22:20:00,723 INFO L444 ceAbstractionStarter]: For program point L486-2(lines 486 493) no Hoare annotation was computed. [2019-11-23 22:20:00,723 INFO L444 ceAbstractionStarter]: For program point L387(lines 387 389) no Hoare annotation was computed. [2019-11-23 22:20:00,723 INFO L444 ceAbstractionStarter]: For program point L486-4(lines 486 493) no Hoare annotation was computed. [2019-11-23 22:20:00,723 INFO L440 ceAbstractionStarter]: At program point L321(lines 295 419) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,723 INFO L444 ceAbstractionStarter]: For program point L486-6(lines 486 493) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 471) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 471) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point L454-2(lines 454 471) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point L454-3(lines 454 471) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 196) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 263) no Hoare annotation was computed. [2019-11-23 22:20:00,724 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 274) no Hoare annotation was computed. [2019-11-23 22:20:00,725 INFO L444 ceAbstractionStarter]: For program point L190-2(lines 164 259) no Hoare annotation was computed. [2019-11-23 22:20:00,725 INFO L440 ceAbstractionStarter]: At program point L521(lines 521 562) the Hoare annotation is: (and (= ~s~0 ~NP~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,725 INFO L440 ceAbstractionStarter]: At program point L455(lines 454 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-23 22:20:00,725 INFO L440 ceAbstractionStarter]: At program point L455-1(lines 454 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,725 INFO L440 ceAbstractionStarter]: At program point L455-2(lines 454 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,725 INFO L440 ceAbstractionStarter]: At program point L455-3(lines 454 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,725 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,726 INFO L440 ceAbstractionStarter]: At program point L457(lines 456 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ~MPR1~0 ~s~0) (= ULTIMATE.start_main_~status~1 0) (<= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-23 22:20:00,726 INFO L440 ceAbstractionStarter]: At program point L457-1(lines 456 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,726 INFO L440 ceAbstractionStarter]: At program point L457-2(lines 456 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,726 INFO L440 ceAbstractionStarter]: At program point L457-3(lines 456 471) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0)) [2019-11-23 22:20:00,726 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 262) no Hoare annotation was computed. [2019-11-23 22:20:00,726 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 273) no Hoare annotation was computed. [2019-11-23 22:20:00,726 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:20:00,726 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 431) no Hoare annotation was computed. [2019-11-23 22:20:00,727 INFO L444 ceAbstractionStarter]: For program point L425-2(lines 425 431) no Hoare annotation was computed. [2019-11-23 22:20:00,727 INFO L444 ceAbstractionStarter]: For program point L425-4(lines 425 431) no Hoare annotation was computed. [2019-11-23 22:20:00,727 INFO L440 ceAbstractionStarter]: At program point L260(lines 164 261) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,727 INFO L444 ceAbstractionStarter]: For program point L425-6(lines 425 431) no Hoare annotation was computed. [2019-11-23 22:20:00,727 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 545) no Hoare annotation was computed. [2019-11-23 22:20:00,727 INFO L440 ceAbstractionStarter]: At program point L394(lines 385 412) the Hoare annotation is: (and (not (= 1 ~pended~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,728 INFO L440 ceAbstractionStarter]: At program point L163(lines 109 279) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,728 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 272) no Hoare annotation was computed. [2019-11-23 22:20:00,728 INFO L444 ceAbstractionStarter]: For program point L527(lines 527 532) no Hoare annotation was computed. [2019-11-23 22:20:00,728 INFO L444 ceAbstractionStarter]: For program point L230(lines 230 236) no Hoare annotation was computed. [2019-11-23 22:20:00,728 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:20:00,728 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,729 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 400) no Hoare annotation was computed. [2019-11-23 22:20:00,729 INFO L444 ceAbstractionStarter]: For program point L330(lines 330 333) no Hoare annotation was computed. [2019-11-23 22:20:00,729 INFO L444 ceAbstractionStarter]: For program point L330-2(lines 330 333) no Hoare annotation was computed. [2019-11-23 22:20:00,729 INFO L444 ceAbstractionStarter]: For program point L198(lines 198 204) no Hoare annotation was computed. [2019-11-23 22:20:00,729 INFO L440 ceAbstractionStarter]: At program point L496(lines 435 498) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (= ~s~0 ~NP~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse4 (<= 1 ~compRegistered~0)) (.cse5 (<= (+ ~NP~0 4) ~MPR1~0))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse3 .cse4 (<= 259 |ULTIMATE.start_IofCallDriver_#res|) (<= |ULTIMATE.start_IofCallDriver_#res| 259) .cse5)) (= ~setEventCalled~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse5))) [2019-11-23 22:20:00,730 INFO L440 ceAbstractionStarter]: At program point L496-1(lines 435 498) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,730 INFO L440 ceAbstractionStarter]: At program point L496-2(lines 435 498) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,730 INFO L440 ceAbstractionStarter]: At program point L496-3(lines 435 498) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,730 INFO L444 ceAbstractionStarter]: For program point L199(lines 199 203) no Hoare annotation was computed. [2019-11-23 22:20:00,730 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 271) no Hoare annotation was computed. [2019-11-23 22:20:00,730 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 282) no Hoare annotation was computed. [2019-11-23 22:20:00,730 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 579) no Hoare annotation was computed. [2019-11-23 22:20:00,731 INFO L440 ceAbstractionStarter]: At program point L101(lines 100 282) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,731 INFO L440 ceAbstractionStarter]: At program point L68(lines 321 366) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-23 22:20:00,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:20:00 BoogieIcfgContainer [2019-11-23 22:20:00,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:20:00,773 INFO L168 Benchmark]: Toolchain (without parser) took 5401.40 ms. Allocated memory was 146.3 MB in the beginning and 283.6 MB in the end (delta: 137.4 MB). Free memory was 103.9 MB in the beginning and 155.0 MB in the end (delta: -51.1 MB). Peak memory consumption was 112.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:00,774 INFO L168 Benchmark]: CDTParser took 1.38 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:20:00,775 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.80 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.7 MB in the beginning and 179.4 MB in the end (delta: -75.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:00,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.24 ms. Allocated memory is still 203.9 MB. Free memory was 179.4 MB in the beginning and 176.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:00,776 INFO L168 Benchmark]: Boogie Preprocessor took 40.39 ms. Allocated memory is still 203.9 MB. Free memory was 176.1 MB in the beginning and 173.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:00,777 INFO L168 Benchmark]: RCFGBuilder took 950.07 ms. Allocated memory is still 203.9 MB. Free memory was 173.4 MB in the beginning and 115.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:00,778 INFO L168 Benchmark]: TraceAbstraction took 3861.17 ms. Allocated memory was 203.9 MB in the beginning and 283.6 MB in the end (delta: 79.7 MB). Free memory was 114.6 MB in the beginning and 155.0 MB in the end (delta: -40.4 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:20:00,782 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 476.80 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 103.7 MB in the beginning and 179.4 MB in the end (delta: -75.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.24 ms. Allocated memory is still 203.9 MB. Free memory was 179.4 MB in the beginning and 176.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.39 ms. Allocated memory is still 203.9 MB. Free memory was 176.1 MB in the beginning and 173.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 950.07 ms. Allocated memory is still 203.9 MB. Free memory was 173.4 MB in the beginning and 115.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3861.17 ms. Allocated memory was 203.9 MB in the beginning and 283.6 MB in the end (delta: 79.7 MB). Free memory was 114.6 MB in the beginning and 155.0 MB in the end (delta: -40.4 MB). Peak memory consumption was 65.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 579]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: ((((!(1 == pended) && s == NP) && status == 0) && !(MPR3 == s)) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 548]: Loop Invariant Derived loop invariant: (((s == NP && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 442]: Loop Invariant Derived loop invariant: ((((((0 == status && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1) || ((((((0 == status && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && 0 == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 521]: Loop Invariant Derived loop invariant: (((s == NP && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: !(1 == pended) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && MPR1 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 454]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1) && SKIP1 == s - InvariantResult [Line: 539]: Loop Invariant Derived loop invariant: (((s == NP && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((0 == status && !(1 == pended)) && s == NP) && status == 0) && 1 <= compRegistered) && 0 == returnVal2) && NP + 4 <= MPR1) || (((((((0 == status && !(1 == pended)) && s == NP) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) || ((((((0 == status && !(1 == pended)) && 259 == returnVal2) && MPR3 == s) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1)) && setEventCalled == 1) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((s == NP && !(1 == pended)) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 <= compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((((((0 == status && !(1 == pended)) && s == NP) && status == 0) && 1 <= compRegistered) && NP + 4 <= MPR1) || ((((((((0 == status && !(1 == pended)) && 259 == returnVal2) && MPR3 == s) && status == 0) && 1 <= compRegistered) && 259 <= \result) && \result <= 259) && NP + 4 <= MPR1)) && setEventCalled == 1) || (((((((0 == status && !(1 == pended)) && s == NP) && status == 0) && 1 <= compRegistered) && 0 == \result) && 0 == returnVal2) && NP + 4 <= MPR1) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 513]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 435]: Loop Invariant Derived loop invariant: (((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP + 4 <= MPR1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 173 locations, 16 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 2113 SDtfs, 1457 SDslu, 1788 SDs, 0 SdLazy, 533 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 221 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 61 LocationsWithAnnotation, 61 PreInvPairs, 131 NumberOfFragments, 1217 HoareAnnotationTreeSize, 61 FomulaSimplifications, 2192 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 61 FomulaSimplificationsInter, 42 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 18768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...