/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/pthread-wmm/rfi002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:06:45,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:06:45,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:06:45,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:06:45,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:06:45,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:06:45,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:06:45,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:06:45,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:06:45,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:06:45,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:06:45,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:06:45,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:06:45,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:06:45,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:06:45,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:06:45,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:06:45,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:06:45,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:06:45,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:06:45,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:06:45,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:06:45,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:06:45,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:06:45,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:06:45,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:06:45,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:06:45,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:06:45,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:06:45,695 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:06:45,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:06:45,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:06:45,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:06:45,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:06:45,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:06:45,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:06:45,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:06:45,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:06:45,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:06:45,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:06:45,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:06:45,703 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-12-18 14:06:45,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:06:45,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:06:45,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:06:45,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:06:45,742 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:06:45,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:06:45,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:06:45,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:06:45,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:06:45,743 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:06:45,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:06:45,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:06:45,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:06:45,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:06:45,744 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:06:45,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:06:45,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:06:45,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:06:45,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:06:45,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:06:45,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:06:45,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:45,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:06:45,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:06:46,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:06:46,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:06:46,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:06:46,091 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:06:46,092 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:06:46,093 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-18 14:06:46,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19b2824c/381123cd38d04625a431be9b9d74316d/FLAG7dd9305d8 [2019-12-18 14:06:46,740 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:06:46,741 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.opt.i [2019-12-18 14:06:46,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19b2824c/381123cd38d04625a431be9b9d74316d/FLAG7dd9305d8 [2019-12-18 14:06:47,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19b2824c/381123cd38d04625a431be9b9d74316d [2019-12-18 14:06:47,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:06:47,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:06:47,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:47,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:06:47,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:06:47,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da7fd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47, skipping insertion in model container [2019-12-18 14:06:47,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:06:47,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:06:47,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:47,701 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:06:47,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:47,851 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:06:47,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47 WrapperNode [2019-12-18 14:06:47,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:47,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:47,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:06:47,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:06:47,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:47,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:06:47,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:06:47,940 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:06:47,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:48,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:06:48,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:06:48,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:06:48,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:06:48,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (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-12-18 14:06:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:06:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:06:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:06:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:06:48,091 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:06:48,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:06:48,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:06:48,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:06:48,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:06:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:06:48,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:06:48,098 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:06:49,224 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:06:49,225 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:06:49,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:49 BoogieIcfgContainer [2019-12-18 14:06:49,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:06:49,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:06:49,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:06:49,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:06:49,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:06:47" (1/3) ... [2019-12-18 14:06:49,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b682226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:49, skipping insertion in model container [2019-12-18 14:06:49,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (2/3) ... [2019-12-18 14:06:49,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b682226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:49, skipping insertion in model container [2019-12-18 14:06:49,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:49" (3/3) ... [2019-12-18 14:06:49,240 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.opt.i [2019-12-18 14:06:49,252 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:06:49,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:06:49,264 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:06:49,265 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:06:49,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,428 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,429 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,430 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,430 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,431 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,432 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,433 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,434 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,435 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,442 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,445 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,462 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:06:49,484 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:06:49,484 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:06:49,484 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:06:49,484 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:06:49,484 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:06:49,484 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:06:49,484 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:06:49,485 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:06:49,507 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 14:06:49,510 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:49,691 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:49,691 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:49,753 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:49,861 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:49,986 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:49,987 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:50,009 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:50,058 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 14:06:50,059 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:06:57,821 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:06:57,929 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:06:58,032 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 14:06:58,032 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 14:06:58,035 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 14:07:11,570 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 14:07:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 14:07:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:07:11,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:11,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:07:11,581 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 14:07:11,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:11,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67765292] [2019-12-18 14:07:11,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:11,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67765292] [2019-12-18 14:07:11,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:11,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:07:11,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137866157] [2019-12-18 14:07:11,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:07:11,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:11,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:07:11,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:07:11,946 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 14:07:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:14,589 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 14:07:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:07:14,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:07:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:15,299 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 14:07:15,299 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 14:07:15,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-18 14:07:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 14:07:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 14:07:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 14:07:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 14:07:27,985 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 14:07:27,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:27,985 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 14:07:27,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:07:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 14:07:27,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:27,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:27,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:27,988 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:27,989 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 14:07:27,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:27,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781473569] [2019-12-18 14:07:27,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:28,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781473569] [2019-12-18 14:07:28,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:28,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:07:28,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018014738] [2019-12-18 14:07:28,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:28,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:28,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:28,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:28,074 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 14:07:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:32,839 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 14:07:32,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:32,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:32,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:33,413 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 14:07:33,413 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 14:07:33,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 14:07:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 14:07:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 14:07:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 14:07:49,105 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 14:07:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:49,106 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 14:07:49,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 14:07:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:49,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:49,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:49,110 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:49,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 14:07:49,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:49,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043572512] [2019-12-18 14:07:49,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:49,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043572512] [2019-12-18 14:07:49,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:49,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:07:49,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737824266] [2019-12-18 14:07:49,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:49,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:49,197 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 14:07:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:49,287 INFO L93 Difference]: Finished difference Result 11993 states and 33125 transitions. [2019-12-18 14:07:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:07:49,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:49,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:49,303 INFO L225 Difference]: With dead ends: 11993 [2019-12-18 14:07:49,303 INFO L226 Difference]: Without dead ends: 8737 [2019-12-18 14:07:49,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-18 14:07:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-12-18 14:07:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8729. [2019-12-18 14:07:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8729 states. [2019-12-18 14:07:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 21886 transitions. [2019-12-18 14:07:49,490 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 21886 transitions. Word has length 11 [2019-12-18 14:07:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:49,490 INFO L462 AbstractCegarLoop]: Abstraction has 8729 states and 21886 transitions. [2019-12-18 14:07:49,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 21886 transitions. [2019-12-18 14:07:49,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:07:49,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:49,499 INFO L411 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-12-18 14:07:49,499 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:49,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 14:07:49,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:49,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116618250] [2019-12-18 14:07:49,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:49,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116618250] [2019-12-18 14:07:49,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:49,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:07:49,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34028950] [2019-12-18 14:07:49,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:07:49,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:49,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:07:49,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:49,642 INFO L87 Difference]: Start difference. First operand 8729 states and 21886 transitions. Second operand 5 states. [2019-12-18 14:07:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:50,261 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-18 14:07:50,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:07:50,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 14:07:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:50,275 INFO L225 Difference]: With dead ends: 10286 [2019-12-18 14:07:50,276 INFO L226 Difference]: Without dead ends: 10286 [2019-12-18 14:07:50,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:07:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-18 14:07:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-18 14:07:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-18 14:07:50,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-18 14:07:50,438 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-18 14:07:50,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:50,439 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-18 14:07:50,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:07:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-18 14:07:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 14:07:50,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:50,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:50,448 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:50,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 14:07:50,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:50,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537908267] [2019-12-18 14:07:50,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:50,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537908267] [2019-12-18 14:07:50,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:50,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:07:50,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768587917] [2019-12-18 14:07:50,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:07:50,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:50,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:07:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:07:50,580 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 6 states. [2019-12-18 14:07:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:51,562 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-18 14:07:51,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:07:51,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 14:07:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:51,578 INFO L225 Difference]: With dead ends: 11186 [2019-12-18 14:07:51,578 INFO L226 Difference]: Without dead ends: 11138 [2019-12-18 14:07:51,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:07:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-18 14:07:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-18 14:07:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-18 14:07:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-18 14:07:51,738 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-18 14:07:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:51,738 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-18 14:07:51,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:07:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-18 14:07:51,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:07:51,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:51,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:51,750 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 14:07:51,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:51,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216031261] [2019-12-18 14:07:51,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:51,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216031261] [2019-12-18 14:07:51,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:51,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:07:51,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136252453] [2019-12-18 14:07:51,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:07:51,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:51,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:07:51,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:07:51,955 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 8 states. [2019-12-18 14:07:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:54,793 INFO L93 Difference]: Finished difference Result 13021 states and 31545 transitions. [2019-12-18 14:07:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:07:54,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-12-18 14:07:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:54,810 INFO L225 Difference]: With dead ends: 13021 [2019-12-18 14:07:54,810 INFO L226 Difference]: Without dead ends: 13021 [2019-12-18 14:07:54,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:07:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2019-12-18 14:07:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11791. [2019-12-18 14:07:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-18 14:07:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-18 14:07:54,984 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-18 14:07:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:54,985 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-18 14:07:54,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:07:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-18 14:07:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:07:55,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:55,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:55,001 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:55,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:55,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-18 14:07:55,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:55,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498934327] [2019-12-18 14:07:55,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:55,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498934327] [2019-12-18 14:07:55,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:55,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:07:55,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405166570] [2019-12-18 14:07:55,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:07:55,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:55,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:07:55,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:55,096 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-18 14:07:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:56,040 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-18 14:07:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:07:56,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 14:07:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:56,056 INFO L225 Difference]: With dead ends: 13152 [2019-12-18 14:07:56,057 INFO L226 Difference]: Without dead ends: 13152 [2019-12-18 14:07:56,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:07:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-18 14:07:56,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-18 14:07:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-18 14:07:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-18 14:07:56,203 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-18 14:07:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:56,204 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-18 14:07:56,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:07:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-18 14:07:56,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 14:07:56,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:56,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:56,218 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:56,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:56,218 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-18 14:07:56,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:56,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55737034] [2019-12-18 14:07:56,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:56,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55737034] [2019-12-18 14:07:56,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:56,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:07:56,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211309733] [2019-12-18 14:07:56,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:07:56,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:56,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:07:56,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:56,321 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-18 14:07:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:56,371 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-18 14:07:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:56,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 14:07:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:56,378 INFO L225 Difference]: With dead ends: 5405 [2019-12-18 14:07:56,378 INFO L226 Difference]: Without dead ends: 5151 [2019-12-18 14:07:56,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:07:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-18 14:07:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-18 14:07:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-18 14:07:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-18 14:07:56,435 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 58 [2019-12-18 14:07:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:56,435 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-18 14:07:56,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:07:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-18 14:07:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:07:56,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:56,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:56,443 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:56,443 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 14:07:56,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:56,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409593593] [2019-12-18 14:07:56,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:56,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409593593] [2019-12-18 14:07:56,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:56,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:07:56,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640111323] [2019-12-18 14:07:56,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:07:56,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:56,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:07:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:07:56,593 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-18 14:07:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:57,433 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-18 14:07:57,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:07:57,434 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:07:57,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:57,442 INFO L225 Difference]: With dead ends: 6626 [2019-12-18 14:07:57,442 INFO L226 Difference]: Without dead ends: 6626 [2019-12-18 14:07:57,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:07:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-18 14:07:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-18 14:07:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-18 14:07:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-18 14:07:57,511 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-18 14:07:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:57,511 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-18 14:07:57,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:07:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-18 14:07:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:07:57,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:57,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:57,519 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-18 14:07:57,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:57,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334041535] [2019-12-18 14:07:57,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:57,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:57,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334041535] [2019-12-18 14:07:57,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:57,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:07:57,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950515015] [2019-12-18 14:07:57,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:07:57,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:07:57,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:07:57,665 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-18 14:07:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:58,749 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-18 14:07:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:07:58,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:07:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:58,762 INFO L225 Difference]: With dead ends: 7484 [2019-12-18 14:07:58,762 INFO L226 Difference]: Without dead ends: 7484 [2019-12-18 14:07:58,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:07:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-18 14:07:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-18 14:07:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-18 14:07:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-18 14:07:58,912 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-18 14:07:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:58,912 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-18 14:07:58,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:07:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-18 14:07:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:07:58,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:58,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:58,929 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:58,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:58,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-18 14:07:58,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:58,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208289742] [2019-12-18 14:07:58,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:59,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208289742] [2019-12-18 14:07:59,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:59,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:07:59,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910535324] [2019-12-18 14:07:59,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:07:59,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:59,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:07:59,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:59,082 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-18 14:08:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:00,221 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-18 14:08:00,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:00,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 14:08:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:00,231 INFO L225 Difference]: With dead ends: 7181 [2019-12-18 14:08:00,231 INFO L226 Difference]: Without dead ends: 7181 [2019-12-18 14:08:00,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-18 14:08:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-18 14:08:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-18 14:08:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-18 14:08:00,310 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-18 14:08:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:00,310 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-18 14:08:00,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-18 14:08:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:00,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:00,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:00,319 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:00,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-18 14:08:00,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:00,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493499131] [2019-12-18 14:08:00,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:00,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493499131] [2019-12-18 14:08:00,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:00,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:00,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732333019] [2019-12-18 14:08:00,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:00,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:00,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:00,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:00,469 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 6 states. [2019-12-18 14:08:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:01,145 INFO L93 Difference]: Finished difference Result 7132 states and 16535 transitions. [2019-12-18 14:08:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:01,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:01,154 INFO L225 Difference]: With dead ends: 7132 [2019-12-18 14:08:01,154 INFO L226 Difference]: Without dead ends: 7132 [2019-12-18 14:08:01,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2019-12-18 14:08:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 6891. [2019-12-18 14:08:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6891 states. [2019-12-18 14:08:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6891 states to 6891 states and 16087 transitions. [2019-12-18 14:08:01,229 INFO L78 Accepts]: Start accepts. Automaton has 6891 states and 16087 transitions. Word has length 94 [2019-12-18 14:08:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:01,229 INFO L462 AbstractCegarLoop]: Abstraction has 6891 states and 16087 transitions. [2019-12-18 14:08:01,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 6891 states and 16087 transitions. [2019-12-18 14:08:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:01,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:01,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:01,239 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:01,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-18 14:08:01,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:01,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460699519] [2019-12-18 14:08:01,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:01,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460699519] [2019-12-18 14:08:01,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:01,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:08:01,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808473025] [2019-12-18 14:08:01,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:08:01,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:01,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:08:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:01,334 INFO L87 Difference]: Start difference. First operand 6891 states and 16087 transitions. Second operand 3 states. [2019-12-18 14:08:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:01,384 INFO L93 Difference]: Finished difference Result 6891 states and 16086 transitions. [2019-12-18 14:08:01,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:08:01,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 14:08:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:01,394 INFO L225 Difference]: With dead ends: 6891 [2019-12-18 14:08:01,394 INFO L226 Difference]: Without dead ends: 6891 [2019-12-18 14:08:01,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:01,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6891 states. [2019-12-18 14:08:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6891 to 6683. [2019-12-18 14:08:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2019-12-18 14:08:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 15685 transitions. [2019-12-18 14:08:01,501 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 15685 transitions. Word has length 94 [2019-12-18 14:08:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:01,501 INFO L462 AbstractCegarLoop]: Abstraction has 6683 states and 15685 transitions. [2019-12-18 14:08:01,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:08:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 15685 transitions. [2019-12-18 14:08:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 14:08:01,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:01,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:01,511 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -524016775, now seen corresponding path program 1 times [2019-12-18 14:08:01,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:01,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521515426] [2019-12-18 14:08:01,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:01,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521515426] [2019-12-18 14:08:01,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:01,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:08:01,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745503854] [2019-12-18 14:08:01,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:08:01,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:01,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:08:01,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:01,726 INFO L87 Difference]: Start difference. First operand 6683 states and 15685 transitions. Second operand 9 states. [2019-12-18 14:08:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:02,561 INFO L93 Difference]: Finished difference Result 11522 states and 26946 transitions. [2019-12-18 14:08:02,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:08:02,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-18 14:08:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:02,573 INFO L225 Difference]: With dead ends: 11522 [2019-12-18 14:08:02,573 INFO L226 Difference]: Without dead ends: 9519 [2019-12-18 14:08:02,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:08:02,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9519 states. [2019-12-18 14:08:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9519 to 7990. [2019-12-18 14:08:02,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7990 states. [2019-12-18 14:08:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7990 states to 7990 states and 18918 transitions. [2019-12-18 14:08:02,669 INFO L78 Accepts]: Start accepts. Automaton has 7990 states and 18918 transitions. Word has length 95 [2019-12-18 14:08:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:02,669 INFO L462 AbstractCegarLoop]: Abstraction has 7990 states and 18918 transitions. [2019-12-18 14:08:02,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:08:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7990 states and 18918 transitions. [2019-12-18 14:08:02,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 14:08:02,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:02,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:02,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:02,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:02,680 INFO L82 PathProgramCache]: Analyzing trace with hash 283458299, now seen corresponding path program 2 times [2019-12-18 14:08:02,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:02,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765015385] [2019-12-18 14:08:02,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:02,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765015385] [2019-12-18 14:08:02,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:02,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:08:02,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674615201] [2019-12-18 14:08:02,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:08:02,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:02,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:08:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:02,759 INFO L87 Difference]: Start difference. First operand 7990 states and 18918 transitions. Second operand 3 states. [2019-12-18 14:08:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:02,821 INFO L93 Difference]: Finished difference Result 5572 states and 13115 transitions. [2019-12-18 14:08:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:08:02,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-18 14:08:02,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:02,828 INFO L225 Difference]: With dead ends: 5572 [2019-12-18 14:08:02,829 INFO L226 Difference]: Without dead ends: 5572 [2019-12-18 14:08:02,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-12-18 14:08:02,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5560. [2019-12-18 14:08:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5560 states. [2019-12-18 14:08:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 13093 transitions. [2019-12-18 14:08:02,921 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 13093 transitions. Word has length 95 [2019-12-18 14:08:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:02,921 INFO L462 AbstractCegarLoop]: Abstraction has 5560 states and 13093 transitions. [2019-12-18 14:08:02,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:08:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 13093 transitions. [2019-12-18 14:08:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:02,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:02,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:02,932 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash -2024800108, now seen corresponding path program 1 times [2019-12-18 14:08:02,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:02,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589652195] [2019-12-18 14:08:02,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:03,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589652195] [2019-12-18 14:08:03,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:03,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:03,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045478250] [2019-12-18 14:08:03,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:03,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:03,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:03,076 INFO L87 Difference]: Start difference. First operand 5560 states and 13093 transitions. Second operand 6 states. [2019-12-18 14:08:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:03,666 INFO L93 Difference]: Finished difference Result 5949 states and 13857 transitions. [2019-12-18 14:08:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:03,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:08:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:03,675 INFO L225 Difference]: With dead ends: 5949 [2019-12-18 14:08:03,675 INFO L226 Difference]: Without dead ends: 5949 [2019-12-18 14:08:03,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2019-12-18 14:08:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 5566. [2019-12-18 14:08:03,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5566 states. [2019-12-18 14:08:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 13104 transitions. [2019-12-18 14:08:04,383 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 13104 transitions. Word has length 96 [2019-12-18 14:08:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:04,383 INFO L462 AbstractCegarLoop]: Abstraction has 5566 states and 13104 transitions. [2019-12-18 14:08:04,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 13104 transitions. [2019-12-18 14:08:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:04,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:04,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:04,389 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:04,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:04,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1261239740, now seen corresponding path program 2 times [2019-12-18 14:08:04,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:04,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659032646] [2019-12-18 14:08:04,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:04,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659032646] [2019-12-18 14:08:04,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:04,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:04,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096031871] [2019-12-18 14:08:04,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:04,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:04,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:04,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:04,604 INFO L87 Difference]: Start difference. First operand 5566 states and 13104 transitions. Second operand 10 states. [2019-12-18 14:08:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:05,860 INFO L93 Difference]: Finished difference Result 13459 states and 30809 transitions. [2019-12-18 14:08:05,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:08:05,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:05,879 INFO L225 Difference]: With dead ends: 13459 [2019-12-18 14:08:05,880 INFO L226 Difference]: Without dead ends: 11838 [2019-12-18 14:08:05,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:08:05,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2019-12-18 14:08:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 7232. [2019-12-18 14:08:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7232 states. [2019-12-18 14:08:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 17377 transitions. [2019-12-18 14:08:06,039 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 17377 transitions. Word has length 96 [2019-12-18 14:08:06,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:06,040 INFO L462 AbstractCegarLoop]: Abstraction has 7232 states and 17377 transitions. [2019-12-18 14:08:06,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:06,040 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 17377 transitions. [2019-12-18 14:08:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:06,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:06,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:06,050 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:06,050 INFO L82 PathProgramCache]: Analyzing trace with hash -382325470, now seen corresponding path program 3 times [2019-12-18 14:08:06,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:06,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425901844] [2019-12-18 14:08:06,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:06,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425901844] [2019-12-18 14:08:06,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:06,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:08:06,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894730976] [2019-12-18 14:08:06,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:08:06,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:08:06,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:08:06,313 INFO L87 Difference]: Start difference. First operand 7232 states and 17377 transitions. Second operand 15 states. [2019-12-18 14:08:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:07,742 INFO L93 Difference]: Finished difference Result 17045 states and 40402 transitions. [2019-12-18 14:08:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:08:07,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-18 14:08:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:07,760 INFO L225 Difference]: With dead ends: 17045 [2019-12-18 14:08:07,760 INFO L226 Difference]: Without dead ends: 15732 [2019-12-18 14:08:07,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:08:07,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15732 states. [2019-12-18 14:08:07,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15732 to 11645. [2019-12-18 14:08:07,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11645 states. [2019-12-18 14:08:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11645 states to 11645 states and 28640 transitions. [2019-12-18 14:08:07,911 INFO L78 Accepts]: Start accepts. Automaton has 11645 states and 28640 transitions. Word has length 96 [2019-12-18 14:08:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:07,911 INFO L462 AbstractCegarLoop]: Abstraction has 11645 states and 28640 transitions. [2019-12-18 14:08:07,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:08:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 11645 states and 28640 transitions. [2019-12-18 14:08:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:07,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:07,921 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:07,922 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:07,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash 633350286, now seen corresponding path program 4 times [2019-12-18 14:08:07,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:07,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030976085] [2019-12-18 14:08:07,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:08,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030976085] [2019-12-18 14:08:08,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:08,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:08:08,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282819306] [2019-12-18 14:08:08,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:08,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:08,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:08,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:08,090 INFO L87 Difference]: Start difference. First operand 11645 states and 28640 transitions. Second operand 10 states. [2019-12-18 14:08:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:09,861 INFO L93 Difference]: Finished difference Result 17354 states and 42441 transitions. [2019-12-18 14:08:09,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:08:09,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:09,883 INFO L225 Difference]: With dead ends: 17354 [2019-12-18 14:08:09,883 INFO L226 Difference]: Without dead ends: 17354 [2019-12-18 14:08:09,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:08:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17354 states. [2019-12-18 14:08:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17354 to 14853. [2019-12-18 14:08:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14853 states. [2019-12-18 14:08:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14853 states to 14853 states and 36724 transitions. [2019-12-18 14:08:10,701 INFO L78 Accepts]: Start accepts. Automaton has 14853 states and 36724 transitions. Word has length 96 [2019-12-18 14:08:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:10,701 INFO L462 AbstractCegarLoop]: Abstraction has 14853 states and 36724 transitions. [2019-12-18 14:08:10,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14853 states and 36724 transitions. [2019-12-18 14:08:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:10,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:10,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:10,720 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:10,721 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 5 times [2019-12-18 14:08:10,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:10,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361905552] [2019-12-18 14:08:10,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:10,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361905552] [2019-12-18 14:08:10,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:10,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:10,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403229815] [2019-12-18 14:08:10,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:10,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:10,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:10,904 INFO L87 Difference]: Start difference. First operand 14853 states and 36724 transitions. Second operand 10 states. [2019-12-18 14:08:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:11,817 INFO L93 Difference]: Finished difference Result 23407 states and 56954 transitions. [2019-12-18 14:08:11,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:08:11,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:11,843 INFO L225 Difference]: With dead ends: 23407 [2019-12-18 14:08:11,844 INFO L226 Difference]: Without dead ends: 22276 [2019-12-18 14:08:11,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:08:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22276 states. [2019-12-18 14:08:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22276 to 17314. [2019-12-18 14:08:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17314 states. [2019-12-18 14:08:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17314 states to 17314 states and 43364 transitions. [2019-12-18 14:08:12,080 INFO L78 Accepts]: Start accepts. Automaton has 17314 states and 43364 transitions. Word has length 96 [2019-12-18 14:08:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:12,080 INFO L462 AbstractCegarLoop]: Abstraction has 17314 states and 43364 transitions. [2019-12-18 14:08:12,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 17314 states and 43364 transitions. [2019-12-18 14:08:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:12,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:12,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:12,104 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:12,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 6 times [2019-12-18 14:08:12,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:12,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54212533] [2019-12-18 14:08:12,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:12,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54212533] [2019-12-18 14:08:12,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:12,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:08:12,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891384041] [2019-12-18 14:08:12,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:08:12,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:08:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:08:12,406 INFO L87 Difference]: Start difference. First operand 17314 states and 43364 transitions. Second operand 14 states. [2019-12-18 14:08:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:13,620 INFO L93 Difference]: Finished difference Result 22264 states and 54974 transitions. [2019-12-18 14:08:13,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:08:13,620 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 14:08:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:13,646 INFO L225 Difference]: With dead ends: 22264 [2019-12-18 14:08:13,647 INFO L226 Difference]: Without dead ends: 22234 [2019-12-18 14:08:13,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:08:13,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22234 states. [2019-12-18 14:08:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22234 to 19541. [2019-12-18 14:08:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19541 states. [2019-12-18 14:08:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 49010 transitions. [2019-12-18 14:08:13,905 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 49010 transitions. Word has length 96 [2019-12-18 14:08:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:13,905 INFO L462 AbstractCegarLoop]: Abstraction has 19541 states and 49010 transitions. [2019-12-18 14:08:13,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:08:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 49010 transitions. [2019-12-18 14:08:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:13,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:13,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:13,924 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1165421684, now seen corresponding path program 7 times [2019-12-18 14:08:13,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:13,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74684770] [2019-12-18 14:08:13,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:14,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74684770] [2019-12-18 14:08:14,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:14,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:08:14,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332856330] [2019-12-18 14:08:14,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:08:14,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:14,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:08:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:14,923 INFO L87 Difference]: Start difference. First operand 19541 states and 49010 transitions. Second operand 12 states. [2019-12-18 14:08:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:18,857 INFO L93 Difference]: Finished difference Result 45437 states and 113274 transitions. [2019-12-18 14:08:18,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 14:08:18,858 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 14:08:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:18,912 INFO L225 Difference]: With dead ends: 45437 [2019-12-18 14:08:18,912 INFO L226 Difference]: Without dead ends: 45344 [2019-12-18 14:08:18,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=298, Invalid=1262, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 14:08:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45344 states. [2019-12-18 14:08:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45344 to 28930. [2019-12-18 14:08:19,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28930 states. [2019-12-18 14:08:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28930 states to 28930 states and 73083 transitions. [2019-12-18 14:08:19,407 INFO L78 Accepts]: Start accepts. Automaton has 28930 states and 73083 transitions. Word has length 96 [2019-12-18 14:08:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:19,407 INFO L462 AbstractCegarLoop]: Abstraction has 28930 states and 73083 transitions. [2019-12-18 14:08:19,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:08:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28930 states and 73083 transitions. [2019-12-18 14:08:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:19,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:19,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:19,434 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:19,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:19,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1131723738, now seen corresponding path program 8 times [2019-12-18 14:08:19,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:19,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208528616] [2019-12-18 14:08:19,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:19,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208528616] [2019-12-18 14:08:19,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:19,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:19,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215129171] [2019-12-18 14:08:19,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:19,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:19,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:19,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:19,609 INFO L87 Difference]: Start difference. First operand 28930 states and 73083 transitions. Second operand 10 states. [2019-12-18 14:08:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:21,358 INFO L93 Difference]: Finished difference Result 42734 states and 105563 transitions. [2019-12-18 14:08:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:08:21,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:21,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:21,405 INFO L225 Difference]: With dead ends: 42734 [2019-12-18 14:08:21,406 INFO L226 Difference]: Without dead ends: 41973 [2019-12-18 14:08:21,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:08:21,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41973 states. [2019-12-18 14:08:21,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41973 to 29173. [2019-12-18 14:08:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29173 states. [2019-12-18 14:08:21,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29173 states to 29173 states and 73588 transitions. [2019-12-18 14:08:21,831 INFO L78 Accepts]: Start accepts. Automaton has 29173 states and 73588 transitions. Word has length 96 [2019-12-18 14:08:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:21,831 INFO L462 AbstractCegarLoop]: Abstraction has 29173 states and 73588 transitions. [2019-12-18 14:08:21,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:21,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29173 states and 73588 transitions. [2019-12-18 14:08:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:21,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:21,860 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:21,860 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:21,860 INFO L82 PathProgramCache]: Analyzing trace with hash 353580028, now seen corresponding path program 9 times [2019-12-18 14:08:21,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:21,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162976488] [2019-12-18 14:08:21,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:22,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162976488] [2019-12-18 14:08:22,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:22,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:08:22,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731921537] [2019-12-18 14:08:22,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:08:22,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:22,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:08:22,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:08:22,163 INFO L87 Difference]: Start difference. First operand 29173 states and 73588 transitions. Second operand 15 states. [2019-12-18 14:08:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:25,264 INFO L93 Difference]: Finished difference Result 45625 states and 113659 transitions. [2019-12-18 14:08:25,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 14:08:25,264 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-18 14:08:25,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:25,316 INFO L225 Difference]: With dead ends: 45625 [2019-12-18 14:08:25,317 INFO L226 Difference]: Without dead ends: 44163 [2019-12-18 14:08:25,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=756, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:08:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44163 states. [2019-12-18 14:08:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44163 to 35177. [2019-12-18 14:08:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35177 states. [2019-12-18 14:08:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35177 states to 35177 states and 89042 transitions. [2019-12-18 14:08:26,554 INFO L78 Accepts]: Start accepts. Automaton has 35177 states and 89042 transitions. Word has length 96 [2019-12-18 14:08:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:26,555 INFO L462 AbstractCegarLoop]: Abstraction has 35177 states and 89042 transitions. [2019-12-18 14:08:26,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:08:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 35177 states and 89042 transitions. [2019-12-18 14:08:26,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:26,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:26,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:26,586 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash -921977958, now seen corresponding path program 10 times [2019-12-18 14:08:26,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:26,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75927987] [2019-12-18 14:08:26,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:26,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:26,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75927987] [2019-12-18 14:08:26,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:26,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:26,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929989737] [2019-12-18 14:08:26,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:26,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:26,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:26,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:26,714 INFO L87 Difference]: Start difference. First operand 35177 states and 89042 transitions. Second operand 6 states. [2019-12-18 14:08:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:27,059 INFO L93 Difference]: Finished difference Result 35511 states and 89710 transitions. [2019-12-18 14:08:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:08:27,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:08:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:27,100 INFO L225 Difference]: With dead ends: 35511 [2019-12-18 14:08:27,101 INFO L226 Difference]: Without dead ends: 35511 [2019-12-18 14:08:27,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35511 states. [2019-12-18 14:08:27,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35511 to 34653. [2019-12-18 14:08:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34653 states. [2019-12-18 14:08:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34653 states to 34653 states and 87782 transitions. [2019-12-18 14:08:27,497 INFO L78 Accepts]: Start accepts. Automaton has 34653 states and 87782 transitions. Word has length 96 [2019-12-18 14:08:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:27,498 INFO L462 AbstractCegarLoop]: Abstraction has 34653 states and 87782 transitions. [2019-12-18 14:08:27,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 34653 states and 87782 transitions. [2019-12-18 14:08:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:27,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:27,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:27,531 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:27,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash 888465312, now seen corresponding path program 11 times [2019-12-18 14:08:27,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:27,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627872982] [2019-12-18 14:08:27,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:27,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627872982] [2019-12-18 14:08:27,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:27,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:27,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111754867] [2019-12-18 14:08:27,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:27,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:27,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:27,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:27,687 INFO L87 Difference]: Start difference. First operand 34653 states and 87782 transitions. Second operand 7 states. [2019-12-18 14:08:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:27,987 INFO L93 Difference]: Finished difference Result 38391 states and 96198 transitions. [2019-12-18 14:08:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:08:27,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 14:08:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:28,029 INFO L225 Difference]: With dead ends: 38391 [2019-12-18 14:08:28,029 INFO L226 Difference]: Without dead ends: 36832 [2019-12-18 14:08:28,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36832 states. [2019-12-18 14:08:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36832 to 35351. [2019-12-18 14:08:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35351 states. [2019-12-18 14:08:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35351 states to 35351 states and 89425 transitions. [2019-12-18 14:08:29,192 INFO L78 Accepts]: Start accepts. Automaton has 35351 states and 89425 transitions. Word has length 96 [2019-12-18 14:08:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:29,192 INFO L462 AbstractCegarLoop]: Abstraction has 35351 states and 89425 transitions. [2019-12-18 14:08:29,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 35351 states and 89425 transitions. [2019-12-18 14:08:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:29,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:29,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:29,224 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:29,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:29,225 INFO L82 PathProgramCache]: Analyzing trace with hash 124775068, now seen corresponding path program 12 times [2019-12-18 14:08:29,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:29,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494771628] [2019-12-18 14:08:29,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:29,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494771628] [2019-12-18 14:08:29,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:29,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:08:29,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657061771] [2019-12-18 14:08:29,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:08:29,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:08:29,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:08:29,485 INFO L87 Difference]: Start difference. First operand 35351 states and 89425 transitions. Second operand 13 states. [2019-12-18 14:08:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:31,470 INFO L93 Difference]: Finished difference Result 58589 states and 146780 transitions. [2019-12-18 14:08:31,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:08:31,471 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 14:08:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:31,540 INFO L225 Difference]: With dead ends: 58589 [2019-12-18 14:08:31,540 INFO L226 Difference]: Without dead ends: 57642 [2019-12-18 14:08:31,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:08:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57642 states. [2019-12-18 14:08:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57642 to 45983. [2019-12-18 14:08:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45983 states. [2019-12-18 14:08:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45983 states to 45983 states and 117781 transitions. [2019-12-18 14:08:32,195 INFO L78 Accepts]: Start accepts. Automaton has 45983 states and 117781 transitions. Word has length 96 [2019-12-18 14:08:32,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:32,196 INFO L462 AbstractCegarLoop]: Abstraction has 45983 states and 117781 transitions. [2019-12-18 14:08:32,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:08:32,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45983 states and 117781 transitions. [2019-12-18 14:08:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:33,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:33,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:33,070 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:33,071 INFO L82 PathProgramCache]: Analyzing trace with hash 138397884, now seen corresponding path program 13 times [2019-12-18 14:08:33,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:33,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332285869] [2019-12-18 14:08:33,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:33,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332285869] [2019-12-18 14:08:33,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:33,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:33,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87106680] [2019-12-18 14:08:33,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:33,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:33,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:33,252 INFO L87 Difference]: Start difference. First operand 45983 states and 117781 transitions. Second operand 10 states. [2019-12-18 14:08:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:34,487 INFO L93 Difference]: Finished difference Result 58337 states and 145602 transitions. [2019-12-18 14:08:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:08:34,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:34,558 INFO L225 Difference]: With dead ends: 58337 [2019-12-18 14:08:34,558 INFO L226 Difference]: Without dead ends: 57702 [2019-12-18 14:08:34,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:08:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57702 states. [2019-12-18 14:08:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57702 to 41492. [2019-12-18 14:08:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41492 states. [2019-12-18 14:08:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41492 states to 41492 states and 105080 transitions. [2019-12-18 14:08:35,166 INFO L78 Accepts]: Start accepts. Automaton has 41492 states and 105080 transitions. Word has length 96 [2019-12-18 14:08:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:35,167 INFO L462 AbstractCegarLoop]: Abstraction has 41492 states and 105080 transitions. [2019-12-18 14:08:35,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 41492 states and 105080 transitions. [2019-12-18 14:08:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:35,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:35,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:35,208 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:35,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:35,208 INFO L82 PathProgramCache]: Analyzing trace with hash -420289070, now seen corresponding path program 14 times [2019-12-18 14:08:35,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:35,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220972455] [2019-12-18 14:08:35,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:35,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220972455] [2019-12-18 14:08:35,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:35,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:08:35,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264382132] [2019-12-18 14:08:35,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:08:35,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:35,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:08:35,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:35,394 INFO L87 Difference]: Start difference. First operand 41492 states and 105080 transitions. Second operand 12 states. [2019-12-18 14:08:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:37,944 INFO L93 Difference]: Finished difference Result 64322 states and 161764 transitions. [2019-12-18 14:08:37,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:08:37,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 14:08:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:38,032 INFO L225 Difference]: With dead ends: 64322 [2019-12-18 14:08:38,033 INFO L226 Difference]: Without dead ends: 63534 [2019-12-18 14:08:38,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:08:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63534 states. [2019-12-18 14:08:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63534 to 45471. [2019-12-18 14:08:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45471 states. [2019-12-18 14:08:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45471 states to 45471 states and 116109 transitions. [2019-12-18 14:08:38,768 INFO L78 Accepts]: Start accepts. Automaton has 45471 states and 116109 transitions. Word has length 96 [2019-12-18 14:08:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:38,768 INFO L462 AbstractCegarLoop]: Abstraction has 45471 states and 116109 transitions. [2019-12-18 14:08:38,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:08:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 45471 states and 116109 transitions. [2019-12-18 14:08:38,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:38,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:38,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:38,813 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:38,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:38,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1771219286, now seen corresponding path program 15 times [2019-12-18 14:08:38,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:38,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970011628] [2019-12-18 14:08:38,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:39,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970011628] [2019-12-18 14:08:39,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:39,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:08:39,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52410073] [2019-12-18 14:08:39,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:08:39,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:39,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:08:39,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:08:39,109 INFO L87 Difference]: Start difference. First operand 45471 states and 116109 transitions. Second operand 18 states. [2019-12-18 14:08:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:44,768 INFO L93 Difference]: Finished difference Result 70539 states and 179605 transitions. [2019-12-18 14:08:44,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:08:44,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-18 14:08:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:44,861 INFO L225 Difference]: With dead ends: 70539 [2019-12-18 14:08:44,861 INFO L226 Difference]: Without dead ends: 70018 [2019-12-18 14:08:44,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=2408, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 14:08:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70018 states. [2019-12-18 14:08:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70018 to 52068. [2019-12-18 14:08:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52068 states. [2019-12-18 14:08:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52068 states to 52068 states and 133711 transitions. [2019-12-18 14:08:46,292 INFO L78 Accepts]: Start accepts. Automaton has 52068 states and 133711 transitions. Word has length 96 [2019-12-18 14:08:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:46,292 INFO L462 AbstractCegarLoop]: Abstraction has 52068 states and 133711 transitions. [2019-12-18 14:08:46,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:08:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 52068 states and 133711 transitions. [2019-12-18 14:08:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:46,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:46,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:46,344 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1834207958, now seen corresponding path program 16 times [2019-12-18 14:08:46,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:46,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726681427] [2019-12-18 14:08:46,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:46,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726681427] [2019-12-18 14:08:46,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:46,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:08:46,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942441332] [2019-12-18 14:08:46,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:08:46,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:08:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:08:46,616 INFO L87 Difference]: Start difference. First operand 52068 states and 133711 transitions. Second operand 14 states. [2019-12-18 14:08:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:48,907 INFO L93 Difference]: Finished difference Result 66078 states and 166969 transitions. [2019-12-18 14:08:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:08:48,908 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 14:08:48,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:48,991 INFO L225 Difference]: With dead ends: 66078 [2019-12-18 14:08:48,991 INFO L226 Difference]: Without dead ends: 64790 [2019-12-18 14:08:48,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:08:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64790 states. [2019-12-18 14:08:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64790 to 52462. [2019-12-18 14:08:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52462 states. [2019-12-18 14:08:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52462 states to 52462 states and 134630 transitions. [2019-12-18 14:08:50,514 INFO L78 Accepts]: Start accepts. Automaton has 52462 states and 134630 transitions. Word has length 96 [2019-12-18 14:08:50,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:50,515 INFO L462 AbstractCegarLoop]: Abstraction has 52462 states and 134630 transitions. [2019-12-18 14:08:50,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:08:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 52462 states and 134630 transitions. [2019-12-18 14:08:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:50,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:50,570 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:50,570 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:50,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1405281420, now seen corresponding path program 17 times [2019-12-18 14:08:50,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:50,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666570104] [2019-12-18 14:08:50,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:50,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666570104] [2019-12-18 14:08:50,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:50,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:08:50,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294614358] [2019-12-18 14:08:50,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:08:50,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:08:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:50,709 INFO L87 Difference]: Start difference. First operand 52462 states and 134630 transitions. Second operand 9 states. [2019-12-18 14:08:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:51,175 INFO L93 Difference]: Finished difference Result 56979 states and 144834 transitions. [2019-12-18 14:08:51,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:08:51,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 14:08:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:51,251 INFO L225 Difference]: With dead ends: 56979 [2019-12-18 14:08:51,251 INFO L226 Difference]: Without dead ends: 55057 [2019-12-18 14:08:51,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:08:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55057 states. [2019-12-18 14:08:51,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55057 to 51492. [2019-12-18 14:08:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51492 states. [2019-12-18 14:08:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51492 states to 51492 states and 132370 transitions. [2019-12-18 14:08:52,872 INFO L78 Accepts]: Start accepts. Automaton has 51492 states and 132370 transitions. Word has length 96 [2019-12-18 14:08:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:52,872 INFO L462 AbstractCegarLoop]: Abstraction has 51492 states and 132370 transitions. [2019-12-18 14:08:52,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:08:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 51492 states and 132370 transitions. [2019-12-18 14:08:52,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:52,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:52,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:52,922 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:52,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:52,922 INFO L82 PathProgramCache]: Analyzing trace with hash -609210902, now seen corresponding path program 18 times [2019-12-18 14:08:52,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:52,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237457547] [2019-12-18 14:08:52,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:53,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237457547] [2019-12-18 14:08:53,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:53,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:08:53,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412090683] [2019-12-18 14:08:53,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:08:53,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:53,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:08:53,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:08:53,293 INFO L87 Difference]: Start difference. First operand 51492 states and 132370 transitions. Second operand 16 states. [2019-12-18 14:08:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:55,916 INFO L93 Difference]: Finished difference Result 65953 states and 166770 transitions. [2019-12-18 14:08:55,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:08:55,916 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 14:08:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:55,999 INFO L225 Difference]: With dead ends: 65953 [2019-12-18 14:08:55,999 INFO L226 Difference]: Without dead ends: 64959 [2019-12-18 14:08:55,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:08:56,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64959 states. [2019-12-18 14:08:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64959 to 51454. [2019-12-18 14:08:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51454 states. [2019-12-18 14:08:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51454 states to 51454 states and 132285 transitions. [2019-12-18 14:08:59,222 INFO L78 Accepts]: Start accepts. Automaton has 51454 states and 132285 transitions. Word has length 96 [2019-12-18 14:08:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:59,223 INFO L462 AbstractCegarLoop]: Abstraction has 51454 states and 132285 transitions. [2019-12-18 14:08:59,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:08:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 51454 states and 132285 transitions. [2019-12-18 14:08:59,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:59,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:59,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:59,271 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:59,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:59,271 INFO L82 PathProgramCache]: Analyzing trace with hash 367558882, now seen corresponding path program 19 times [2019-12-18 14:08:59,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:59,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512444697] [2019-12-18 14:08:59,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:59,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512444697] [2019-12-18 14:08:59,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:59,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:59,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759262813] [2019-12-18 14:08:59,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:59,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:59,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:59,424 INFO L87 Difference]: Start difference. First operand 51454 states and 132285 transitions. Second operand 10 states. [2019-12-18 14:08:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:59,963 INFO L93 Difference]: Finished difference Result 55224 states and 140963 transitions. [2019-12-18 14:08:59,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:08:59,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:59,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:00,031 INFO L225 Difference]: With dead ends: 55224 [2019-12-18 14:09:00,031 INFO L226 Difference]: Without dead ends: 54162 [2019-12-18 14:09:00,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:09:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54162 states. [2019-12-18 14:09:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54162 to 50949. [2019-12-18 14:09:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50949 states. [2019-12-18 14:09:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50949 states to 50949 states and 131054 transitions. [2019-12-18 14:09:00,670 INFO L78 Accepts]: Start accepts. Automaton has 50949 states and 131054 transitions. Word has length 96 [2019-12-18 14:09:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:00,670 INFO L462 AbstractCegarLoop]: Abstraction has 50949 states and 131054 transitions. [2019-12-18 14:09:00,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 50949 states and 131054 transitions. [2019-12-18 14:09:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:00,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:00,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:00,720 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash 627550158, now seen corresponding path program 20 times [2019-12-18 14:09:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:00,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367546400] [2019-12-18 14:09:00,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:00,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367546400] [2019-12-18 14:09:00,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:00,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:00,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587522617] [2019-12-18 14:09:00,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:09:00,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:00,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:09:00,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:00,831 INFO L87 Difference]: Start difference. First operand 50949 states and 131054 transitions. Second operand 8 states. [2019-12-18 14:09:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:01,204 INFO L93 Difference]: Finished difference Result 55179 states and 140815 transitions. [2019-12-18 14:09:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:09:01,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-18 14:09:01,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:01,272 INFO L225 Difference]: With dead ends: 55179 [2019-12-18 14:09:01,272 INFO L226 Difference]: Without dead ends: 53678 [2019-12-18 14:09:01,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:09:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53678 states. [2019-12-18 14:09:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53678 to 51547. [2019-12-18 14:09:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51547 states. [2019-12-18 14:09:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51547 states to 51547 states and 132510 transitions. [2019-12-18 14:09:02,280 INFO L78 Accepts]: Start accepts. Automaton has 51547 states and 132510 transitions. Word has length 96 [2019-12-18 14:09:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:02,280 INFO L462 AbstractCegarLoop]: Abstraction has 51547 states and 132510 transitions. [2019-12-18 14:09:02,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:09:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 51547 states and 132510 transitions. [2019-12-18 14:09:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:02,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:02,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:02,333 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash 52926762, now seen corresponding path program 21 times [2019-12-18 14:09:02,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:02,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309399435] [2019-12-18 14:09:02,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:02,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309399435] [2019-12-18 14:09:02,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:02,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:02,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514320605] [2019-12-18 14:09:02,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:02,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:02,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:02,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:02,444 INFO L87 Difference]: Start difference. First operand 51547 states and 132510 transitions. Second operand 10 states. [2019-12-18 14:09:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:03,214 INFO L93 Difference]: Finished difference Result 76089 states and 195306 transitions. [2019-12-18 14:09:03,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:09:03,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:03,357 INFO L225 Difference]: With dead ends: 76089 [2019-12-18 14:09:03,357 INFO L226 Difference]: Without dead ends: 73954 [2019-12-18 14:09:03,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:09:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73954 states. [2019-12-18 14:09:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73954 to 54141. [2019-12-18 14:09:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54141 states. [2019-12-18 14:09:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54141 states to 54141 states and 140237 transitions. [2019-12-18 14:09:04,601 INFO L78 Accepts]: Start accepts. Automaton has 54141 states and 140237 transitions. Word has length 96 [2019-12-18 14:09:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:04,601 INFO L462 AbstractCegarLoop]: Abstraction has 54141 states and 140237 transitions. [2019-12-18 14:09:04,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54141 states and 140237 transitions. [2019-12-18 14:09:04,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:04,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:04,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:04,657 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:04,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:04,658 INFO L82 PathProgramCache]: Analyzing trace with hash -295095088, now seen corresponding path program 22 times [2019-12-18 14:09:04,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:04,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309638007] [2019-12-18 14:09:04,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:04,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309638007] [2019-12-18 14:09:04,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:04,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:09:04,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081177138] [2019-12-18 14:09:04,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:09:04,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:04,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:09:04,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:09:04,809 INFO L87 Difference]: Start difference. First operand 54141 states and 140237 transitions. Second operand 12 states. [2019-12-18 14:09:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:06,953 INFO L93 Difference]: Finished difference Result 69342 states and 177280 transitions. [2019-12-18 14:09:06,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:09:06,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 14:09:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:07,042 INFO L225 Difference]: With dead ends: 69342 [2019-12-18 14:09:07,042 INFO L226 Difference]: Without dead ends: 68783 [2019-12-18 14:09:07,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:09:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68783 states. [2019-12-18 14:09:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68783 to 52699. [2019-12-18 14:09:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52699 states. [2019-12-18 14:09:08,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52699 states to 52699 states and 136229 transitions. [2019-12-18 14:09:08,328 INFO L78 Accepts]: Start accepts. Automaton has 52699 states and 136229 transitions. Word has length 96 [2019-12-18 14:09:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:08,328 INFO L462 AbstractCegarLoop]: Abstraction has 52699 states and 136229 transitions. [2019-12-18 14:09:08,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:09:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 52699 states and 136229 transitions. [2019-12-18 14:09:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:08,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:08,404 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:08,405 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -484016920, now seen corresponding path program 23 times [2019-12-18 14:09:08,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:08,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468905621] [2019-12-18 14:09:08,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:08,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468905621] [2019-12-18 14:09:08,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:08,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:09:08,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137912235] [2019-12-18 14:09:08,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:09:08,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:09:08,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:08,735 INFO L87 Difference]: Start difference. First operand 52699 states and 136229 transitions. Second operand 16 states. [2019-12-18 14:09:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:11,510 INFO L93 Difference]: Finished difference Result 78576 states and 199456 transitions. [2019-12-18 14:09:11,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 14:09:11,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 14:09:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:11,602 INFO L225 Difference]: With dead ends: 78576 [2019-12-18 14:09:11,602 INFO L226 Difference]: Without dead ends: 67197 [2019-12-18 14:09:11,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 14:09:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67197 states. [2019-12-18 14:09:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67197 to 61379. [2019-12-18 14:09:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61379 states. [2019-12-18 14:09:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61379 states to 61379 states and 158905 transitions. [2019-12-18 14:09:12,961 INFO L78 Accepts]: Start accepts. Automaton has 61379 states and 158905 transitions. Word has length 96 [2019-12-18 14:09:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:12,962 INFO L462 AbstractCegarLoop]: Abstraction has 61379 states and 158905 transitions. [2019-12-18 14:09:12,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:09:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 61379 states and 158905 transitions. [2019-12-18 14:09:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:13,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:13,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:13,029 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:13,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:13,029 INFO L82 PathProgramCache]: Analyzing trace with hash 541926030, now seen corresponding path program 24 times [2019-12-18 14:09:13,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:13,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894327969] [2019-12-18 14:09:13,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:13,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894327969] [2019-12-18 14:09:13,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:13,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:13,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107526167] [2019-12-18 14:09:13,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:09:13,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:13,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:09:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:13,217 INFO L87 Difference]: Start difference. First operand 61379 states and 158905 transitions. Second operand 11 states. [2019-12-18 14:09:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:14,360 INFO L93 Difference]: Finished difference Result 87683 states and 227292 transitions. [2019-12-18 14:09:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:09:14,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:09:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:14,475 INFO L225 Difference]: With dead ends: 87683 [2019-12-18 14:09:14,475 INFO L226 Difference]: Without dead ends: 83513 [2019-12-18 14:09:14,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:09:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83513 states. [2019-12-18 14:09:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83513 to 63750. [2019-12-18 14:09:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63750 states. [2019-12-18 14:09:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63750 states to 63750 states and 166037 transitions. [2019-12-18 14:09:15,363 INFO L78 Accepts]: Start accepts. Automaton has 63750 states and 166037 transitions. Word has length 96 [2019-12-18 14:09:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:15,364 INFO L462 AbstractCegarLoop]: Abstraction has 63750 states and 166037 transitions. [2019-12-18 14:09:15,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:09:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 63750 states and 166037 transitions. [2019-12-18 14:09:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:15,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:15,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:15,432 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:15,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:15,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1008360128, now seen corresponding path program 25 times [2019-12-18 14:09:15,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:15,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011993544] [2019-12-18 14:09:15,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:16,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011993544] [2019-12-18 14:09:16,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:16,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:09:16,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062640301] [2019-12-18 14:09:16,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:09:16,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:16,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:09:16,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:09:16,374 INFO L87 Difference]: Start difference. First operand 63750 states and 166037 transitions. Second operand 19 states. [2019-12-18 14:09:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:19,463 INFO L93 Difference]: Finished difference Result 78412 states and 204335 transitions. [2019-12-18 14:09:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:09:19,463 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-18 14:09:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:19,564 INFO L225 Difference]: With dead ends: 78412 [2019-12-18 14:09:19,565 INFO L226 Difference]: Without dead ends: 78021 [2019-12-18 14:09:19,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:09:19,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78021 states. [2019-12-18 14:09:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78021 to 63280. [2019-12-18 14:09:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63280 states. [2019-12-18 14:09:21,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63280 states to 63280 states and 164829 transitions. [2019-12-18 14:09:21,008 INFO L78 Accepts]: Start accepts. Automaton has 63280 states and 164829 transitions. Word has length 96 [2019-12-18 14:09:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:21,008 INFO L462 AbstractCegarLoop]: Abstraction has 63280 states and 164829 transitions. [2019-12-18 14:09:21,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:09:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 63280 states and 164829 transitions. [2019-12-18 14:09:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:21,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:21,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:21,063 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:21,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash 293339468, now seen corresponding path program 26 times [2019-12-18 14:09:21,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:21,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825031734] [2019-12-18 14:09:21,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:21,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825031734] [2019-12-18 14:09:21,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:21,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:09:21,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294181938] [2019-12-18 14:09:21,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:09:21,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:09:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:09:21,543 INFO L87 Difference]: Start difference. First operand 63280 states and 164829 transitions. Second operand 20 states. [2019-12-18 14:09:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:24,882 INFO L93 Difference]: Finished difference Result 75468 states and 195528 transitions. [2019-12-18 14:09:24,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 14:09:24,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2019-12-18 14:09:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:24,989 INFO L225 Difference]: With dead ends: 75468 [2019-12-18 14:09:24,989 INFO L226 Difference]: Without dead ends: 75145 [2019-12-18 14:09:24,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:09:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75145 states. [2019-12-18 14:09:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75145 to 61825. [2019-12-18 14:09:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61825 states. [2019-12-18 14:09:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61825 states to 61825 states and 160732 transitions. [2019-12-18 14:09:25,904 INFO L78 Accepts]: Start accepts. Automaton has 61825 states and 160732 transitions. Word has length 96 [2019-12-18 14:09:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:25,904 INFO L462 AbstractCegarLoop]: Abstraction has 61825 states and 160732 transitions. [2019-12-18 14:09:25,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:09:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 61825 states and 160732 transitions. [2019-12-18 14:09:26,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:26,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:26,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:26,447 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash 821825314, now seen corresponding path program 27 times [2019-12-18 14:09:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:26,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026869193] [2019-12-18 14:09:26,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:26,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026869193] [2019-12-18 14:09:26,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:26,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:09:26,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153603624] [2019-12-18 14:09:26,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 14:09:26,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 14:09:26,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:09:26,851 INFO L87 Difference]: Start difference. First operand 61825 states and 160732 transitions. Second operand 18 states. [2019-12-18 14:09:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:30,154 INFO L93 Difference]: Finished difference Result 71574 states and 185447 transitions. [2019-12-18 14:09:30,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 14:09:30,154 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-18 14:09:30,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:30,267 INFO L225 Difference]: With dead ends: 71574 [2019-12-18 14:09:30,267 INFO L226 Difference]: Without dead ends: 71079 [2019-12-18 14:09:30,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:09:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71079 states. [2019-12-18 14:09:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71079 to 60362. [2019-12-18 14:09:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60362 states. [2019-12-18 14:09:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60362 states to 60362 states and 156643 transitions. [2019-12-18 14:09:31,206 INFO L78 Accepts]: Start accepts. Automaton has 60362 states and 156643 transitions. Word has length 96 [2019-12-18 14:09:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:31,206 INFO L462 AbstractCegarLoop]: Abstraction has 60362 states and 156643 transitions. [2019-12-18 14:09:31,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 14:09:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 60362 states and 156643 transitions. [2019-12-18 14:09:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:31,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:31,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:31,276 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:31,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:31,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1037680630, now seen corresponding path program 28 times [2019-12-18 14:09:31,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:31,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046504526] [2019-12-18 14:09:31,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:31,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046504526] [2019-12-18 14:09:31,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:31,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:09:31,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909581530] [2019-12-18 14:09:31,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:31,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:31,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:31,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:31,412 INFO L87 Difference]: Start difference. First operand 60362 states and 156643 transitions. Second operand 7 states. [2019-12-18 14:09:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:32,404 INFO L93 Difference]: Finished difference Result 55684 states and 142737 transitions. [2019-12-18 14:09:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:09:32,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 14:09:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:32,477 INFO L225 Difference]: With dead ends: 55684 [2019-12-18 14:09:32,477 INFO L226 Difference]: Without dead ends: 55684 [2019-12-18 14:09:32,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:32,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55684 states. [2019-12-18 14:09:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55684 to 48890. [2019-12-18 14:09:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48890 states. [2019-12-18 14:09:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48890 states to 48890 states and 125304 transitions. [2019-12-18 14:09:33,093 INFO L78 Accepts]: Start accepts. Automaton has 48890 states and 125304 transitions. Word has length 96 [2019-12-18 14:09:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:33,093 INFO L462 AbstractCegarLoop]: Abstraction has 48890 states and 125304 transitions. [2019-12-18 14:09:33,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 48890 states and 125304 transitions. [2019-12-18 14:09:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:33,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:33,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:33,143 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:33,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:33,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 14:09:33,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:33,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901330457] [2019-12-18 14:09:33,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:33,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901330457] [2019-12-18 14:09:33,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:33,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:09:33,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799368170] [2019-12-18 14:09:33,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:09:33,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:09:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:33,329 INFO L87 Difference]: Start difference. First operand 48890 states and 125304 transitions. Second operand 11 states. [2019-12-18 14:09:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:36,245 INFO L93 Difference]: Finished difference Result 92193 states and 233309 transitions. [2019-12-18 14:09:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:09:36,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 14:09:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:36,352 INFO L225 Difference]: With dead ends: 92193 [2019-12-18 14:09:36,352 INFO L226 Difference]: Without dead ends: 80446 [2019-12-18 14:09:36,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 14:09:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80446 states. [2019-12-18 14:09:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80446 to 64751. [2019-12-18 14:09:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64751 states. [2019-12-18 14:09:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64751 states to 64751 states and 168285 transitions. [2019-12-18 14:09:37,699 INFO L78 Accepts]: Start accepts. Automaton has 64751 states and 168285 transitions. Word has length 97 [2019-12-18 14:09:37,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:37,699 INFO L462 AbstractCegarLoop]: Abstraction has 64751 states and 168285 transitions. [2019-12-18 14:09:37,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:09:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 64751 states and 168285 transitions. [2019-12-18 14:09:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:37,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:37,771 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:37,771 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:37,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 14:09:37,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:37,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527285204] [2019-12-18 14:09:37,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:37,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527285204] [2019-12-18 14:09:37,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:37,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:09:37,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170389912] [2019-12-18 14:09:37,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:09:37,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:09:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:09:37,877 INFO L87 Difference]: Start difference. First operand 64751 states and 168285 transitions. Second operand 6 states. [2019-12-18 14:09:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:38,130 INFO L93 Difference]: Finished difference Result 64032 states and 166234 transitions. [2019-12-18 14:09:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:09:38,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 14:09:38,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:38,217 INFO L225 Difference]: With dead ends: 64032 [2019-12-18 14:09:38,218 INFO L226 Difference]: Without dead ends: 64032 [2019-12-18 14:09:38,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64032 states. [2019-12-18 14:09:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64032 to 56198. [2019-12-18 14:09:38,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56198 states. [2019-12-18 14:09:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56198 states to 56198 states and 146124 transitions. [2019-12-18 14:09:39,682 INFO L78 Accepts]: Start accepts. Automaton has 56198 states and 146124 transitions. Word has length 97 [2019-12-18 14:09:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:39,682 INFO L462 AbstractCegarLoop]: Abstraction has 56198 states and 146124 transitions. [2019-12-18 14:09:39,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:09:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 56198 states and 146124 transitions. [2019-12-18 14:09:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:39,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:39,748 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:39,748 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-18 14:09:39,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:39,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257271654] [2019-12-18 14:09:39,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:39,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257271654] [2019-12-18 14:09:39,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:39,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:39,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138441252] [2019-12-18 14:09:39,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:39,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:39,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:39,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:39,848 INFO L87 Difference]: Start difference. First operand 56198 states and 146124 transitions. Second operand 7 states. [2019-12-18 14:09:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:40,725 INFO L93 Difference]: Finished difference Result 72477 states and 187125 transitions. [2019-12-18 14:09:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:09:40,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 14:09:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:40,822 INFO L225 Difference]: With dead ends: 72477 [2019-12-18 14:09:40,822 INFO L226 Difference]: Without dead ends: 72470 [2019-12-18 14:09:40,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72470 states. [2019-12-18 14:09:41,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72470 to 63282. [2019-12-18 14:09:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63282 states. [2019-12-18 14:09:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63282 states to 63282 states and 163931 transitions. [2019-12-18 14:09:41,696 INFO L78 Accepts]: Start accepts. Automaton has 63282 states and 163931 transitions. Word has length 97 [2019-12-18 14:09:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:41,696 INFO L462 AbstractCegarLoop]: Abstraction has 63282 states and 163931 transitions. [2019-12-18 14:09:41,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 63282 states and 163931 transitions. [2019-12-18 14:09:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:41,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:41,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:41,764 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-18 14:09:41,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:41,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906817468] [2019-12-18 14:09:41,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:41,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906817468] [2019-12-18 14:09:41,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:41,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:09:41,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609129858] [2019-12-18 14:09:41,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:09:41,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:41,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:09:41,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:41,882 INFO L87 Difference]: Start difference. First operand 63282 states and 163931 transitions. Second operand 8 states. [2019-12-18 14:09:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:42,870 INFO L93 Difference]: Finished difference Result 69880 states and 179845 transitions. [2019-12-18 14:09:42,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:09:42,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 14:09:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:42,976 INFO L225 Difference]: With dead ends: 69880 [2019-12-18 14:09:42,976 INFO L226 Difference]: Without dead ends: 69873 [2019-12-18 14:09:42,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:09:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69873 states. [2019-12-18 14:09:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69873 to 62254. [2019-12-18 14:09:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62254 states. [2019-12-18 14:09:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62254 states to 62254 states and 161348 transitions. [2019-12-18 14:09:44,200 INFO L78 Accepts]: Start accepts. Automaton has 62254 states and 161348 transitions. Word has length 97 [2019-12-18 14:09:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:44,200 INFO L462 AbstractCegarLoop]: Abstraction has 62254 states and 161348 transitions. [2019-12-18 14:09:44,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:09:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 62254 states and 161348 transitions. [2019-12-18 14:09:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:44,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:44,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:44,267 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:44,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 3 times [2019-12-18 14:09:44,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:44,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696531180] [2019-12-18 14:09:44,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:44,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696531180] [2019-12-18 14:09:44,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:44,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:44,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141997969] [2019-12-18 14:09:44,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:44,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:44,395 INFO L87 Difference]: Start difference. First operand 62254 states and 161348 transitions. Second operand 7 states. [2019-12-18 14:09:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:45,325 INFO L93 Difference]: Finished difference Result 75270 states and 194319 transitions. [2019-12-18 14:09:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:09:45,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 14:09:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:45,427 INFO L225 Difference]: With dead ends: 75270 [2019-12-18 14:09:45,427 INFO L226 Difference]: Without dead ends: 75256 [2019-12-18 14:09:45,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:09:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75256 states. [2019-12-18 14:09:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75256 to 64643. [2019-12-18 14:09:46,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64643 states. [2019-12-18 14:09:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64643 states to 64643 states and 167454 transitions. [2019-12-18 14:09:46,847 INFO L78 Accepts]: Start accepts. Automaton has 64643 states and 167454 transitions. Word has length 97 [2019-12-18 14:09:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:46,847 INFO L462 AbstractCegarLoop]: Abstraction has 64643 states and 167454 transitions. [2019-12-18 14:09:46,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:46,848 INFO L276 IsEmpty]: Start isEmpty. Operand 64643 states and 167454 transitions. [2019-12-18 14:09:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:46,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:46,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:46,923 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:46,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:46,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 4 times [2019-12-18 14:09:46,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:46,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373306036] [2019-12-18 14:09:46,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:47,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373306036] [2019-12-18 14:09:47,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:47,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 14:09:47,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075681989] [2019-12-18 14:09:47,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 14:09:47,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 14:09:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:09:47,438 INFO L87 Difference]: Start difference. First operand 64643 states and 167454 transitions. Second operand 23 states. [2019-12-18 14:09:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:55,995 INFO L93 Difference]: Finished difference Result 122909 states and 316629 transitions. [2019-12-18 14:09:55,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-18 14:09:55,996 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 97 [2019-12-18 14:09:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:56,147 INFO L225 Difference]: With dead ends: 122909 [2019-12-18 14:09:56,147 INFO L226 Difference]: Without dead ends: 107599 [2019-12-18 14:09:56,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=644, Invalid=5208, Unknown=0, NotChecked=0, Total=5852 [2019-12-18 14:09:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107599 states. [2019-12-18 14:09:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107599 to 70937. [2019-12-18 14:09:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70937 states. [2019-12-18 14:09:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70937 states to 70937 states and 183868 transitions. [2019-12-18 14:09:57,255 INFO L78 Accepts]: Start accepts. Automaton has 70937 states and 183868 transitions. Word has length 97 [2019-12-18 14:09:57,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:57,256 INFO L462 AbstractCegarLoop]: Abstraction has 70937 states and 183868 transitions. [2019-12-18 14:09:57,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 14:09:57,256 INFO L276 IsEmpty]: Start isEmpty. Operand 70937 states and 183868 transitions. [2019-12-18 14:09:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:57,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:57,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:57,334 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2072554265, now seen corresponding path program 5 times [2019-12-18 14:09:57,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:57,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277459956] [2019-12-18 14:09:57,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:57,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277459956] [2019-12-18 14:09:57,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:57,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 14:09:57,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908655522] [2019-12-18 14:09:57,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:09:57,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:57,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:09:57,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:09:57,657 INFO L87 Difference]: Start difference. First operand 70937 states and 183868 transitions. Second operand 19 states. [2019-12-18 14:10:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:02,992 INFO L93 Difference]: Finished difference Result 95971 states and 245694 transitions. [2019-12-18 14:10:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 14:10:02,992 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 97 [2019-12-18 14:10:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:03,106 INFO L225 Difference]: With dead ends: 95971 [2019-12-18 14:10:03,106 INFO L226 Difference]: Without dead ends: 94718 [2019-12-18 14:10:03,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=2391, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 14:10:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94718 states. [2019-12-18 14:10:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94718 to 70989. [2019-12-18 14:10:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70989 states. [2019-12-18 14:10:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70989 states to 70989 states and 183953 transitions. [2019-12-18 14:10:04,094 INFO L78 Accepts]: Start accepts. Automaton has 70989 states and 183953 transitions. Word has length 97 [2019-12-18 14:10:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:04,094 INFO L462 AbstractCegarLoop]: Abstraction has 70989 states and 183953 transitions. [2019-12-18 14:10:04,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:10:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 70989 states and 183953 transitions. [2019-12-18 14:10:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:04,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:04,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:04,165 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:04,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 6 times [2019-12-18 14:10:04,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:04,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642914566] [2019-12-18 14:10:04,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:04,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642914566] [2019-12-18 14:10:04,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:04,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:10:04,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665502246] [2019-12-18 14:10:04,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:10:04,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:04,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:10:04,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:10:04,241 INFO L87 Difference]: Start difference. First operand 70989 states and 183953 transitions. Second operand 7 states. [2019-12-18 14:10:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:05,068 INFO L93 Difference]: Finished difference Result 72225 states and 186808 transitions. [2019-12-18 14:10:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:10:05,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 14:10:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:05,163 INFO L225 Difference]: With dead ends: 72225 [2019-12-18 14:10:05,163 INFO L226 Difference]: Without dead ends: 72225 [2019-12-18 14:10:05,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:10:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72225 states. [2019-12-18 14:10:06,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72225 to 70956. [2019-12-18 14:10:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70956 states. [2019-12-18 14:10:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70956 states to 70956 states and 183780 transitions. [2019-12-18 14:10:06,422 INFO L78 Accepts]: Start accepts. Automaton has 70956 states and 183780 transitions. Word has length 97 [2019-12-18 14:10:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:06,422 INFO L462 AbstractCegarLoop]: Abstraction has 70956 states and 183780 transitions. [2019-12-18 14:10:06,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:10:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 70956 states and 183780 transitions. [2019-12-18 14:10:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:06,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:06,495 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:06,495 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1192282811, now seen corresponding path program 7 times [2019-12-18 14:10:06,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:06,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499530927] [2019-12-18 14:10:06,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:06,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499530927] [2019-12-18 14:10:06,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:06,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:10:06,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749490550] [2019-12-18 14:10:06,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:10:06,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:10:06,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:10:06,654 INFO L87 Difference]: Start difference. First operand 70956 states and 183780 transitions. Second operand 9 states. [2019-12-18 14:10:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:07,472 INFO L93 Difference]: Finished difference Result 86067 states and 222168 transitions. [2019-12-18 14:10:07,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:10:07,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 14:10:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:07,584 INFO L225 Difference]: With dead ends: 86067 [2019-12-18 14:10:07,584 INFO L226 Difference]: Without dead ends: 86034 [2019-12-18 14:10:07,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:10:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86034 states. [2019-12-18 14:10:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86034 to 73119. [2019-12-18 14:10:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73119 states. [2019-12-18 14:10:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73119 states to 73119 states and 189477 transitions. [2019-12-18 14:10:09,167 INFO L78 Accepts]: Start accepts. Automaton has 73119 states and 189477 transitions. Word has length 97 [2019-12-18 14:10:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:09,167 INFO L462 AbstractCegarLoop]: Abstraction has 73119 states and 189477 transitions. [2019-12-18 14:10:09,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:10:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 73119 states and 189477 transitions. [2019-12-18 14:10:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:09,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:09,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:09,242 INFO L410 AbstractCegarLoop]: === Iteration 53 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:09,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:09,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 8 times [2019-12-18 14:10:09,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:09,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485429299] [2019-12-18 14:10:09,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:09,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485429299] [2019-12-18 14:10:09,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:09,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:10:09,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906809264] [2019-12-18 14:10:09,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:10:09,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:10:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:10:09,452 INFO L87 Difference]: Start difference. First operand 73119 states and 189477 transitions. Second operand 10 states. [2019-12-18 14:10:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:10,843 INFO L93 Difference]: Finished difference Result 93560 states and 241472 transitions. [2019-12-18 14:10:10,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:10:10,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 14:10:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:10,980 INFO L225 Difference]: With dead ends: 93560 [2019-12-18 14:10:10,980 INFO L226 Difference]: Without dead ends: 93553 [2019-12-18 14:10:10,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:10:11,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93553 states. [2019-12-18 14:10:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93553 to 73370. [2019-12-18 14:10:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73370 states. [2019-12-18 14:10:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73370 states to 73370 states and 190267 transitions. [2019-12-18 14:10:12,079 INFO L78 Accepts]: Start accepts. Automaton has 73370 states and 190267 transitions. Word has length 97 [2019-12-18 14:10:12,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:12,079 INFO L462 AbstractCegarLoop]: Abstraction has 73370 states and 190267 transitions. [2019-12-18 14:10:12,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:10:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 73370 states and 190267 transitions. [2019-12-18 14:10:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:12,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:12,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:12,164 INFO L410 AbstractCegarLoop]: === Iteration 54 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1419727447, now seen corresponding path program 9 times [2019-12-18 14:10:12,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:12,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275940537] [2019-12-18 14:10:12,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:12,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275940537] [2019-12-18 14:10:12,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:12,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:10:12,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758505312] [2019-12-18 14:10:12,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:10:12,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:10:12,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:10:12,388 INFO L87 Difference]: Start difference. First operand 73370 states and 190267 transitions. Second operand 11 states. [2019-12-18 14:10:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:14,948 INFO L93 Difference]: Finished difference Result 112201 states and 288065 transitions. [2019-12-18 14:10:14,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:10:14,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 14:10:14,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:15,124 INFO L225 Difference]: With dead ends: 112201 [2019-12-18 14:10:15,124 INFO L226 Difference]: Without dead ends: 112134 [2019-12-18 14:10:15,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:10:15,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112134 states. [2019-12-18 14:10:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112134 to 77155. [2019-12-18 14:10:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77155 states. [2019-12-18 14:10:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77155 states to 77155 states and 200750 transitions. [2019-12-18 14:10:16,503 INFO L78 Accepts]: Start accepts. Automaton has 77155 states and 200750 transitions. Word has length 97 [2019-12-18 14:10:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:16,503 INFO L462 AbstractCegarLoop]: Abstraction has 77155 states and 200750 transitions. [2019-12-18 14:10:16,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:10:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 77155 states and 200750 transitions. [2019-12-18 14:10:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:10:16,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:16,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:16,606 INFO L410 AbstractCegarLoop]: === Iteration 55 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash -920339781, now seen corresponding path program 10 times [2019-12-18 14:10:16,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:16,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591635550] [2019-12-18 14:10:16,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:16,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591635550] [2019-12-18 14:10:16,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:16,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:10:16,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512744900] [2019-12-18 14:10:16,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:10:16,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:16,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:10:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:10:16,801 INFO L87 Difference]: Start difference. First operand 77155 states and 200750 transitions. Second operand 10 states. Received shutdown request... [2019-12-18 14:10:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:10:18,331 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 14:10:18,335 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 14:10:18,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:10:18 BasicIcfg [2019-12-18 14:10:18,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:10:18,337 INFO L168 Benchmark]: Toolchain (without parser) took 211285.71 ms. Allocated memory was 137.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 99.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 880.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:18,337 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 14:10:18,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.56 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 98.9 MB in the beginning and 153.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:18,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.26 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 150.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:18,338 INFO L168 Benchmark]: Boogie Preprocessor took 71.40 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 147.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:18,339 INFO L168 Benchmark]: RCFGBuilder took 1216.22 ms. Allocated memory was 202.9 MB in the beginning and 234.4 MB in the end (delta: 31.5 MB). Free memory was 147.2 MB in the beginning and 192.5 MB in the end (delta: -45.3 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:18,339 INFO L168 Benchmark]: TraceAbstraction took 209107.14 ms. Allocated memory was 234.4 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 191.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 876.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:18,341 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.56 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 98.9 MB in the beginning and 153.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.26 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 150.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.40 ms. Allocated memory is still 202.9 MB. Free memory was 150.6 MB in the beginning and 147.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1216.22 ms. Allocated memory was 202.9 MB in the beginning and 234.4 MB in the end (delta: 31.5 MB). Free memory was 147.2 MB in the beginning and 192.5 MB in the end (delta: -45.3 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209107.14 ms. Allocated memory was 234.4 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 191.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 876.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (77155states) and FLOYD_HOARE automaton (currently 15 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (73170 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (77155states) and FLOYD_HOARE automaton (currently 15 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (73170 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 208.8s, OverallIterations: 55, TraceHistogramMax: 1, AutomataDifference: 101.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 24733 SDtfs, 35014 SDslu, 134581 SDs, 0 SdLazy, 70915 SolverSat, 2076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 55.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1267 GetRequests, 188 SyntacticMatches, 90 SemanticMatches, 989 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6659 ImplicationChecksByTransitivity, 15.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152836occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 69.7s AutomataMinimizationTime, 54 MinimizatonAttempts, 451968 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 4767 NumberOfCodeBlocks, 4767 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 4712 ConstructedInterpolants, 0 QuantifiedInterpolants, 1878319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 55 InterpolantComputations, 55 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 could not prove your program: Timeout Completed graceful shutdown