/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:04:22,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:04:22,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:04:22,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:04:22,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:04:22,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:04:22,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:04:22,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:04:22,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:04:22,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:04:22,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:04:22,179 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:04:22,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:04:22,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:04:22,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:04:22,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:04:22,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:04:22,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:04:22,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:04:22,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:04:22,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:04:22,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:04:22,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:04:22,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:04:22,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:04:22,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:04:22,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:04:22,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:04:22,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:04:22,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:04:22,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:04:22,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:04:22,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:04:22,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:04:22,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:04:22,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:04:22,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:04:22,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:04:22,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:04:22,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:04:22,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:04:22,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 23:04:22,220 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:04:22,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:04:22,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:04:22,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:04:22,222 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:04:22,222 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:04:22,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:04:22,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:04:22,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:04:22,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:04:22,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:04:22,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:04:22,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:04:22,224 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:04:22,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:04:22,224 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:04:22,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:04:22,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:04:22,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:04:22,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:04:22,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:04:22,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:04:22,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:04:22,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:04:22,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:04:22,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:04:22,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:04:22,227 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:04:22,227 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:04:22,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:04:22,227 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:04:22,228 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:04:22,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:04:22,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:04:22,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:04:22,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:04:22,526 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:04:22,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-27 23:04:22,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f1e6efc/fa211c47dec244b6b583de560df98cf1/FLAGb8121b2dd [2019-12-27 23:04:23,131 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:04:23,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-27 23:04:23,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f1e6efc/fa211c47dec244b6b583de560df98cf1/FLAGb8121b2dd [2019-12-27 23:04:23,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12f1e6efc/fa211c47dec244b6b583de560df98cf1 [2019-12-27 23:04:23,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:04:23,434 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:04:23,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:04:23,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:04:23,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:04:23,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:04:23" (1/1) ... [2019-12-27 23:04:23,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c266cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:23, skipping insertion in model container [2019-12-27 23:04:23,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:04:23" (1/1) ... [2019-12-27 23:04:23,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:04:23,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:04:23,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:04:23,966 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:04:24,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:04:24,137 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:04:24,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24 WrapperNode [2019-12-27 23:04:24,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:04:24,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:04:24,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:04:24,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:04:24,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:04:24,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:04:24,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:04:24,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:04:24,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,228 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (1/1) ... [2019-12-27 23:04:24,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:04:24,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:04:24,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:04:24,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:04:24,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (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-27 23:04:24,322 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 23:04:24,322 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 23:04:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 23:04:24,324 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 23:04:24,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:04:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:04:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:04:24,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:04:24,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:04:24,327 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:04:24,684 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:04:24,684 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 23:04:24,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:04:24 BoogieIcfgContainer [2019-12-27 23:04:24,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:04:24,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:04:24,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:04:24,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:04:24,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:04:23" (1/3) ... [2019-12-27 23:04:24,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cc77bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:04:24, skipping insertion in model container [2019-12-27 23:04:24,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:24" (2/3) ... [2019-12-27 23:04:24,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30cc77bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:04:24, skipping insertion in model container [2019-12-27 23:04:24,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:04:24" (3/3) ... [2019-12-27 23:04:24,694 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2019-12-27 23:04:24,703 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:04:24,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:04:24,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:04:24,712 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:04:24,735 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,735 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,735 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,736 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,736 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,737 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,737 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,737 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,737 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,738 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,738 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,739 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,739 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,739 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,739 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,740 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,741 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,741 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,745 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,745 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,746 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,746 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,746 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,755 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,755 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,756 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,756 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:24,769 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 23:04:24,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:24,785 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:24,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:24,786 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:24,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:24,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:24,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:24,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:24,799 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-27 23:04:24,801 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 23:04:24,844 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 23:04:24,844 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:04:24,855 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 23:04:24,859 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 23:04:24,884 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 23:04:24,884 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:04:24,886 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 23:04:24,889 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-27 23:04:24,890 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:26,097 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 23:04:26,224 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-27 23:04:26,224 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-27 23:04:26,228 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 23:04:26,236 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 23:04:26,239 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 23:04:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:26,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:26,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:26,247 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-27 23:04:26,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:26,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069052813] [2019-12-27 23:04:26,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:26,455 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-27 23:04:26,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069052813] [2019-12-27 23:04:26,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:26,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:26,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1152978029] [2019-12-27 23:04:26,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:26,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:26,476 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:26,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:26,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:26,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:26,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:26,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:26,495 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 23:04:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:26,525 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 23:04:26,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:26,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:26,542 INFO L225 Difference]: With dead ends: 35 [2019-12-27 23:04:26,542 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 23:04:26,544 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-27 23:04:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 23:04:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 23:04:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 23:04:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 23:04:26,578 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 23:04:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:26,579 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 23:04:26,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 23:04:26,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 23:04:26,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:26,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:26,580 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:26,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-27 23:04:26,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:26,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470422255] [2019-12-27 23:04:26,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:26,730 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-27 23:04:26,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470422255] [2019-12-27 23:04:26,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:26,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:04:26,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559373821] [2019-12-27 23:04:26,732 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:26,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:26,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 23:04:26,739 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:26,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:26,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:04:26,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:26,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:04:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:04:26,744 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 23:04:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:26,763 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 23:04:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:04:26,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 23:04:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:26,765 INFO L225 Difference]: With dead ends: 26 [2019-12-27 23:04:26,766 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 23:04:26,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:04:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 23:04:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 23:04:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 23:04:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 23:04:26,771 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 23:04:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:26,772 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 23:04:26,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:04:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 23:04:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 23:04:26,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:26,773 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:26,773 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-27 23:04:26,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:26,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876324917] [2019-12-27 23:04:26,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:26,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:26,835 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:26,836 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:26,836 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 23:04:26,846 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,846 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,846 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,847 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,847 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,847 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,847 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,847 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,848 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,848 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,848 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,848 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,848 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,849 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,849 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,849 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,849 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,849 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,850 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,850 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,852 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,852 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,852 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,853 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,853 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,853 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,853 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,853 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,854 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,854 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,854 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,854 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,854 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,855 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,855 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,865 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,872 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,872 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,872 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,873 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,875 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,875 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,875 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,875 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,876 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,876 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:26,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:04:26,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:26,878 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:26,878 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:26,878 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:26,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:26,879 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:26,879 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:26,879 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:26,883 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 23:04:26,884 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 23:04:26,914 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 23:04:26,914 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 23:04:26,916 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 23:04:26,918 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 23:04:26,944 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 23:04:26,944 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 23:04:26,947 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 23:04:26,954 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-27 23:04:26,954 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:28,039 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 23:04:28,308 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-27 23:04:28,309 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-27 23:04:28,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 23:04:28,320 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 23:04:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 23:04:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:28,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:28,321 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:28,321 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:28,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-27 23:04:28,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:28,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831966850] [2019-12-27 23:04:28,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:28,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831966850] [2019-12-27 23:04:28,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:28,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:28,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749547963] [2019-12-27 23:04:28,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:28,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:28,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:28,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:28,363 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:28,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:28,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:28,364 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 23:04:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:28,387 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 23:04:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:28,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:28,392 INFO L225 Difference]: With dead ends: 185 [2019-12-27 23:04:28,392 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 23:04:28,392 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-27 23:04:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 23:04:28,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 23:04:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 23:04:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 23:04:28,417 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 23:04:28,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:28,418 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 23:04:28,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:28,418 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 23:04:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:28,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:28,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:28,419 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:28,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-27 23:04:28,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:28,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519791013] [2019-12-27 23:04:28,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:28,496 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-27 23:04:28,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519791013] [2019-12-27 23:04:28,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:28,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:28,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366056167] [2019-12-27 23:04:28,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:28,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:28,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:28,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:28,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:28,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:28,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:28,504 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 23:04:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:28,582 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 23:04:28,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:28,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:28,587 INFO L225 Difference]: With dead ends: 204 [2019-12-27 23:04:28,587 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 23:04:28,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 23:04:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 23:04:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 23:04:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 23:04:28,619 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 23:04:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:28,619 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 23:04:28,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 23:04:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:28,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:28,621 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:28,621 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-27 23:04:28,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:28,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477982451] [2019-12-27 23:04:28,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:28,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477982451] [2019-12-27 23:04:28,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:28,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:28,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [830263401] [2019-12-27 23:04:28,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:28,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:28,705 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:28,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:28,706 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:28,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:28,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:28,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:28,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:28,707 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 23:04:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:28,788 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 23:04:28,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:28,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:28,791 INFO L225 Difference]: With dead ends: 189 [2019-12-27 23:04:28,791 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 23:04:28,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 23:04:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 23:04:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 23:04:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 23:04:28,804 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 23:04:28,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:28,805 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 23:04:28,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 23:04:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:04:28,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:28,809 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:28,809 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-27 23:04:28,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:28,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725509972] [2019-12-27 23:04:28,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:28,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:28,843 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:28,844 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:28,844 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 23:04:28,854 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,854 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,862 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,864 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,871 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,872 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,872 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,872 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,873 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,874 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,874 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,874 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,876 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,876 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,876 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,876 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,876 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,878 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,878 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,878 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,879 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,880 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,880 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,880 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,881 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,881 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,881 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,883 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 23:04:28,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:28,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:28,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:28,884 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:28,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:28,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:28,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:28,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:28,886 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-27 23:04:28,887 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 23:04:28,905 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 23:04:28,906 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 23:04:28,908 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 23:04:28,912 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 23:04:28,935 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 23:04:28,935 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 23:04:28,937 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 23:04:28,941 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-27 23:04:28,941 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:30,391 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 23:04:30,457 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-27 23:04:30,457 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-27 23:04:30,458 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 23:04:30,483 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 23:04:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 23:04:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:30,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:30,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:30,484 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-27 23:04:30,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:30,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708264048] [2019-12-27 23:04:30,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:30,516 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-27 23:04:30,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708264048] [2019-12-27 23:04:30,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:30,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:30,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077281703] [2019-12-27 23:04:30,517 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:30,518 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:30,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:30,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:30,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:30,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:30,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:30,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:30,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:30,519 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 23:04:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:30,559 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 23:04:30,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:30,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:30,568 INFO L225 Difference]: With dead ends: 600 [2019-12-27 23:04:30,568 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 23:04:30,569 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-27 23:04:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 23:04:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 23:04:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 23:04:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 23:04:30,609 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 23:04:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:30,609 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 23:04:30,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 23:04:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:30,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:30,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:30,610 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-27 23:04:30,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:30,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219244892] [2019-12-27 23:04:30,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:30,678 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-27 23:04:30,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219244892] [2019-12-27 23:04:30,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:30,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:30,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014396376] [2019-12-27 23:04:30,679 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:30,679 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:30,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:30,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:30,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:30,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:30,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:30,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:30,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:30,682 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 23:04:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:30,763 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 23:04:30,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:30,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:30,770 INFO L225 Difference]: With dead ends: 802 [2019-12-27 23:04:30,770 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 23:04:30,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 23:04:30,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 23:04:30,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 23:04:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 23:04:30,799 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 23:04:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:30,800 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 23:04:30,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 23:04:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:30,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:30,806 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:30,806 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:30,806 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-27 23:04:30,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:30,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839200637] [2019-12-27 23:04:30,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:30,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839200637] [2019-12-27 23:04:30,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:30,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:30,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625783233] [2019-12-27 23:04:30,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:30,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:30,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:30,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:30,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:30,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:30,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:30,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:30,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:30,865 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 23:04:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:30,935 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 23:04:30,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:30,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:30,942 INFO L225 Difference]: With dead ends: 832 [2019-12-27 23:04:30,943 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 23:04:30,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 23:04:30,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 23:04:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 23:04:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 23:04:30,968 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 23:04:30,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:30,968 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 23:04:30,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 23:04:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:30,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:30,971 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:30,971 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:30,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:30,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-27 23:04:30,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:30,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770466648] [2019-12-27 23:04:30,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:31,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770466648] [2019-12-27 23:04:31,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181903470] [2019-12-27 23:04:31,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:31,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:31,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:31,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:31,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:31,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:04:31,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1513351948] [2019-12-27 23:04:31,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:31,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:31,159 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:04:31,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:31,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:31,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:31,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:31,162 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 7 states. [2019-12-27 23:04:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:31,355 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 23:04:31,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:31,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:31,363 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 23:04:31,363 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 23:04:31,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:04:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 23:04:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 23:04:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 23:04:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 23:04:31,388 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 23:04:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:31,389 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 23:04:31,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 23:04:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:31,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:31,390 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:31,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:31,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:31,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-27 23:04:31,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:31,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222508810] [2019-12-27 23:04:31,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:31,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222508810] [2019-12-27 23:04:31,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:31,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:31,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782529433] [2019-12-27 23:04:31,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:31,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:31,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:04:31,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:31,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:31,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:31,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:31,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:31,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:31,675 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 23:04:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:31,874 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 23:04:31,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:31,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:31,882 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 23:04:31,882 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 23:04:31,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 23:04:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 23:04:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 23:04:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 23:04:31,906 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 23:04:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:31,906 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 23:04:31,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 23:04:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:04:31,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:31,907 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:31,907 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:31,908 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-27 23:04:31,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:31,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019143344] [2019-12-27 23:04:31,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:31,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019143344] [2019-12-27 23:04:31,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:31,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:31,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630063881] [2019-12-27 23:04:31,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:31,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:31,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:04:31,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:31,980 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:31,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:31,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:31,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:31,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:31,982 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 23:04:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:32,047 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 23:04:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:32,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:04:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:32,053 INFO L225 Difference]: With dead ends: 736 [2019-12-27 23:04:32,053 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 23:04:32,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 23:04:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 23:04:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 23:04:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 23:04:32,072 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 23:04:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:32,072 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 23:04:32,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 23:04:32,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:04:32,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:32,074 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:32,074 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:32,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:32,074 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-27 23:04:32,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:32,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886202704] [2019-12-27 23:04:32,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:32,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:32,120 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:32,121 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:32,121 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 23:04:32,139 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,139 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,139 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,139 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,139 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,140 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,140 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,140 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,140 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,141 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,141 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,141 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,141 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,142 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,142 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,142 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,142 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,142 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,142 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,143 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,144 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,144 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,144 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,144 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,145 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,145 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,145 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,146 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,146 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,146 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,146 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,146 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,146 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,148 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,149 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,149 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,150 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,150 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,152 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,152 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,152 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,153 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,153 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,154 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,154 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,155 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,155 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,155 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,155 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,155 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,155 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,156 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,156 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,156 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,157 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,157 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,159 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,159 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,159 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,160 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,160 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,162 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,165 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,165 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,165 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,165 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,166 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,190 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,193 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,193 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,194 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,194 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,194 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,194 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 23:04:32,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:32,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:32,196 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:32,197 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:32,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:32,197 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:32,197 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:32,197 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:32,198 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-27 23:04:32,198 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 23:04:32,229 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 23:04:32,229 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 23:04:32,231 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 23:04:32,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 23:04:32,259 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 23:04:32,259 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 23:04:32,262 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 23:04:32,267 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-27 23:04:32,267 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:33,737 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 23:04:34,100 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-27 23:04:34,100 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-27 23:04:34,100 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 23:04:34,213 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 23:04:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 23:04:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:34,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:34,214 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,214 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-27 23:04:34,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138466689] [2019-12-27 23:04:34,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,232 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-27 23:04:34,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138466689] [2019-12-27 23:04:34,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:34,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:34,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1381713311] [2019-12-27 23:04:34,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:34,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:34,235 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:34,235 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:34,235 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:34,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:34,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:34,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:34,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:34,240 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 23:04:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:34,285 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 23:04:34,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:34,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:34,306 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 23:04:34,306 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 23:04:34,306 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-27 23:04:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 23:04:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 23:04:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 23:04:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 23:04:34,390 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 23:04:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:34,391 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 23:04:34,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:34,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 23:04:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:34,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:34,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:34,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-27 23:04:34,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042159881] [2019-12-27 23:04:34,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,424 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-27 23:04:34,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042159881] [2019-12-27 23:04:34,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:34,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:34,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713013239] [2019-12-27 23:04:34,425 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:34,426 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:34,427 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:34,427 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:34,427 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:34,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:34,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:34,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:34,428 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 23:04:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:34,509 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 23:04:34,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:34,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:34,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:34,532 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 23:04:34,533 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 23:04:34,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 23:04:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 23:04:34,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 23:04:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 23:04:34,614 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 23:04:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:34,614 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 23:04:34,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 23:04:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:34,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,615 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:34,616 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,616 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-27 23:04:34,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853517023] [2019-12-27 23:04:34,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:34,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853517023] [2019-12-27 23:04:34,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:34,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:34,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815163423] [2019-12-27 23:04:34,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:34,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:34,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:34,657 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:34,657 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:34,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:34,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:34,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:34,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:34,658 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 23:04:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:34,758 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 23:04:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:34,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:34,787 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 23:04:34,787 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 23:04:34,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:34,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 23:04:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 23:04:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 23:04:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 23:04:34,933 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 23:04:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:34,933 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 23:04:34,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:34,934 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 23:04:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:34,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,934 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:34,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-27 23:04:34,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89710316] [2019-12-27 23:04:34,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:34,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89710316] [2019-12-27 23:04:34,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041560173] [2019-12-27 23:04:34,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:35,052 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:35,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:35,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:35,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:35,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1152273366] [2019-12-27 23:04:35,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:35,059 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:35,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:04:35,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:35,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:04:35,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:35,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:35,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:35,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:35,088 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-27 23:04:35,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:35,455 INFO L93 Difference]: Finished difference Result 4795 states and 15556 transitions. [2019-12-27 23:04:35,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:35,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 23:04:35,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:35,483 INFO L225 Difference]: With dead ends: 4795 [2019-12-27 23:04:35,483 INFO L226 Difference]: Without dead ends: 4790 [2019-12-27 23:04:35,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:04:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2019-12-27 23:04:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 2109. [2019-12-27 23:04:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 23:04:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 23:04:35,591 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 23:04:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:35,591 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 23:04:35,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 23:04:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:35,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:35,592 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:35,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:35,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:35,796 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-27 23:04:35,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:35,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904226223] [2019-12-27 23:04:35,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:35,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904226223] [2019-12-27 23:04:35,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:35,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:35,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1108909929] [2019-12-27 23:04:35,837 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:35,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:35,840 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:04:35,840 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:35,841 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:35,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:35,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:35,842 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 23:04:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:36,116 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 23:04:36,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:36,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:36,132 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 23:04:36,133 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 23:04:36,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 23:04:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 23:04:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:04:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 23:04:36,228 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 23:04:36,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:36,228 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 23:04:36,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 23:04:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:04:36,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:36,230 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:36,230 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:36,230 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-27 23:04:36,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:36,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143941579] [2019-12-27 23:04:36,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:36,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143941579] [2019-12-27 23:04:36,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:36,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:36,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1269113170] [2019-12-27 23:04:36,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:36,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:36,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:04:36,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:36,265 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:36,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:36,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:36,266 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 23:04:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:36,348 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 23:04:36,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:36,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:04:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:36,361 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 23:04:36,361 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 23:04:36,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 23:04:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 23:04:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 23:04:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 23:04:36,444 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 23:04:36,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:36,445 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 23:04:36,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:36,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 23:04:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:36,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:36,446 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:36,446 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:36,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:36,447 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-27 23:04:36,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:36,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156020021] [2019-12-27 23:04:36,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 23:04:36,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156020021] [2019-12-27 23:04:36,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036223562] [2019-12-27 23:04:36,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:36,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:36,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 23:04:36,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:36,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:36,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626307123] [2019-12-27 23:04:36,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:36,606 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:36,610 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 23:04:36,610 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:36,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:04:36,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:04:36,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:36,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:04:36,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:04:36,667 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 10 states. [2019-12-27 23:04:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:37,073 INFO L93 Difference]: Finished difference Result 5135 states and 16723 transitions. [2019-12-27 23:04:37,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:37,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 23:04:37,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:37,091 INFO L225 Difference]: With dead ends: 5135 [2019-12-27 23:04:37,091 INFO L226 Difference]: Without dead ends: 5126 [2019-12-27 23:04:37,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:04:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2019-12-27 23:04:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2270. [2019-12-27 23:04:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 23:04:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 23:04:37,240 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 23:04:37,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:37,241 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 23:04:37,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:04:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 23:04:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:37,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:37,242 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:37,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:37,448 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-27 23:04:37,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:37,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600020873] [2019-12-27 23:04:37,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:37,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600020873] [2019-12-27 23:04:37,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096539963] [2019-12-27 23:04:37,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:37,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:37,563 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:37,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:37,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:37,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33716393] [2019-12-27 23:04:37,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:37,569 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:37,573 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 23:04:37,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:37,599 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:04:37,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:37,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:37,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:37,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:37,600 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-27 23:04:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:37,988 INFO L93 Difference]: Finished difference Result 5272 states and 17168 transitions. [2019-12-27 23:04:37,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:37,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 23:04:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:38,003 INFO L225 Difference]: With dead ends: 5272 [2019-12-27 23:04:38,003 INFO L226 Difference]: Without dead ends: 5259 [2019-12-27 23:04:38,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:04:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-12-27 23:04:38,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 2267. [2019-12-27 23:04:38,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 23:04:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 23:04:38,102 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 23:04:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:38,102 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 23:04:38,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 23:04:38,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:38,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:38,104 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:38,307 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:38,307 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-27 23:04:38,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:38,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672513854] [2019-12-27 23:04:38,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:38,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672513854] [2019-12-27 23:04:38,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:38,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:38,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1435616947] [2019-12-27 23:04:38,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:38,356 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:38,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:04:38,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:38,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:38,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:38,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:38,360 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 23:04:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:38,548 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 23:04:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:38,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:04:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:38,562 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 23:04:38,562 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 23:04:38,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 23:04:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 23:04:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 23:04:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 23:04:38,732 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 23:04:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:38,732 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 23:04:38,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 23:04:38,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:38,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:38,734 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:38,734 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:38,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:38,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-27 23:04:38,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:38,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889425846] [2019-12-27 23:04:38,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:38,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889425846] [2019-12-27 23:04:38,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:38,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:38,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679871023] [2019-12-27 23:04:38,784 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:38,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:38,788 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:04:38,788 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:38,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:38,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:38,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:38,789 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 23:04:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:38,992 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 23:04:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:38,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:04:38,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:39,001 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 23:04:39,001 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 23:04:39,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 23:04:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 23:04:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 23:04:39,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 23:04:39,076 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 23:04:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:39,076 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 23:04:39,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 23:04:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:39,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:39,078 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:39,078 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:39,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-27 23:04:39,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:39,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950179352] [2019-12-27 23:04:39,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 23:04:39,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950179352] [2019-12-27 23:04:39,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163716377] [2019-12-27 23:04:39,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:39,206 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:39,207 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 23:04:39,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:39,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:39,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [305553728] [2019-12-27 23:04:39,213 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:39,214 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:39,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 23:04:39,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:39,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:04:39,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:04:39,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:39,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:04:39,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:04:39,324 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 23:04:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:40,959 INFO L93 Difference]: Finished difference Result 6643 states and 19902 transitions. [2019-12-27 23:04:40,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:04:40,960 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 23:04:40,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:40,973 INFO L225 Difference]: With dead ends: 6643 [2019-12-27 23:04:40,973 INFO L226 Difference]: Without dead ends: 6636 [2019-12-27 23:04:40,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1129, Invalid=3701, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:04:40,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2019-12-27 23:04:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 2101. [2019-12-27 23:04:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 23:04:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 23:04:41,057 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 23:04:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:41,057 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 23:04:41,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:04:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 23:04:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:41,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:41,059 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:41,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:41,263 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-27 23:04:41,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:41,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162675129] [2019-12-27 23:04:41,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 23:04:41,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162675129] [2019-12-27 23:04:41,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704552770] [2019-12-27 23:04:41,328 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:41,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:04:41,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:04:41,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:41,402 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 23:04:41,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:41,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:41,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498852126] [2019-12-27 23:04:41,407 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:41,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:41,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:04:41,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:41,470 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:04:41,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:04:41,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:41,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:04:41,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:04:41,471 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 12 states. [2019-12-27 23:04:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:42,546 INFO L93 Difference]: Finished difference Result 6356 states and 19271 transitions. [2019-12-27 23:04:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:04:42,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 23:04:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:42,565 INFO L225 Difference]: With dead ends: 6356 [2019-12-27 23:04:42,565 INFO L226 Difference]: Without dead ends: 6347 [2019-12-27 23:04:42,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=589, Invalid=1861, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:04:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2019-12-27 23:04:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 2071. [2019-12-27 23:04:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 23:04:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 23:04:42,656 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 23:04:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:42,657 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 23:04:42,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:04:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 23:04:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:42,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:42,662 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:42,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:42,865 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:42,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-27 23:04:42,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:42,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877008896] [2019-12-27 23:04:42,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:42,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877008896] [2019-12-27 23:04:42,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205312532] [2019-12-27 23:04:42,948 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:43,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:04:43,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:04:43,046 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:43,047 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:43,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:43,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:43,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1631496234] [2019-12-27 23:04:43,053 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:43,055 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:43,060 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:04:43,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:43,150 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 23:04:43,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:04:43,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:43,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:04:43,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:43,152 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 15 states. [2019-12-27 23:04:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:44,683 INFO L93 Difference]: Finished difference Result 6519 states and 19507 transitions. [2019-12-27 23:04:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:04:44,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-27 23:04:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:44,694 INFO L225 Difference]: With dead ends: 6519 [2019-12-27 23:04:44,695 INFO L226 Difference]: Without dead ends: 6512 [2019-12-27 23:04:44,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1090, Invalid=3602, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 23:04:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2019-12-27 23:04:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 1997. [2019-12-27 23:04:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 23:04:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 23:04:44,779 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 23:04:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:44,780 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 23:04:44,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:04:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 23:04:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:44,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:44,785 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:44,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:44,989 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-27 23:04:44,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:44,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449272552] [2019-12-27 23:04:44,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:45,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449272552] [2019-12-27 23:04:45,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409837584] [2019-12-27 23:04:45,078 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:45,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:04:45,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:04:45,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:45,193 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:45,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:45,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:45,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019221272] [2019-12-27 23:04:45,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:45,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:45,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 23:04:45,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:45,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:04:45,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:04:45,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:45,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:04:45,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:04:45,254 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-27 23:04:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:46,304 INFO L93 Difference]: Finished difference Result 6273 states and 19028 transitions. [2019-12-27 23:04:46,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:04:46,305 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 23:04:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:46,315 INFO L225 Difference]: With dead ends: 6273 [2019-12-27 23:04:46,315 INFO L226 Difference]: Without dead ends: 6264 [2019-12-27 23:04:46,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=557, Invalid=1795, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 23:04:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-12-27 23:04:46,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 1967. [2019-12-27 23:04:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 23:04:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 23:04:46,389 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 23:04:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:46,389 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 23:04:46,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:04:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 23:04:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:46,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:46,391 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:46,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:46,595 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-27 23:04:46,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:46,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501597872] [2019-12-27 23:04:46,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:04:46,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501597872] [2019-12-27 23:04:46,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:46,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:46,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930494618] [2019-12-27 23:04:46,634 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:46,636 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:46,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:04:46,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:46,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:46,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:46,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:46,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:46,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:46,641 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 23:04:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:46,792 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 23:04:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:46,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 23:04:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:46,801 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 23:04:46,801 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 23:04:46,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 23:04:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 23:04:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 23:04:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 23:04:46,861 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 23:04:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:46,861 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 23:04:46,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 23:04:46,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:46,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:46,863 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:46,863 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:46,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-27 23:04:46,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:46,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362747719] [2019-12-27 23:04:46,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:46,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:46,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362747719] [2019-12-27 23:04:46,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:46,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:04:46,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882083376] [2019-12-27 23:04:46,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:46,927 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:46,930 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:04:46,930 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:46,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:46,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:46,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:46,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:46,934 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 23:04:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:47,424 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 23:04:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:04:47,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:04:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:47,434 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 23:04:47,435 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 23:04:47,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:04:47,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 23:04:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 23:04:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 23:04:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 23:04:47,491 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 23:04:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:47,492 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 23:04:47,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 23:04:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:47,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:47,494 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:47,494 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:47,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:47,494 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-27 23:04:47,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:47,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479507900] [2019-12-27 23:04:47,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:47,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479507900] [2019-12-27 23:04:47,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:47,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:04:47,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1109154093] [2019-12-27 23:04:47,546 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:47,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:47,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:04:47,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:47,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:47,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:47,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:47,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:47,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:47,552 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 23:04:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:48,042 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 23:04:48,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:04:48,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:04:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:48,056 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 23:04:48,056 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 23:04:48,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:04:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 23:04:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 23:04:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 23:04:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 23:04:48,133 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 23:04:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:48,133 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 23:04:48,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 23:04:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:04:48,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:48,136 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:48,136 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:48,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-27 23:04:48,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:48,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450972579] [2019-12-27 23:04:48,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:48,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:48,159 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:48,159 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:48,159 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 23:04:48,172 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,172 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,172 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,172 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,173 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,173 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,173 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,173 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,173 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,173 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,174 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,175 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,175 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,175 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,175 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,175 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,175 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,175 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,178 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,178 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,178 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,178 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,178 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,178 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,178 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,180 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,180 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,180 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,181 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,181 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,181 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,181 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,181 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,181 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,181 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,182 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,182 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,182 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,182 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,182 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,182 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,183 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,183 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,183 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,187 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,187 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,187 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,187 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,187 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,189 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,189 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,189 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,189 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,189 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,190 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,190 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,191 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,191 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,191 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,192 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,192 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,192 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,192 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,192 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,193 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,194 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,194 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,194 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,194 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,196 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,196 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,196 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,196 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,196 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,197 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,198 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,198 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,198 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,198 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,198 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,198 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,199 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,199 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,199 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,199 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,199 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,200 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,200 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,201 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,201 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,201 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,201 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,201 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,202 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,202 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,202 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,203 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,203 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,203 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:48,204 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 23:04:48,204 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:48,204 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:48,204 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:48,204 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:48,205 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:48,205 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:48,205 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:48,205 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:48,206 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-27 23:04:48,206 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 23:04:48,227 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 23:04:48,228 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 23:04:48,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 23:04:48,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 23:04:48,256 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 23:04:48,256 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 23:04:48,258 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 23:04:48,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-27 23:04:48,266 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:49,759 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 23:04:50,212 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-27 23:04:50,213 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 23:04:50,213 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 23:04:50,476 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 23:04:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 23:04:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:50,476 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:50,476 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:50,476 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:50,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-27 23:04:50,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:50,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465662558] [2019-12-27 23:04:50,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:50,497 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-27 23:04:50,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465662558] [2019-12-27 23:04:50,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:50,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:50,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222823037] [2019-12-27 23:04:50,498 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:50,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:50,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:50,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:50,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:50,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:50,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:50,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:50,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:50,499 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 23:04:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:50,560 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 23:04:50,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:50,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:50,579 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 23:04:50,579 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 23:04:50,579 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-27 23:04:50,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 23:04:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 23:04:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 23:04:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 23:04:50,781 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 23:04:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:50,781 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 23:04:50,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:50,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 23:04:50,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:50,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:50,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:50,782 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:50,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:50,782 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-27 23:04:50,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:50,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276469448] [2019-12-27 23:04:50,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:50,830 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-27 23:04:50,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276469448] [2019-12-27 23:04:50,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:50,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:50,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410948959] [2019-12-27 23:04:50,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:50,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:50,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:50,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:50,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:50,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:50,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:50,833 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 23:04:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:50,948 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 23:04:50,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:50,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:50,983 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 23:04:50,983 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 23:04:50,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:51,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 23:04:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 23:04:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 23:04:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 23:04:51,203 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 23:04:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:51,203 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 23:04:51,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 23:04:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:51,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:51,204 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:51,204 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:51,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:51,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-27 23:04:51,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:51,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891408516] [2019-12-27 23:04:51,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:51,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891408516] [2019-12-27 23:04:51,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:51,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:51,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [338324808] [2019-12-27 23:04:51,245 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:51,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:51,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:51,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:51,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:51,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:51,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:51,248 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 23:04:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:51,389 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 23:04:51,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:51,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:51,433 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 23:04:51,433 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 23:04:51,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 23:04:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 23:04:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 23:04:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 23:04:51,683 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 23:04:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:51,683 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 23:04:51,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 23:04:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:51,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:51,684 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:51,684 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-27 23:04:51,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:51,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898347506] [2019-12-27 23:04:51,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:51,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898347506] [2019-12-27 23:04:51,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873602823] [2019-12-27 23:04:51,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:51,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:51,798 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:51,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:51,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:51,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183764315] [2019-12-27 23:04:51,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:51,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:51,805 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:04:51,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:51,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:04:51,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:51,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:51,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:51,833 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-27 23:04:52,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:52,446 INFO L93 Difference]: Finished difference Result 17481 states and 68797 transitions. [2019-12-27 23:04:52,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:52,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 23:04:52,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:52,505 INFO L225 Difference]: With dead ends: 17481 [2019-12-27 23:04:52,506 INFO L226 Difference]: Without dead ends: 17476 [2019-12-27 23:04:52,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:04:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17476 states. [2019-12-27 23:04:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17476 to 7067. [2019-12-27 23:04:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 23:04:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 23:04:52,814 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 23:04:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:52,814 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 23:04:52,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 23:04:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:52,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:52,815 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:53,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:53,019 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-27 23:04:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:53,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321500911] [2019-12-27 23:04:53,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:53,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321500911] [2019-12-27 23:04:53,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:53,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:53,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1847617917] [2019-12-27 23:04:53,055 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:53,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:53,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:04:53,058 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:53,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:53,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:53,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:53,059 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 23:04:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:53,331 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 23:04:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:53,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:53,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:53,376 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 23:04:53,376 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 23:04:53,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 23:04:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 23:04:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 23:04:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 23:04:54,390 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 23:04:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:54,390 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 23:04:54,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 23:04:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:04:54,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:54,391 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:54,391 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:54,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-27 23:04:54,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:54,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314351878] [2019-12-27 23:04:54,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:54,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314351878] [2019-12-27 23:04:54,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:54,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:54,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124172949] [2019-12-27 23:04:54,427 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:54,429 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:54,431 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:04:54,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:54,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:54,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:54,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:54,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:54,432 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 23:04:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:54,551 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 23:04:54,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:54,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:04:54,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:54,578 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 23:04:54,578 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 23:04:54,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 23:04:54,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 23:04:54,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 23:04:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 23:04:54,765 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 23:04:54,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:54,765 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 23:04:54,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 23:04:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:54,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:54,766 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:54,766 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:54,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:54,766 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-27 23:04:54,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:54,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439230947] [2019-12-27 23:04:54,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:54,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439230947] [2019-12-27 23:04:54,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519916557] [2019-12-27 23:04:54,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:54,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:54,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:54,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:54,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:54,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [9282515] [2019-12-27 23:04:54,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:54,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:54,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 23:04:54,906 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:54,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:04:54,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:04:54,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:54,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:04:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:04:54,952 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 10 states. [2019-12-27 23:04:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:55,652 INFO L93 Difference]: Finished difference Result 20047 states and 79810 transitions. [2019-12-27 23:04:55,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:55,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 23:04:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:55,746 INFO L225 Difference]: With dead ends: 20047 [2019-12-27 23:04:55,746 INFO L226 Difference]: Without dead ends: 20038 [2019-12-27 23:04:55,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:04:55,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20038 states. [2019-12-27 23:04:56,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20038 to 8204. [2019-12-27 23:04:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 23:04:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 23:04:56,430 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 23:04:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:56,430 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 23:04:56,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:04:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 23:04:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:56,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:56,433 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:56,638 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:56,638 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:56,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:56,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-27 23:04:56,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:56,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256148619] [2019-12-27 23:04:56,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:56,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256148619] [2019-12-27 23:04:56,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368427327] [2019-12-27 23:04:56,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:56,782 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:56,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:56,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:56,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:56,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1378781654] [2019-12-27 23:04:56,794 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:56,796 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:56,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 23:04:56,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:56,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:56,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:56,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:56,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:56,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:56,800 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 23:04:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:57,065 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-27 23:04:57,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:57,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:04:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:57,110 INFO L225 Difference]: With dead ends: 19158 [2019-12-27 23:04:57,111 INFO L226 Difference]: Without dead ends: 19149 [2019-12-27 23:04:57,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-27 23:04:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-27 23:04:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 23:04:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-27 23:04:57,365 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-27 23:04:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:57,365 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-27 23:04:57,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-27 23:04:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:57,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:57,366 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:57,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:57,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:57,571 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-27 23:04:57,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:57,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008463858] [2019-12-27 23:04:57,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:57,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008463858] [2019-12-27 23:04:57,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:57,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:57,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791082585] [2019-12-27 23:04:57,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:57,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:57,614 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:04:57,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:57,615 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:57,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:57,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:57,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:57,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:57,616 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-27 23:04:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:58,018 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-27 23:04:58,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:58,019 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:04:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:58,080 INFO L225 Difference]: With dead ends: 19350 [2019-12-27 23:04:58,080 INFO L226 Difference]: Without dead ends: 19341 [2019-12-27 23:04:58,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-27 23:04:58,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-27 23:04:58,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-27 23:04:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-27 23:04:58,510 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-27 23:04:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:58,511 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-27 23:04:58,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-27 23:04:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:58,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:58,512 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:58,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-27 23:04:58,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:58,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797707102] [2019-12-27 23:04:58,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:04:58,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797707102] [2019-12-27 23:04:58,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:58,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:58,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102606231] [2019-12-27 23:04:58,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:58,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:58,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:04:58,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:58,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:58,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:58,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:58,562 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-27 23:04:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:58,890 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 23:04:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:58,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:04:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:58,952 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 23:04:58,952 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 23:04:58,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 23:04:59,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 23:04:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 23:04:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 23:04:59,240 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 23:04:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:59,240 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 23:04:59,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 23:04:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:59,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:59,241 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:59,241 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:04:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:59,242 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-27 23:04:59,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:59,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002064154] [2019-12-27 23:04:59,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:59,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002064154] [2019-12-27 23:04:59,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183335486] [2019-12-27 23:04:59,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:59,361 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:59,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:04:59,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:59,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:59,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [329448797] [2019-12-27 23:04:59,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:59,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:59,375 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 23:04:59,375 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:59,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:04:59,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:04:59,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:59,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:04:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:04:59,484 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-27 23:05:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:01,197 INFO L93 Difference]: Finished difference Result 29507 states and 108761 transitions. [2019-12-27 23:05:01,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:05:01,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 23:05:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:01,262 INFO L225 Difference]: With dead ends: 29507 [2019-12-27 23:05:01,262 INFO L226 Difference]: Without dead ends: 29500 [2019-12-27 23:05:01,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1129, Invalid=3701, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:05:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29500 states. [2019-12-27 23:05:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29500 to 7999. [2019-12-27 23:05:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-27 23:05:01,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-27 23:05:01,589 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-27 23:05:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:01,589 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-27 23:05:01,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:05:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-27 23:05:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:01,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:01,590 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:01,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:01,791 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:01,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:01,791 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-27 23:05:01,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:01,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22583246] [2019-12-27 23:05:01,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:05:01,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22583246] [2019-12-27 23:05:01,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382588847] [2019-12-27 23:05:01,853 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:01,931 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:01,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:01,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:01,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:05:01,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:01,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:01,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1194238952] [2019-12-27 23:05:01,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:01,940 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:01,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:05:01,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:01,994 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:01,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:05:01,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:01,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:05:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:05:01,995 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 12 states. [2019-12-27 23:05:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:03,259 INFO L93 Difference]: Finished difference Result 28304 states and 105368 transitions. [2019-12-27 23:05:03,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:05:03,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 23:05:03,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:03,322 INFO L225 Difference]: With dead ends: 28304 [2019-12-27 23:05:03,322 INFO L226 Difference]: Without dead ends: 28295 [2019-12-27 23:05:03,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=589, Invalid=1861, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:05:03,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28295 states. [2019-12-27 23:05:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28295 to 7893. [2019-12-27 23:05:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 23:05:03,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 23:05:03,609 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 23:05:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:03,610 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 23:05:03,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:05:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 23:05:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:03,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:03,611 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:03,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:03,812 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:03,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-27 23:05:03,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:03,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418154610] [2019-12-27 23:05:03,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:05:03,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418154610] [2019-12-27 23:05:03,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423759031] [2019-12-27 23:05:03,864 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:03,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:05:03,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:03,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:03,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:05:03,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:03,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:03,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2079635861] [2019-12-27 23:05:03,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:03,944 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:03,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:05:03,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:03,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:05:03,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:05:03,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:03,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:05:03,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:05:03,989 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 11 states. [2019-12-27 23:05:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:04,970 INFO L93 Difference]: Finished difference Result 28007 states and 104728 transitions. [2019-12-27 23:05:04,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:05:04,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 23:05:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:05,033 INFO L225 Difference]: With dead ends: 28007 [2019-12-27 23:05:05,033 INFO L226 Difference]: Without dead ends: 28002 [2019-12-27 23:05:05,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:05:05,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28002 states. [2019-12-27 23:05:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28002 to 7675. [2019-12-27 23:05:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-27 23:05:05,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-27 23:05:05,341 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-27 23:05:05,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:05,341 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-27 23:05:05,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:05:05,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-27 23:05:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:05,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:05,343 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:05,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:05,544 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-27 23:05:05,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:05,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815409886] [2019-12-27 23:05:05,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:05,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:05:05,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815409886] [2019-12-27 23:05:05,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934261757] [2019-12-27 23:05:05,596 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:05,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:05:05,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:05,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:05,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:05:05,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:05,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:05,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [763334763] [2019-12-27 23:05:05,783 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:05,785 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:05,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 23:05:05,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:05,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:05,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:05,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:05,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:05,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:05,791 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 9 states. [2019-12-27 23:05:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:06,439 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-27 23:05:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:06,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:05:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:06,499 INFO L225 Difference]: With dead ends: 25959 [2019-12-27 23:05:06,500 INFO L226 Difference]: Without dead ends: 25953 [2019-12-27 23:05:06,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-27 23:05:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-27 23:05:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-27 23:05:06,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-27 23:05:06,790 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-27 23:05:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:06,790 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-27 23:05:06,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-27 23:05:06,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:06,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:06,792 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:06,993 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:06,993 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-27 23:05:06,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:06,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773980326] [2019-12-27 23:05:06,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:07,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:07,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773980326] [2019-12-27 23:05:07,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:07,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:07,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [350002336] [2019-12-27 23:05:07,019 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:07,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:07,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:05:07,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:07,023 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:07,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:07,024 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-27 23:05:07,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:07,148 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-27 23:05:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:07,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 23:05:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:07,178 INFO L225 Difference]: With dead ends: 12952 [2019-12-27 23:05:07,178 INFO L226 Difference]: Without dead ends: 12936 [2019-12-27 23:05:07,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-27 23:05:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-27 23:05:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-27 23:05:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-27 23:05:07,374 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-27 23:05:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:07,375 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-27 23:05:07,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:05:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-27 23:05:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:07,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:07,376 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:07,377 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:07,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:07,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-27 23:05:07,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:07,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337557092] [2019-12-27 23:05:07,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:07,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337557092] [2019-12-27 23:05:07,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:07,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:07,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091689307] [2019-12-27 23:05:07,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:07,425 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:07,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:05:07,429 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:07,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:07,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:07,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:07,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:07,430 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-27 23:05:08,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:08,485 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-27 23:05:08,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:08,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:05:08,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:08,605 INFO L225 Difference]: With dead ends: 29252 [2019-12-27 23:05:08,605 INFO L226 Difference]: Without dead ends: 29245 [2019-12-27 23:05:08,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-27 23:05:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-27 23:05:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 23:05:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-27 23:05:09,044 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-27 23:05:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:09,044 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-27 23:05:09,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-27 23:05:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:09,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:09,046 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:09,046 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:09,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:09,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-27 23:05:09,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:09,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411993701] [2019-12-27 23:05:09,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:09,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411993701] [2019-12-27 23:05:09,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:09,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:09,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845247663] [2019-12-27 23:05:09,097 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:09,099 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:09,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:05:09,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:09,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:09,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:09,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:09,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:09,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:09,104 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-27 23:05:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:09,739 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-27 23:05:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:09,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:05:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:09,804 INFO L225 Difference]: With dead ends: 28866 [2019-12-27 23:05:09,805 INFO L226 Difference]: Without dead ends: 28856 [2019-12-27 23:05:09,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-27 23:05:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-27 23:05:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 23:05:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 23:05:10,140 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 23:05:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:10,141 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 23:05:10,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 23:05:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:10,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:10,143 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:10,143 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:10,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-27 23:05:10,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:10,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872142506] [2019-12-27 23:05:10,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:10,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872142506] [2019-12-27 23:05:10,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257452023] [2019-12-27 23:05:10,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:10,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:05:10,266 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:10,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:10,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:05:10,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1809470208] [2019-12-27 23:05:10,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:10,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:10,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 23:05:10,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:10,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:05:10,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:05:10,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:10,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:05:10,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:05:10,360 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 11 states. [2019-12-27 23:05:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:10,916 INFO L93 Difference]: Finished difference Result 21073 states and 84547 transitions. [2019-12-27 23:05:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:05:10,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 23:05:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:11,115 INFO L225 Difference]: With dead ends: 21073 [2019-12-27 23:05:11,115 INFO L226 Difference]: Without dead ends: 21054 [2019-12-27 23:05:11,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:05:11,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21054 states. [2019-12-27 23:05:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21054 to 8674. [2019-12-27 23:05:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 23:05:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 23:05:11,356 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 23:05:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:11,356 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 23:05:11,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:05:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 23:05:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:11,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:11,358 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:11,559 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:11,559 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-27 23:05:11,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:11,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137731504] [2019-12-27 23:05:11,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:11,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137731504] [2019-12-27 23:05:11,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352536228] [2019-12-27 23:05:11,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:11,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:05:11,684 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:11,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:11,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:05:11,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065766121] [2019-12-27 23:05:11,693 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:11,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:11,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 23:05:11,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:11,700 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:11,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:11,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:11,700 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 7 states. [2019-12-27 23:05:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:11,978 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-27 23:05:11,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:11,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:12,025 INFO L225 Difference]: With dead ends: 20331 [2019-12-27 23:05:12,025 INFO L226 Difference]: Without dead ends: 20317 [2019-12-27 23:05:12,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:05:12,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-27 23:05:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-27 23:05:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-27 23:05:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-27 23:05:12,288 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-27 23:05:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:12,288 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-27 23:05:12,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-27 23:05:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:12,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:12,291 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:12,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:12,495 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:12,495 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-27 23:05:12,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:12,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928977285] [2019-12-27 23:05:12,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:12,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928977285] [2019-12-27 23:05:12,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:12,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:12,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1572564627] [2019-12-27 23:05:12,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:12,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:12,540 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:05:12,540 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:12,540 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:12,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:12,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:12,541 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-27 23:05:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:12,834 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-27 23:05:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:12,834 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:12,880 INFO L225 Difference]: With dead ends: 20594 [2019-12-27 23:05:12,880 INFO L226 Difference]: Without dead ends: 20575 [2019-12-27 23:05:12,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:05:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-27 23:05:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-27 23:05:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-27 23:05:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-27 23:05:13,132 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-27 23:05:13,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:13,132 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-27 23:05:13,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-27 23:05:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:13,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:13,134 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:13,135 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-27 23:05:13,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:13,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270857380] [2019-12-27 23:05:13,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:13,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270857380] [2019-12-27 23:05:13,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:13,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:13,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1992288922] [2019-12-27 23:05:13,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:13,175 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:13,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:05:13,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:13,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:13,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:13,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:13,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:13,180 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-27 23:05:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:13,573 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-27 23:05:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:13,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:13,619 INFO L225 Difference]: With dead ends: 20360 [2019-12-27 23:05:13,619 INFO L226 Difference]: Without dead ends: 20341 [2019-12-27 23:05:13,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:05:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-27 23:05:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-27 23:05:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 23:05:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-27 23:05:13,862 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-27 23:05:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:13,862 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-27 23:05:13,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:13,863 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-27 23:05:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:13,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:13,864 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:13,865 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:13,865 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-27 23:05:13,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:13,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032205036] [2019-12-27 23:05:13,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:13,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032205036] [2019-12-27 23:05:13,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:13,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:13,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157190642] [2019-12-27 23:05:13,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:13,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:13,906 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:05:13,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:13,907 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:13,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:13,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:13,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:13,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:13,907 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-27 23:05:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:14,256 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-27 23:05:14,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:14,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:14,331 INFO L225 Difference]: With dead ends: 20740 [2019-12-27 23:05:14,332 INFO L226 Difference]: Without dead ends: 20721 [2019-12-27 23:05:14,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:05:14,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-27 23:05:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-27 23:05:14,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-27 23:05:14,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-27 23:05:14,592 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-27 23:05:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:14,592 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-27 23:05:14,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-27 23:05:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:14,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:14,594 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:14,594 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:14,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:14,594 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-27 23:05:14,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:14,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118696894] [2019-12-27 23:05:14,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:14,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:14,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118696894] [2019-12-27 23:05:14,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:14,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:14,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2027009796] [2019-12-27 23:05:14,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:14,632 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:14,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 23:05:14,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:14,680 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:14,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:05:14,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:05:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:05:14,682 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 11 states. [2019-12-27 23:05:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:15,370 INFO L93 Difference]: Finished difference Result 23635 states and 93345 transitions. [2019-12-27 23:05:15,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:05:15,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 23:05:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:15,419 INFO L225 Difference]: With dead ends: 23635 [2019-12-27 23:05:15,419 INFO L226 Difference]: Without dead ends: 23606 [2019-12-27 23:05:15,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:05:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23606 states. [2019-12-27 23:05:15,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23606 to 9286. [2019-12-27 23:05:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 23:05:15,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 23:05:15,696 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 23:05:15,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:15,696 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 23:05:15,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:05:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 23:05:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:15,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:15,700 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:15,700 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:15,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:15,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-27 23:05:15,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:15,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400653218] [2019-12-27 23:05:15,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:15,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400653218] [2019-12-27 23:05:15,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581528584] [2019-12-27 23:05:15,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:15,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:15,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:15,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:15,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:15,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:15,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [784108273] [2019-12-27 23:05:15,846 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:15,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:15,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 23:05:15,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:16,054 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 23:05:16,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:05:16,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:16,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:05:16,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:05:16,056 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 19 states. [2019-12-27 23:05:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:17,770 INFO L93 Difference]: Finished difference Result 33531 states and 124595 transitions. [2019-12-27 23:05:17,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:05:17,770 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 23:05:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:17,843 INFO L225 Difference]: With dead ends: 33531 [2019-12-27 23:05:17,843 INFO L226 Difference]: Without dead ends: 33513 [2019-12-27 23:05:17,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1271, Invalid=3985, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 23:05:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33513 states. [2019-12-27 23:05:18,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33513 to 9200. [2019-12-27 23:05:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-27 23:05:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-27 23:05:18,217 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-27 23:05:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:18,217 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-27 23:05:18,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:05:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-27 23:05:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:18,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:18,221 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:18,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:18,421 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-27 23:05:18,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:18,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468248263] [2019-12-27 23:05:18,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:18,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:18,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468248263] [2019-12-27 23:05:18,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267038433] [2019-12-27 23:05:18,477 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:18,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:18,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:18,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:18,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:18,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:18,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:18,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841309526] [2019-12-27 23:05:18,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:18,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:18,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:05:18,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:18,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:05:18,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:18,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:18,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:18,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:18,636 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 13 states. [2019-12-27 23:05:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:19,719 INFO L93 Difference]: Finished difference Result 31912 states and 119979 transitions. [2019-12-27 23:05:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:05:19,719 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:19,789 INFO L225 Difference]: With dead ends: 31912 [2019-12-27 23:05:19,790 INFO L226 Difference]: Without dead ends: 31893 [2019-12-27 23:05:19,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=622, Invalid=1928, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 23:05:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31893 states. [2019-12-27 23:05:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31893 to 9197. [2019-12-27 23:05:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-27 23:05:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-27 23:05:20,384 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-27 23:05:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:20,384 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-27 23:05:20,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-27 23:05:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:20,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:20,387 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:20,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:20,588 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:20,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-27 23:05:20,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:20,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504394925] [2019-12-27 23:05:20,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:20,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504394925] [2019-12-27 23:05:20,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227044001] [2019-12-27 23:05:20,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:20,721 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:20,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:20,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:20,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:20,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525156250] [2019-12-27 23:05:20,726 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:20,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:20,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:05:20,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:20,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:05:20,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:20,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:20,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:20,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:20,811 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 13 states. [2019-12-27 23:05:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:21,886 INFO L93 Difference]: Finished difference Result 31552 states and 118615 transitions. [2019-12-27 23:05:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:05:21,886 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:21,954 INFO L225 Difference]: With dead ends: 31552 [2019-12-27 23:05:21,954 INFO L226 Difference]: Without dead ends: 31534 [2019-12-27 23:05:21,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=622, Invalid=1928, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 23:05:22,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31534 states. [2019-12-27 23:05:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31534 to 9121. [2019-12-27 23:05:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-27 23:05:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-27 23:05:22,339 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-27 23:05:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:22,339 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-27 23:05:22,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:22,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-27 23:05:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:22,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:22,343 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:22,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:22,543 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:22,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:22,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-27 23:05:22,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:22,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579116496] [2019-12-27 23:05:22,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:22,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579116496] [2019-12-27 23:05:22,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640430910] [2019-12-27 23:05:22,592 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:22,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:22,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:22,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:22,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:05:22,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:22,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:22,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1436302742] [2019-12-27 23:05:22,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:22,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:22,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 23:05:22,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:22,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:05:22,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:05:22,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:22,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:05:22,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:05:22,836 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 17 states. [2019-12-27 23:05:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:24,491 INFO L93 Difference]: Finished difference Result 32380 states and 120008 transitions. [2019-12-27 23:05:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:05:24,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:05:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:24,560 INFO L225 Difference]: With dead ends: 32380 [2019-12-27 23:05:24,560 INFO L226 Difference]: Without dead ends: 32361 [2019-12-27 23:05:24,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1169, Invalid=3801, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 23:05:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32361 states. [2019-12-27 23:05:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32361 to 9044. [2019-12-27 23:05:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 23:05:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 23:05:25,154 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 23:05:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:25,154 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 23:05:25,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:05:25,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 23:05:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:25,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:25,157 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:25,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:25,358 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:25,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-27 23:05:25,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:25,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740401419] [2019-12-27 23:05:25,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 23:05:25,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740401419] [2019-12-27 23:05:25,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714448247] [2019-12-27 23:05:25,404 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:25,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:05:25,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:25,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:25,485 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 23:05:25,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:25,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:25,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [744206716] [2019-12-27 23:05:25,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:25,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:25,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 23:05:25,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:25,556 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:25,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:05:25,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:05:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:05:25,557 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 12 states. [2019-12-27 23:05:26,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:26,516 INFO L93 Difference]: Finished difference Result 30950 states and 116627 transitions. [2019-12-27 23:05:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:05:26,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 23:05:26,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:26,583 INFO L225 Difference]: With dead ends: 30950 [2019-12-27 23:05:26,583 INFO L226 Difference]: Without dead ends: 30936 [2019-12-27 23:05:26,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=527, Invalid=1543, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 23:05:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30936 states. [2019-12-27 23:05:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30936 to 8874. [2019-12-27 23:05:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-27 23:05:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-27 23:05:26,928 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-27 23:05:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:26,928 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-27 23:05:26,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:05:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-27 23:05:26,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:26,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:26,931 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:27,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:27,132 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:27,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-27 23:05:27,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:27,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002430337] [2019-12-27 23:05:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002430337] [2019-12-27 23:05:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610200287] [2019-12-27 23:05:27,182 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:27,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:05:27,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:27,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:27,261 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:27,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:27,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:27,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [206688679] [2019-12-27 23:05:27,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:27,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:27,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:27,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:27,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:27,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:27,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:27,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:27,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:27,274 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 9 states. [2019-12-27 23:05:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:27,945 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-27 23:05:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:27,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:28,008 INFO L225 Difference]: With dead ends: 28993 [2019-12-27 23:05:28,008 INFO L226 Difference]: Without dead ends: 28982 [2019-12-27 23:05:28,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-27 23:05:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-27 23:05:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-27 23:05:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-27 23:05:28,344 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-27 23:05:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:28,344 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-27 23:05:28,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-27 23:05:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:28,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:28,347 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:28,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:28,548 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:28,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-27 23:05:28,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:28,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693495825] [2019-12-27 23:05:28,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:28,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693495825] [2019-12-27 23:05:28,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787449472] [2019-12-27 23:05:28,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:28,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:28,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:28,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:28,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:28,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [436830632] [2019-12-27 23:05:28,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:28,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:28,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:28,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:28,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:28,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:28,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:28,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:28,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:28,694 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 9 states. [2019-12-27 23:05:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:29,519 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-27 23:05:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:29,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:29,588 INFO L225 Difference]: With dead ends: 28840 [2019-12-27 23:05:29,589 INFO L226 Difference]: Without dead ends: 28830 [2019-12-27 23:05:29,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-27 23:05:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-27 23:05:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-27 23:05:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-27 23:05:29,905 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-27 23:05:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:29,905 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-27 23:05:29,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-27 23:05:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:29,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:29,908 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:30,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:30,109 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-27 23:05:30,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:30,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452955636] [2019-12-27 23:05:30,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:30,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452955636] [2019-12-27 23:05:30,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303555330] [2019-12-27 23:05:30,174 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:30,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:30,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:30,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:30,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 23:05:30,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:30,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:30,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091425923] [2019-12-27 23:05:30,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:30,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:30,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:05:30,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:30,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:30,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:30,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:30,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:30,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:30,337 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 13 states. [2019-12-27 23:05:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:31,796 INFO L93 Difference]: Finished difference Result 31746 states and 118539 transitions. [2019-12-27 23:05:31,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 23:05:31,796 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:31,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:31,869 INFO L225 Difference]: With dead ends: 31746 [2019-12-27 23:05:31,869 INFO L226 Difference]: Without dead ends: 31727 [2019-12-27 23:05:31,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=921, Invalid=3111, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 23:05:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31727 states. [2019-12-27 23:05:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31727 to 8722. [2019-12-27 23:05:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 23:05:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-27 23:05:32,219 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-27 23:05:32,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:32,220 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-27 23:05:32,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-27 23:05:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:32,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:32,224 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:32,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:32,425 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:32,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:32,425 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-27 23:05:32,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:32,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390479694] [2019-12-27 23:05:32,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:32,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390479694] [2019-12-27 23:05:32,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:32,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:32,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [606486440] [2019-12-27 23:05:32,470 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:32,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:32,476 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:32,476 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:32,476 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:32,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:32,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:32,477 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-27 23:05:33,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:33,105 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-27 23:05:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:33,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:33,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:33,166 INFO L225 Difference]: With dead ends: 28362 [2019-12-27 23:05:33,166 INFO L226 Difference]: Without dead ends: 28352 [2019-12-27 23:05:33,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:33,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-27 23:05:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-27 23:05:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-27 23:05:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-27 23:05:33,480 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-27 23:05:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:33,480 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-27 23:05:33,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-27 23:05:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:33,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:33,484 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:33,484 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-27 23:05:33,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:33,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959540974] [2019-12-27 23:05:33,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:33,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959540974] [2019-12-27 23:05:33,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:33,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:33,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2004228757] [2019-12-27 23:05:33,535 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:33,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:33,543 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:33,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:33,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:33,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:33,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:33,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:33,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:33,545 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-27 23:05:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:34,231 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-27 23:05:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:34,231 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:34,293 INFO L225 Difference]: With dead ends: 28156 [2019-12-27 23:05:34,293 INFO L226 Difference]: Without dead ends: 28146 [2019-12-27 23:05:34,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-27 23:05:34,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-27 23:05:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-27 23:05:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-27 23:05:34,596 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-27 23:05:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:34,596 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-27 23:05:34,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-27 23:05:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:34,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:34,599 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:34,599 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-27 23:05:34,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:34,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021161243] [2019-12-27 23:05:34,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:34,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:34,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021161243] [2019-12-27 23:05:34,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:34,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:34,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1043486507] [2019-12-27 23:05:34,644 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:34,646 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:34,651 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:34,651 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:34,651 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:34,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:34,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:34,652 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-27 23:05:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:35,324 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-27 23:05:35,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:35,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:35,384 INFO L225 Difference]: With dead ends: 27714 [2019-12-27 23:05:35,384 INFO L226 Difference]: Without dead ends: 27700 [2019-12-27 23:05:35,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-27 23:05:35,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-27 23:05:35,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-27 23:05:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-27 23:05:35,684 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-27 23:05:35,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:35,684 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-27 23:05:35,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:35,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-27 23:05:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:35,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:35,687 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:35,688 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:35,688 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-27 23:05:35,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:35,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294120619] [2019-12-27 23:05:35,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:35,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294120619] [2019-12-27 23:05:35,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:35,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:35,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684289498] [2019-12-27 23:05:35,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:35,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:35,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:35,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:35,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:35,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:35,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:35,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:35,749 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-27 23:05:36,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:36,374 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-27 23:05:36,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:36,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:36,444 INFO L225 Difference]: With dead ends: 27553 [2019-12-27 23:05:36,444 INFO L226 Difference]: Without dead ends: 27543 [2019-12-27 23:05:36,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-27 23:05:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-27 23:05:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-27 23:05:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-27 23:05:36,735 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-27 23:05:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:36,736 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-27 23:05:36,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-27 23:05:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:36,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:36,739 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:36,739 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:36,739 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-27 23:05:36,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:36,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890091309] [2019-12-27 23:05:36,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:36,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890091309] [2019-12-27 23:05:36,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:36,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:36,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [748720040] [2019-12-27 23:05:36,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:36,790 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:36,795 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:36,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:36,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:36,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:36,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:36,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:36,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:36,796 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-27 23:05:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:37,499 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-27 23:05:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:37,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:37,559 INFO L225 Difference]: With dead ends: 27570 [2019-12-27 23:05:37,559 INFO L226 Difference]: Without dead ends: 27556 [2019-12-27 23:05:37,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:37,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-27 23:05:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-27 23:05:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-27 23:05:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-27 23:05:37,998 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-27 23:05:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:37,998 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-27 23:05:37,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-27 23:05:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:38,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:38,002 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:38,002 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:38,002 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-27 23:05:38,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:38,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867533608] [2019-12-27 23:05:38,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:38,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867533608] [2019-12-27 23:05:38,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:38,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:38,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675190166] [2019-12-27 23:05:38,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:38,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:38,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:38,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:38,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:38,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:38,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:38,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:38,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:38,073 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-27 23:05:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:38,937 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-27 23:05:38,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:38,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:39,025 INFO L225 Difference]: With dead ends: 27265 [2019-12-27 23:05:39,025 INFO L226 Difference]: Without dead ends: 27251 [2019-12-27 23:05:39,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:39,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-27 23:05:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-27 23:05:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-27 23:05:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-27 23:05:39,327 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-27 23:05:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:39,327 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-27 23:05:39,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-27 23:05:39,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:39,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:39,330 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:39,330 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-27 23:05:39,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:39,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844713240] [2019-12-27 23:05:39,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 23:05:39,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844713240] [2019-12-27 23:05:39,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:39,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:39,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263313289] [2019-12-27 23:05:39,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:39,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:39,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:39,357 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:39,357 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:39,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:39,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:39,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:39,358 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-27 23:05:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:39,474 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-27 23:05:39,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:39,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 23:05:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:39,505 INFO L225 Difference]: With dead ends: 12944 [2019-12-27 23:05:39,505 INFO L226 Difference]: Without dead ends: 12912 [2019-12-27 23:05:39,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-27 23:05:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-27 23:05:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-27 23:05:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-27 23:05:39,702 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-27 23:05:39,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:39,702 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-27 23:05:39,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:05:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-27 23:05:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:39,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:39,705 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:39,705 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-27 23:05:39,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:39,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115494838] [2019-12-27 23:05:39,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:39,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115494838] [2019-12-27 23:05:39,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:39,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:39,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1649516274] [2019-12-27 23:05:39,756 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:39,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:39,764 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:39,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:39,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:05:39,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:05:39,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:39,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:05:39,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:05:39,886 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 17 states. [2019-12-27 23:05:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:42,100 INFO L93 Difference]: Finished difference Result 36090 states and 131919 transitions. [2019-12-27 23:05:42,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 23:05:42,100 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:05:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:42,177 INFO L225 Difference]: With dead ends: 36090 [2019-12-27 23:05:42,177 INFO L226 Difference]: Without dead ends: 36060 [2019-12-27 23:05:42,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 23:05:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36060 states. [2019-12-27 23:05:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36060 to 9188. [2019-12-27 23:05:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-27 23:05:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-27 23:05:42,578 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-27 23:05:42,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:42,578 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-27 23:05:42,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:05:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-27 23:05:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:42,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:42,582 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:42,582 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:42,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:42,582 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-27 23:05:42,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:42,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493846866] [2019-12-27 23:05:42,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:42,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493846866] [2019-12-27 23:05:42,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:42,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:42,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [405621279] [2019-12-27 23:05:42,649 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:42,651 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:42,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:05:42,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:42,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:42,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:42,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:42,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:42,768 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 13 states. [2019-12-27 23:05:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:44,388 INFO L93 Difference]: Finished difference Result 34324 states and 127393 transitions. [2019-12-27 23:05:44,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 23:05:44,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:44,462 INFO L225 Difference]: With dead ends: 34324 [2019-12-27 23:05:44,463 INFO L226 Difference]: Without dead ends: 34289 [2019-12-27 23:05:44,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:05:44,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34289 states. [2019-12-27 23:05:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34289 to 8937. [2019-12-27 23:05:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-27 23:05:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-27 23:05:44,829 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-27 23:05:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:44,829 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-27 23:05:44,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-27 23:05:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:44,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:44,832 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:44,832 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-27 23:05:44,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:44,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998401564] [2019-12-27 23:05:44,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:44,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998401564] [2019-12-27 23:05:44,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:44,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:44,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1362166525] [2019-12-27 23:05:44,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:44,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:44,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:05:44,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:44,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:44,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:44,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:44,954 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 13 states. [2019-12-27 23:05:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:46,551 INFO L93 Difference]: Finished difference Result 33898 states and 125701 transitions. [2019-12-27 23:05:46,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 23:05:46,552 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:46,624 INFO L225 Difference]: With dead ends: 33898 [2019-12-27 23:05:46,624 INFO L226 Difference]: Without dead ends: 33868 [2019-12-27 23:05:46,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:05:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33868 states. [2019-12-27 23:05:46,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33868 to 8839. [2019-12-27 23:05:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-27 23:05:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-27 23:05:46,994 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-27 23:05:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:46,994 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-27 23:05:46,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-27 23:05:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:46,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:46,998 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:46,998 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:46,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-27 23:05:46,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:46,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145249926] [2019-12-27 23:05:46,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:05:47,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145249926] [2019-12-27 23:05:47,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:47,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:47,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1334908484] [2019-12-27 23:05:47,049 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:47,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:47,059 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:47,060 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:47,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:05:47,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:05:47,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:05:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:05:47,171 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 17 states. [2019-12-27 23:05:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:49,677 INFO L93 Difference]: Finished difference Result 34906 states and 127104 transitions. [2019-12-27 23:05:49,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 23:05:49,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:05:49,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:49,753 INFO L225 Difference]: With dead ends: 34906 [2019-12-27 23:05:49,753 INFO L226 Difference]: Without dead ends: 34871 [2019-12-27 23:05:49,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3074 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 23:05:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34871 states. [2019-12-27 23:05:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34871 to 8516. [2019-12-27 23:05:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 23:05:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 23:05:50,114 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 23:05:50,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:50,114 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 23:05:50,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:05:50,114 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 23:05:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:05:50,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:50,118 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:50,118 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:50,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:50,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-27 23:05:50,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:50,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270772888] [2019-12-27 23:05:50,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:05:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:05:50,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:05:50,134 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:05:50,134 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:05:50,134 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 23:05:50,152 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,152 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,152 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,152 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,153 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,153 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,153 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,153 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,153 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,153 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,153 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,154 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,155 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,155 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,161 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,161 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,162 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,162 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,162 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,163 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,164 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,165 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,166 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,167 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,168 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,169 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,170 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,171 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,172 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,173 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,173 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,174 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,174 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,174 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,174 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,176 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,176 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,177 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,177 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,178 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,178 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,179 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,179 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,179 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,179 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,179 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,180 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,180 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,180 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,182 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,183 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,183 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,183 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,183 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,184 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,187 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,187 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,187 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,188 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,188 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,189 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,189 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,189 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,189 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:50,190 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 23:05:50,190 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:05:50,190 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:05:50,190 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:05:50,190 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:05:50,190 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:05:50,191 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:05:50,191 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:05:50,191 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:05:50,192 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-27 23:05:50,192 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 23:05:50,217 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 23:05:50,217 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 23:05:50,221 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 23:05:50,230 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 23:05:50,253 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 23:05:50,253 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 23:05:50,257 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 23:05:50,266 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-27 23:05:50,267 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:05:52,172 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 23:05:52,319 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-27 23:05:52,319 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 23:05:52,319 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 23:05:53,611 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 23:05:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 23:05:53,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:05:53,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:53,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:05:53,612 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:53,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:53,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-27 23:05:53,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:53,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831204619] [2019-12-27 23:05:53,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:53,620 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-27 23:05:53,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831204619] [2019-12-27 23:05:53,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:53,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:05:53,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848580914] [2019-12-27 23:05:53,621 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:53,621 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:53,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:05:53,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:53,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:05:53,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:05:53,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:05:53,622 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 23:05:53,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:53,750 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 23:05:53,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:05:53,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:05:53,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:53,798 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 23:05:53,798 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 23:05:53,799 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-27 23:05:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 23:05:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 23:05:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 23:05:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 23:05:54,178 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 23:05:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:54,178 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 23:05:54,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:05:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 23:05:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:05:54,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:54,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:54,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:54,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:54,179 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-27 23:05:54,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:54,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547302435] [2019-12-27 23:05:54,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:54,205 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-27 23:05:54,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547302435] [2019-12-27 23:05:54,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:54,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:54,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985491251] [2019-12-27 23:05:54,206 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:54,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:54,207 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:05:54,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:54,208 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:54,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:54,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:54,208 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 23:05:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:55,882 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 23:05:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:55,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:05:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:55,978 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 23:05:55,978 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 23:05:55,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 23:05:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 23:05:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 23:05:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 23:05:56,565 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 23:05:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:56,565 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 23:05:56,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:05:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 23:05:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:05:56,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:56,566 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:56,566 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-27 23:05:56,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:56,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598369757] [2019-12-27 23:05:56,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:05:56,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598369757] [2019-12-27 23:05:56,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:56,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:56,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1029354773] [2019-12-27 23:05:56,589 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:56,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:56,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:05:56,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:56,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:56,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:56,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:56,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:56,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:56,592 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 23:05:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:56,838 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 23:05:56,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:56,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:05:56,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:56,941 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 23:05:56,941 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 23:05:56,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 23:05:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 23:05:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 23:05:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 23:05:57,615 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 23:05:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:57,615 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 23:05:57,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:05:57,615 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 23:05:57,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:05:57,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:57,616 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:57,616 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:05:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:57,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-27 23:05:57,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:57,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893840810] [2019-12-27 23:05:57,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:05:57,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893840810] [2019-12-27 23:05:57,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728337690] [2019-12-27 23:05:57,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:57,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:05:57,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:05:57,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:57,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:05:57,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1900028481] [2019-12-27 23:05:57,759 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:57,760 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:57,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:05:57,763 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:57,804 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:05:57,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:57,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:57,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:57,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:05:57,806 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 9 states. [2019-12-27 23:05:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:58,498 INFO L93 Difference]: Finished difference Result 58891 states and 273224 transitions. [2019-12-27 23:05:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:05:58,499 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 23:05:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:58,680 INFO L225 Difference]: With dead ends: 58891 [2019-12-27 23:05:58,680 INFO L226 Difference]: Without dead ends: 58886 [2019-12-27 23:05:58,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:05:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58886 states. [2019-12-27 23:06:00,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58886 to 22725. [2019-12-27 23:06:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 23:06:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 23:06:00,082 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 23:06:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:00,083 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 23:06:00,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:06:00,083 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 23:06:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:06:00,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:00,083 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:00,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:00,284 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-27 23:06:00,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:00,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588197173] [2019-12-27 23:06:00,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 23:06:00,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588197173] [2019-12-27 23:06:00,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:00,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:00,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1078896878] [2019-12-27 23:06:00,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:00,316 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:00,318 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:06:00,318 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:00,318 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:00,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:00,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:00,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:00,318 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 23:06:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:00,829 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 23:06:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:00,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:06:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:00,996 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 23:06:00,996 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 23:06:00,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:06:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 23:06:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 23:06:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 23:06:01,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 23:06:01,872 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 23:06:01,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:01,873 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 23:06:01,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:01,873 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 23:06:01,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:06:01,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:01,873 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:01,873 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:01,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:01,874 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-27 23:06:01,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:01,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321769434] [2019-12-27 23:06:01,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:01,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321769434] [2019-12-27 23:06:01,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:01,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:06:01,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757721984] [2019-12-27 23:06:01,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:01,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:01,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:06:01,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:01,896 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:01,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:06:01,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:06:01,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:06:01,897 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 23:06:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:02,197 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 23:06:02,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:06:02,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:06:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:02,317 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 23:06:02,318 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 23:06:02,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 23:06:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 23:06:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 23:06:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 23:06:05,298 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 23:06:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:05,298 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 23:06:05,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:06:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 23:06:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:05,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:05,299 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:05,300 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-27 23:06:05,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:05,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965938769] [2019-12-27 23:06:05,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 23:06:05,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965938769] [2019-12-27 23:06:05,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941784633] [2019-12-27 23:06:05,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:05,425 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:06:05,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 23:06:05,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:05,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:06:05,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [70943344] [2019-12-27 23:06:05,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:05,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:05,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 23:06:05,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:05,501 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:05,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:06:05,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:06:05,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:06:05,502 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 10 states. [2019-12-27 23:06:06,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:06,238 INFO L93 Difference]: Finished difference Result 69923 states and 329029 transitions. [2019-12-27 23:06:06,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:06:06,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 23:06:06,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:06,443 INFO L225 Difference]: With dead ends: 69923 [2019-12-27 23:06:06,443 INFO L226 Difference]: Without dead ends: 69914 [2019-12-27 23:06:06,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:06:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69914 states. [2019-12-27 23:06:07,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69914 to 27590. [2019-12-27 23:06:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 23:06:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 23:06:07,553 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 23:06:07,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:07,553 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 23:06:07,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:06:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 23:06:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:07,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:07,554 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:07,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:07,758 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:07,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:07,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-27 23:06:07,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:07,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403310442] [2019-12-27 23:06:07,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:07,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403310442] [2019-12-27 23:06:07,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:07,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:07,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750585619] [2019-12-27 23:06:07,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:07,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:07,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:06:07,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:07,794 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:07,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:07,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:07,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:07,794 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-27 23:06:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:08,352 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-27 23:06:08,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:08,352 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:06:08,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:08,546 INFO L225 Difference]: With dead ends: 66182 [2019-12-27 23:06:08,546 INFO L226 Difference]: Without dead ends: 66173 [2019-12-27 23:06:08,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:06:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-27 23:06:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-27 23:06:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-27 23:06:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-27 23:06:10,240 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-27 23:06:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:10,240 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-27 23:06:10,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-27 23:06:10,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:10,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:10,241 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:10,241 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:10,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-27 23:06:10,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:10,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695170891] [2019-12-27 23:06:10,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:10,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695170891] [2019-12-27 23:06:10,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:10,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:10,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554703935] [2019-12-27 23:06:10,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:10,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:10,280 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:06:10,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:10,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:10,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:10,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:10,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:10,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:10,281 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-27 23:06:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:10,841 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-27 23:06:10,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:10,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:06:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:11,043 INFO L225 Difference]: With dead ends: 66741 [2019-12-27 23:06:11,043 INFO L226 Difference]: Without dead ends: 66732 [2019-12-27 23:06:11,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:06:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-27 23:06:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-27 23:06:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-27 23:06:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-27 23:06:12,118 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-27 23:06:12,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:12,118 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-27 23:06:12,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:12,118 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-27 23:06:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:12,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:12,119 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:12,119 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:12,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-27 23:06:12,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:12,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653697341] [2019-12-27 23:06:12,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:12,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653697341] [2019-12-27 23:06:12,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:12,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:12,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1103236576] [2019-12-27 23:06:12,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:12,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:12,155 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 23:06:12,155 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:12,198 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:12,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:06:12,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:12,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:06:12,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:06:12,200 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 11 states. [2019-12-27 23:06:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:15,032 INFO L93 Difference]: Finished difference Result 76365 states and 356947 transitions. [2019-12-27 23:06:15,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:06:15,033 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 23:06:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:15,260 INFO L225 Difference]: With dead ends: 76365 [2019-12-27 23:06:15,260 INFO L226 Difference]: Without dead ends: 76352 [2019-12-27 23:06:15,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:06:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76352 states. [2019-12-27 23:06:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76352 to 28053. [2019-12-27 23:06:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 23:06:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 23:06:16,397 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 23:06:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:16,397 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 23:06:16,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:06:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 23:06:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:16,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:16,399 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:16,399 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:16,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-27 23:06:16,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:16,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472521292] [2019-12-27 23:06:16,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 23:06:16,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472521292] [2019-12-27 23:06:16,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38607035] [2019-12-27 23:06:16,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:16,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:06:16,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 23:06:16,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:16,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:06:16,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697552613] [2019-12-27 23:06:16,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:16,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:16,565 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:06:16,565 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:16,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:16,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:06:16,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:16,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:06:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:06:16,623 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 12 states. [2019-12-27 23:06:18,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:18,207 INFO L93 Difference]: Finished difference Result 105784 states and 469658 transitions. [2019-12-27 23:06:18,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:06:18,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 23:06:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:18,509 INFO L225 Difference]: With dead ends: 105784 [2019-12-27 23:06:18,509 INFO L226 Difference]: Without dead ends: 105777 [2019-12-27 23:06:18,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=631, Invalid=2021, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 23:06:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105777 states. [2019-12-27 23:06:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105777 to 27701. [2019-12-27 23:06:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-27 23:06:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-27 23:06:20,651 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-27 23:06:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:20,652 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-27 23:06:20,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:06:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-27 23:06:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:20,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:20,653 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:20,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:20,854 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:20,854 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-27 23:06:20,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:20,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385854064] [2019-12-27 23:06:20,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 23:06:20,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385854064] [2019-12-27 23:06:20,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580290929] [2019-12-27 23:06:20,900 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:20,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:06:20,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:06:20,991 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:06:20,992 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 23:06:21,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:21,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:06:21,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1790327557] [2019-12-27 23:06:21,006 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:21,007 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:21,012 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 23:06:21,012 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:21,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:06:21,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:06:21,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:21,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:06:21,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:06:21,107 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 16 states. [2019-12-27 23:06:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:23,340 INFO L93 Difference]: Finished difference Result 108381 states and 476214 transitions. [2019-12-27 23:06:23,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:06:23,341 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 23:06:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:24,355 INFO L225 Difference]: With dead ends: 108381 [2019-12-27 23:06:24,356 INFO L226 Difference]: Without dead ends: 108372 [2019-12-27 23:06:24,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1186, Invalid=3926, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 23:06:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108372 states. [2019-12-27 23:06:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108372 to 27343. [2019-12-27 23:06:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 23:06:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 23:06:25,764 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 23:06:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:25,764 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 23:06:25,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:06:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 23:06:25,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:25,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:25,765 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:25,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:25,966 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-27 23:06:25,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:25,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884423497] [2019-12-27 23:06:25,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:06:25,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884423497] [2019-12-27 23:06:25,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:25,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:06:25,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1159776962] [2019-12-27 23:06:25,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:25,991 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:25,993 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:06:25,993 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:25,993 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:25,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:06:25,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:06:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:06:25,994 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-27 23:06:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:26,350 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-27 23:06:26,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:06:26,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 23:06:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:26,501 INFO L225 Difference]: With dead ends: 49005 [2019-12-27 23:06:26,501 INFO L226 Difference]: Without dead ends: 48989 [2019-12-27 23:06:26,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:26,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-27 23:06:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-27 23:06:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-27 23:06:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-27 23:06:27,860 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-27 23:06:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:27,860 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-27 23:06:27,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:06:27,860 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-27 23:06:27,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:27,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:27,861 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:27,861 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-27 23:06:27,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:27,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128145894] [2019-12-27 23:06:27,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:27,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128145894] [2019-12-27 23:06:27,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:27,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:27,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803418380] [2019-12-27 23:06:27,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:27,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:27,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:06:27,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:27,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:27,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:06:27,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:27,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:06:27,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:06:27,927 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-27 23:06:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:29,045 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-27 23:06:29,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:06:29,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:06:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:29,375 INFO L225 Difference]: With dead ends: 112418 [2019-12-27 23:06:29,375 INFO L226 Difference]: Without dead ends: 112411 [2019-12-27 23:06:29,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:06:29,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-27 23:06:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-27 23:06:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-27 23:06:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-27 23:06:31,721 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-27 23:06:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:31,721 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-27 23:06:31,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:06:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-27 23:06:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:31,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:31,722 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:31,722 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:31,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-27 23:06:31,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:31,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559379839] [2019-12-27 23:06:31,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:31,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559379839] [2019-12-27 23:06:31,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:31,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:31,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [464407279] [2019-12-27 23:06:31,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:31,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:31,776 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:06:31,776 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:31,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:31,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:06:31,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:31,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:06:31,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:06:31,777 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-27 23:06:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:32,926 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-27 23:06:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:06:32,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:06:32,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:33,258 INFO L225 Difference]: With dead ends: 111816 [2019-12-27 23:06:33,258 INFO L226 Difference]: Without dead ends: 111807 [2019-12-27 23:06:33,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:06:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-27 23:06:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-27 23:06:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-27 23:06:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-27 23:06:35,572 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-27 23:06:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:35,572 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-27 23:06:35,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:06:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-27 23:06:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:35,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:35,573 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:35,573 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-27 23:06:35,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:35,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566854644] [2019-12-27 23:06:35,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:35,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566854644] [2019-12-27 23:06:35,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:35,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:35,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2009660941] [2019-12-27 23:06:35,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:35,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:35,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 23:06:35,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:35,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:35,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:06:35,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:35,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:06:35,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:06:35,661 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 13 states. [2019-12-27 23:06:37,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:37,897 INFO L93 Difference]: Finished difference Result 127187 states and 567692 transitions. [2019-12-27 23:06:37,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 23:06:37,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 23:06:37,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:38,273 INFO L225 Difference]: With dead ends: 127187 [2019-12-27 23:06:38,273 INFO L226 Difference]: Without dead ends: 127174 [2019-12-27 23:06:38,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:06:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127174 states. [2019-12-27 23:06:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127174 to 31950. [2019-12-27 23:06:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-27 23:06:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-27 23:06:40,671 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-27 23:06:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:40,672 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-27 23:06:40,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:06:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-27 23:06:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:40,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:40,673 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:40,673 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-27 23:06:40,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:40,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363200993] [2019-12-27 23:06:40,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 23:06:40,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363200993] [2019-12-27 23:06:40,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:40,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:40,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739266798] [2019-12-27 23:06:40,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:40,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:40,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:06:40,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:40,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:06:40,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:06:40,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:40,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:06:40,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:06:40,850 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 17 states. [2019-12-27 23:06:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:44,066 INFO L93 Difference]: Finished difference Result 131458 states and 578305 transitions. [2019-12-27 23:06:44,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 23:06:44,067 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 23:06:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:44,447 INFO L225 Difference]: With dead ends: 131458 [2019-12-27 23:06:44,447 INFO L226 Difference]: Without dead ends: 131442 [2019-12-27 23:06:44,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3232 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 23:06:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131442 states. [2019-12-27 23:06:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131442 to 30899. [2019-12-27 23:06:49,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 23:06:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 23:06:49,300 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 23:06:49,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:49,301 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 23:06:49,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:06:49,301 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 23:06:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:06:49,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:49,302 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:49,302 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-27 23:06:49,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:49,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54671643] [2019-12-27 23:06:49,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:06:49,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54671643] [2019-12-27 23:06:49,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344122394] [2019-12-27 23:06:49,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:49,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:06:49,427 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:06:49,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:49,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:06:49,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410984787] [2019-12-27 23:06:49,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:49,447 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:49,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 23:06:49,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:49,527 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:06:49,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:06:49,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:49,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:06:49,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:06:49,528 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 11 states. [2019-12-27 23:06:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:50,375 INFO L93 Difference]: Finished difference Result 79677 states and 379896 transitions. [2019-12-27 23:06:50,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:06:50,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 23:06:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:50,626 INFO L225 Difference]: With dead ends: 79677 [2019-12-27 23:06:50,626 INFO L226 Difference]: Without dead ends: 79658 [2019-12-27 23:06:50,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=447, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:06:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79658 states. [2019-12-27 23:06:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79658 to 31876. [2019-12-27 23:06:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 23:06:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 23:06:52,568 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 23:06:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:52,568 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 23:06:52,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:06:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 23:06:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:06:52,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:52,570 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:52,770 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:52,771 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-27 23:06:52,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:52,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845691444] [2019-12-27 23:06:52,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:06:52,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845691444] [2019-12-27 23:06:52,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625499625] [2019-12-27 23:06:52,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:52,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:06:52,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:06:52,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:52,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:06:52,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625040612] [2019-12-27 23:06:52,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:52,916 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:52,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 23:06:52,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:52,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:06:52,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:52,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:06:52,921 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-27 23:06:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:53,544 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-27 23:06:53,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:53,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:06:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:53,780 INFO L225 Difference]: With dead ends: 77025 [2019-12-27 23:06:53,780 INFO L226 Difference]: Without dead ends: 77011 [2019-12-27 23:06:53,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:06:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-27 23:06:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-27 23:06:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-27 23:06:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-27 23:06:58,217 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-27 23:06:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:58,217 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-27 23:06:58,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:58,217 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-27 23:06:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:06:58,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:58,219 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:58,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:58,420 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:06:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-27 23:06:58,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:58,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78988474] [2019-12-27 23:06:58,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:06:58,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78988474] [2019-12-27 23:06:58,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:58,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:58,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340885890] [2019-12-27 23:06:58,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:58,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:58,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:06:58,459 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:58,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:58,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:58,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:58,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:58,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:58,460 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-27 23:06:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:59,087 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-27 23:06:59,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:59,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:06:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:59,329 INFO L225 Difference]: With dead ends: 78384 [2019-12-27 23:06:59,329 INFO L226 Difference]: Without dead ends: 78365 [2019-12-27 23:06:59,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:06:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-27 23:07:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-27 23:07:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-27 23:07:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-27 23:07:00,583 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-27 23:07:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:00,583 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-27 23:07:00,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:07:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-27 23:07:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:07:00,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:00,586 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:00,587 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-27 23:07:00,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:00,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780704856] [2019-12-27 23:07:00,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:07:00,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780704856] [2019-12-27 23:07:00,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:00,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:07:00,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071362840] [2019-12-27 23:07:00,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:00,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:00,628 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:07:00,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:00,629 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:07:00,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:07:00,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:07:00,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:07:00,629 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-27 23:07:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:01,627 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-27 23:07:01,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:07:01,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:07:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:01,870 INFO L225 Difference]: With dead ends: 78506 [2019-12-27 23:07:01,870 INFO L226 Difference]: Without dead ends: 78487 [2019-12-27 23:07:01,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:02,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-27 23:07:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-27 23:07:03,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-27 23:07:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-27 23:07:03,140 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-27 23:07:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:03,141 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-27 23:07:03,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:07:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-27 23:07:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:07:03,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:03,143 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:03,143 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:03,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-27 23:07:03,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:03,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144774773] [2019-12-27 23:07:03,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:07:03,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144774773] [2019-12-27 23:07:03,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:03,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:07:03,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [583284866] [2019-12-27 23:07:03,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:03,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:03,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:07:03,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:03,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:07:03,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:07:03,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:07:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:07:03,180 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-27 23:07:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:04,331 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-27 23:07:04,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:07:04,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:07:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:04,595 INFO L225 Difference]: With dead ends: 80886 [2019-12-27 23:07:04,596 INFO L226 Difference]: Without dead ends: 80867 [2019-12-27 23:07:04,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-27 23:07:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-27 23:07:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-27 23:07:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-27 23:07:05,917 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-27 23:07:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:05,917 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-27 23:07:05,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:07:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-27 23:07:05,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:07:05,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:05,920 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:05,920 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:05,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-27 23:07:05,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:05,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355978029] [2019-12-27 23:07:05,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:07:05,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355978029] [2019-12-27 23:07:05,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:05,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:07:05,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [222731303] [2019-12-27 23:07:05,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:05,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:05,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 23:07:05,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:06,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:07:06,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:06,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:06,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:06,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:07:06,042 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 13 states. [2019-12-27 23:07:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:07,597 INFO L93 Difference]: Finished difference Result 93460 states and 441982 transitions. [2019-12-27 23:07:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:07:07,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 23:07:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:07,897 INFO L225 Difference]: With dead ends: 93460 [2019-12-27 23:07:07,898 INFO L226 Difference]: Without dead ends: 93431 [2019-12-27 23:07:07,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=742, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:07:08,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93431 states. [2019-12-27 23:07:09,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93431 to 35912. [2019-12-27 23:07:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 23:07:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 23:07:09,306 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 23:07:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:09,306 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 23:07:09,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 23:07:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:09,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:09,309 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:09,309 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:09,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-27 23:07:09,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:09,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436635647] [2019-12-27 23:07:09,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:09,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436635647] [2019-12-27 23:07:09,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142590923] [2019-12-27 23:07:09,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:09,500 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:09,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:09,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:09,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:09,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826072418] [2019-12-27 23:07:09,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:09,532 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:09,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 23:07:09,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:09,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:07:09,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:07:09,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:07:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:07:09,675 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 17 states. [2019-12-27 23:07:12,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:12,322 INFO L93 Difference]: Finished difference Result 135566 states and 606990 transitions. [2019-12-27 23:07:12,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:07:12,323 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:07:12,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:12,710 INFO L225 Difference]: With dead ends: 135566 [2019-12-27 23:07:12,710 INFO L226 Difference]: Without dead ends: 135548 [2019-12-27 23:07:12,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1227, Invalid=4029, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 23:07:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135548 states. [2019-12-27 23:07:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135548 to 35598. [2019-12-27 23:07:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-27 23:07:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-27 23:07:17,823 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-27 23:07:17,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:17,823 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-27 23:07:17,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:07:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-27 23:07:17,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:17,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:17,827 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:18,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:18,028 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-27 23:07:18,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:18,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288039257] [2019-12-27 23:07:18,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:18,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288039257] [2019-12-27 23:07:18,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243974116] [2019-12-27 23:07:18,077 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:18,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:07:18,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:18,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:18,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:18,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:18,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:18,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1611473581] [2019-12-27 23:07:18,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:18,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:18,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:07:18,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:18,292 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:07:18,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:18,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:18,293 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 13 states. [2019-12-27 23:07:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:20,419 INFO L93 Difference]: Finished difference Result 129234 states and 584373 transitions. [2019-12-27 23:07:20,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:07:20,419 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:07:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:20,793 INFO L225 Difference]: With dead ends: 129234 [2019-12-27 23:07:20,793 INFO L226 Difference]: Without dead ends: 129215 [2019-12-27 23:07:20,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=665, Invalid=2091, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 23:07:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129215 states. [2019-12-27 23:07:23,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129215 to 35531. [2019-12-27 23:07:23,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 23:07:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-27 23:07:23,337 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-27 23:07:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:23,337 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-27 23:07:23,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-27 23:07:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:23,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:23,341 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:23,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:23,542 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:23,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:23,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-27 23:07:23,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:23,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880778770] [2019-12-27 23:07:23,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:23,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880778770] [2019-12-27 23:07:23,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644002234] [2019-12-27 23:07:23,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:23,688 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:23,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:23,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:23,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:23,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111313545] [2019-12-27 23:07:23,705 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:23,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:23,716 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:07:23,716 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:23,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:07:23,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:23,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:23,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:23,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:23,792 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 13 states. [2019-12-27 23:07:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:25,555 INFO L93 Difference]: Finished difference Result 128198 states and 579481 transitions. [2019-12-27 23:07:25,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:07:25,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:07:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:26,829 INFO L225 Difference]: With dead ends: 128198 [2019-12-27 23:07:26,829 INFO L226 Difference]: Without dead ends: 128180 [2019-12-27 23:07:26,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=665, Invalid=2091, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 23:07:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128180 states. [2019-12-27 23:07:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128180 to 35223. [2019-12-27 23:07:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-27 23:07:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-27 23:07:28,567 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-27 23:07:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:28,568 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-27 23:07:28,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-27 23:07:28,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:28,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:28,571 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:28,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:28,771 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:28,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-27 23:07:28,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:28,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209739949] [2019-12-27 23:07:28,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:28,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:28,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209739949] [2019-12-27 23:07:28,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224776191] [2019-12-27 23:07:28,819 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:28,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:07:28,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:28,913 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:28,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:28,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:28,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:28,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [786585527] [2019-12-27 23:07:28,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:28,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:28,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 23:07:28,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:29,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 23:07:29,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:07:29,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:29,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:07:29,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:07:29,140 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 19 states. [2019-12-27 23:07:32,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:32,075 INFO L93 Difference]: Finished difference Result 132194 states and 590498 transitions. [2019-12-27 23:07:32,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:07:32,075 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 23:07:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:32,464 INFO L225 Difference]: With dead ends: 132194 [2019-12-27 23:07:32,464 INFO L226 Difference]: Without dead ends: 132175 [2019-12-27 23:07:32,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1330, Invalid=4220, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 23:07:32,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132175 states. [2019-12-27 23:07:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132175 to 34934. [2019-12-27 23:07:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 23:07:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 23:07:37,450 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 23:07:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:37,450 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 23:07:37,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:07:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 23:07:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:37,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:37,453 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:37,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:37,654 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:37,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:37,654 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-27 23:07:37,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:37,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584809448] [2019-12-27 23:07:37,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:37,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584809448] [2019-12-27 23:07:37,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454695502] [2019-12-27 23:07:37,699 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:37,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:07:37,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:37,787 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:37,788 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:37,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:37,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:37,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672915886] [2019-12-27 23:07:37,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:37,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:37,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:07:37,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:37,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:07:37,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:07:37,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:37,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:07:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:07:37,840 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 11 states. [2019-12-27 23:07:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:39,420 INFO L93 Difference]: Finished difference Result 126084 states and 571437 transitions. [2019-12-27 23:07:39,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:07:39,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 23:07:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:39,782 INFO L225 Difference]: With dead ends: 126084 [2019-12-27 23:07:39,783 INFO L226 Difference]: Without dead ends: 126070 [2019-12-27 23:07:39,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 23:07:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126070 states. [2019-12-27 23:07:42,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126070 to 34396. [2019-12-27 23:07:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-27 23:07:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-27 23:07:42,344 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-27 23:07:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:42,344 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-27 23:07:42,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:07:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-27 23:07:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:42,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:42,346 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:42,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:42,547 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-27 23:07:42,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:42,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913249811] [2019-12-27 23:07:42,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:42,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:42,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913249811] [2019-12-27 23:07:42,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663340474] [2019-12-27 23:07:42,617 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:42,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:07:42,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:42,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:42,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:42,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:42,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:42,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188723916] [2019-12-27 23:07:42,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:42,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:42,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:07:42,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:42,786 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:07:42,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:07:42,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:42,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:07:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:07:42,787 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-27 23:07:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:43,949 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-27 23:07:43,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:07:43,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:07:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:45,171 INFO L225 Difference]: With dead ends: 117673 [2019-12-27 23:07:45,172 INFO L226 Difference]: Without dead ends: 117662 [2019-12-27 23:07:45,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:07:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-27 23:07:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-27 23:07:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-27 23:07:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-27 23:07:46,727 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-27 23:07:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:46,727 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-27 23:07:46,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:07:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-27 23:07:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:46,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:46,730 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:46,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:46,931 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:46,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:46,931 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-27 23:07:46,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:46,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673466321] [2019-12-27 23:07:46,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:46,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673466321] [2019-12-27 23:07:46,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157880548] [2019-12-27 23:07:46,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:47,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:47,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:47,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:47,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:47,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [327724128] [2019-12-27 23:07:47,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:47,108 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:47,114 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:07:47,114 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:47,115 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:07:47,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:07:47,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:47,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:07:47,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:07:47,116 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-27 23:07:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:48,797 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-27 23:07:48,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:07:48,798 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:07:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:49,157 INFO L225 Difference]: With dead ends: 117232 [2019-12-27 23:07:49,157 INFO L226 Difference]: Without dead ends: 117222 [2019-12-27 23:07:49,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:07:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-27 23:07:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-27 23:07:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-27 23:07:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-27 23:07:50,786 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-27 23:07:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:50,786 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-27 23:07:50,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:07:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-27 23:07:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:50,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:50,789 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:50,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:50,989 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-27 23:07:50,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:50,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534522187] [2019-12-27 23:07:50,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:51,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534522187] [2019-12-27 23:07:51,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807664405] [2019-12-27 23:07:51,040 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:51,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:07:51,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:51,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:51,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 23:07:51,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:51,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:51,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1467870616] [2019-12-27 23:07:51,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:51,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:51,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:07:51,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:51,207 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 23:07:51,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:51,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:51,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:51,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:51,209 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 13 states. [2019-12-27 23:07:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:53,621 INFO L93 Difference]: Finished difference Result 130450 states and 586382 transitions. [2019-12-27 23:07:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 23:07:53,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:07:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:54,007 INFO L225 Difference]: With dead ends: 130450 [2019-12-27 23:07:54,008 INFO L226 Difference]: Without dead ends: 130431 [2019-12-27 23:07:54,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 23:07:54,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130431 states. [2019-12-27 23:07:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130431 to 33768. [2019-12-27 23:07:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 23:07:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-27 23:07:58,790 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-27 23:07:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:58,790 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-27 23:07:58,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-27 23:07:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:58,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:58,793 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:07:58,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:58,997 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:07:58,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:58,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-27 23:07:58,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:58,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904952919] [2019-12-27 23:07:58,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:59,020 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 23:07:59,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904952919] [2019-12-27 23:07:59,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:59,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:07:59,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1846089017] [2019-12-27 23:07:59,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:59,023 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:59,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:07:59,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:59,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:07:59,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:07:59,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:59,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:07:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:07:59,026 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-27 23:07:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:59,414 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-27 23:07:59,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:07:59,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 23:07:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:59,604 INFO L225 Difference]: With dead ends: 59584 [2019-12-27 23:07:59,604 INFO L226 Difference]: Without dead ends: 59552 [2019-12-27 23:07:59,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:07:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-27 23:08:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-27 23:08:00,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-27 23:08:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-27 23:08:01,616 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-27 23:08:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:01,616 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-27 23:08:01,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:08:01,616 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-27 23:08:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:08:01,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:01,619 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:08:01,619 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-27 23:08:01,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:01,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620420283] [2019-12-27 23:08:01,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:08:01,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620420283] [2019-12-27 23:08:01,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:01,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:08:01,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [662376190] [2019-12-27 23:08:01,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:01,666 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:01,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:08:01,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:01,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:01,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:08:01,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:01,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:08:01,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:08:01,671 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-27 23:08:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:02,961 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-27 23:08:02,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:08:02,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:08:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:03,370 INFO L225 Difference]: With dead ends: 137478 [2019-12-27 23:08:03,371 INFO L226 Difference]: Without dead ends: 137462 [2019-12-27 23:08:03,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:08:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-27 23:08:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-27 23:08:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-27 23:08:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-27 23:08:09,081 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-27 23:08:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:09,081 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-27 23:08:09,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:08:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-27 23:08:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:08:09,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:09,084 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:08:09,084 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:08:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-27 23:08:09,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:09,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499039683] [2019-12-27 23:08:09,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 23:08:09,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499039683] [2019-12-27 23:08:09,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:09,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:08:09,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318864583] [2019-12-27 23:08:09,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:09,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:09,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:08:09,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:09,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:09,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:08:09,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:09,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:08:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:08:09,149 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. Received shutdown request... [2019-12-27 23:08:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:08:10,259 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:08:10,263 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:08:10,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:08:10 BasicIcfg [2019-12-27 23:08:10,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:08:10,264 INFO L168 Benchmark]: Toolchain (without parser) took 226830.73 ms. Allocated memory was 137.9 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 99.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 23:08:10,265 INFO L168 Benchmark]: CDTParser took 0.20 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-27 23:08:10,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.60 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 160.6 MB in the end (delta: -60.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:10,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.13 ms. Allocated memory is still 202.4 MB. Free memory was 160.6 MB in the beginning and 158.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:10,265 INFO L168 Benchmark]: Boogie Preprocessor took 24.44 ms. Allocated memory is still 202.4 MB. Free memory was 158.6 MB in the beginning and 157.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:10,266 INFO L168 Benchmark]: RCFGBuilder took 443.39 ms. Allocated memory is still 202.4 MB. Free memory was 157.2 MB in the beginning and 138.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:10,266 INFO L168 Benchmark]: TraceAbstraction took 225576.10 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 137.8 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 23:08:10,267 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.20 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 702.60 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.7 MB in the beginning and 160.6 MB in the end (delta: -60.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.13 ms. Allocated memory is still 202.4 MB. Free memory was 160.6 MB in the beginning and 158.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.44 ms. Allocated memory is still 202.4 MB. Free memory was 158.6 MB in the beginning and 157.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 443.39 ms. Allocated memory is still 202.4 MB. Free memory was 157.2 MB in the beginning and 138.5 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225576.10 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 137.8 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 15 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 366 VarBasedMoverChecksPositive, 5 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 615 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 97 ProgramPointsBefore, 34 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1107 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 139 ProgramPointsBefore, 50 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 160 ProgramPointsBefore, 58 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1765 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4276 CheckedPairsTotal, 117 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (41717states) and FLOYD_HOARE automaton (currently 29 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (108042 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 140.0s, OverallIterations: 34, TraceHistogramMax: 5, AutomataDifference: 56.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2544 SDtfs, 9769 SDslu, 8620 SDs, 0 SdLazy, 13204 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1467 GetRequests, 382 SyntacticMatches, 17 SemanticMatches, 1068 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15876 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42643occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 72.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 1939713 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1030 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 982 ConstructedInterpolants, 0 QuantifiedInterpolants, 63276 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 48 InterpolantComputations, 20 PerfectInterpolantSequences, 444/638 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