/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:04:26,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:04:26,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:04:26,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:04:26,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:04:26,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:04:26,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:04:26,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:04:26,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:04:26,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:04:26,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:04:26,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:04:26,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:04:26,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:04:26,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:04:26,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:04:26,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:04:26,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:04:26,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:04:26,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:04:26,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:04:26,202 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:04:26,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:04:26,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:04:26,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:04:26,208 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:04:26,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:04:26,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:04:26,211 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:04:26,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:04:26,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:04:26,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:04:26,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:04:26,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:04:26,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:04:26,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:04:26,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:04:26,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:04:26,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:04:26,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:04:26,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:04:26,220 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:26,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:04:26,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:04:26,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:04:26,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:04:26,238 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:04:26,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:04:26,239 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:04:26,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:04:26,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:04:26,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:04:26,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:04:26,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:04:26,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:04:26,241 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:04:26,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:04:26,241 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:04:26,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:04:26,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:04:26,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:04:26,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:04:26,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:04:26,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:04:26,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:04:26,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:04:26,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:04:26,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:04:26,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:04:26,244 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:04:26,245 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:04:26,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:04:26,246 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:04:26,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:04:26,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:04:26,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:04:26,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:04:26,556 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:04:26,557 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:04:26,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-27 23:04:26,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4048687f2/a4037074f2ef4e3b863a7c181289be74/FLAG9912c456a [2019-12-27 23:04:27,166 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:04:27,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-27 23:04:27,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4048687f2/a4037074f2ef4e3b863a7c181289be74/FLAG9912c456a [2019-12-27 23:04:27,463 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4048687f2/a4037074f2ef4e3b863a7c181289be74 [2019-12-27 23:04:27,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:04:27,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:04:27,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:04:27,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:04:27,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:04:27,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:04:27" (1/1) ... [2019-12-27 23:04:27,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53be6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:27, skipping insertion in model container [2019-12-27 23:04:27,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:04:27" (1/1) ... [2019-12-27 23:04:27,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:04:27,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:04:27,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:04:28,007 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:04:28,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:04:28,146 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:04:28,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:28 WrapperNode [2019-12-27 23:04:28,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:04:28,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:04:28,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:04:28,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:04:28,157 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:28" (1/1) ... [2019-12-27 23:04:28,173 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:28" (1/1) ... [2019-12-27 23:04:28,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:04:28,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:04:28,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:04:28,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:04:28,200 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:28" (1/1) ... [2019-12-27 23:04:28,200 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:28" (1/1) ... [2019-12-27 23:04:28,203 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:28" (1/1) ... [2019-12-27 23:04:28,203 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:28" (1/1) ... [2019-12-27 23:04:28,208 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:28" (1/1) ... [2019-12-27 23:04:28,212 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:28" (1/1) ... [2019-12-27 23:04:28,214 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:28" (1/1) ... [2019-12-27 23:04:28,218 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:04:28,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:04:28,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:04:28,219 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:04:28,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:28" (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:28,282 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 23:04:28,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 23:04:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 23:04:28,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 23:04:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:04:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:04:28,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:04:28,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:04:28,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:04:28,285 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:28,626 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:04:28,627 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 23:04:28,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:04:28 BoogieIcfgContainer [2019-12-27 23:04:28,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:04:28,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:04:28,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:04:28,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:04:28,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:04:27" (1/3) ... [2019-12-27 23:04:28,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3c6997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:04:28, skipping insertion in model container [2019-12-27 23:04:28,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:04:28" (2/3) ... [2019-12-27 23:04:28,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3c6997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:04:28, skipping insertion in model container [2019-12-27 23:04:28,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:04:28" (3/3) ... [2019-12-27 23:04:28,636 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-2.i [2019-12-27 23:04:28,647 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:04:28,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:04:28,654 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:04:28,655 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:04:28,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,682 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,682 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,683 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,684 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,684 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,685 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,686 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,686 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,687 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:28,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,687 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:28,687 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,688 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,688 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,688 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,692 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,692 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,693 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,693 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,693 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,702 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:28,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:28,718 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 23:04:28,735 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:28,735 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:28,735 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:28,735 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:28,735 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:28,735 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:28,736 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:28,736 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:28,748 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-27 23:04:28,750 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 23:04:28,800 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 23:04:28,800 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:04:28,812 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:28,818 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 23:04:28,840 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 23:04:28,840 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:04:28,842 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:28,844 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-27 23:04:28,845 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:30,044 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 23:04:30,186 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-27 23:04:30,187 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-27 23:04:30,191 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 23:04:30,199 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 23:04:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 23:04:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:30,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:30,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:30,209 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:30,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:30,215 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-27 23:04:30,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:30,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471064259] [2019-12-27 23:04:30,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:30,385 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,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471064259] [2019-12-27 23:04:30,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:30,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:30,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444603883] [2019-12-27 23:04:30,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:30,394 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:30,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:30,408 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:30,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:30,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:30,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:30,431 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 23:04:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:30,452 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 23:04:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:30,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:30,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:30,480 INFO L225 Difference]: With dead ends: 35 [2019-12-27 23:04:30,480 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 23:04:30,484 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,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 23:04:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 23:04:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 23:04:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 23:04:30,535 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 23:04:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:30,536 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 23:04:30,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 23:04:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 23:04:30,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:30,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:30,538 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:30,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-27 23:04:30,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:30,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556567134] [2019-12-27 23:04:30,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:30,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556567134] [2019-12-27 23:04:30,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:30,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:04:30,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1624088505] [2019-12-27 23:04:30,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:30,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:30,676 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 23:04:30,676 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:30,677 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:30,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:04:30,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:30,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:04:30,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:04:30,679 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 23:04:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:30,702 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 23:04:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:04:30,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 23:04:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:30,703 INFO L225 Difference]: With dead ends: 26 [2019-12-27 23:04:30,704 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 23:04:30,704 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:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 23:04:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 23:04:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 23:04:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 23:04:30,711 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 23:04:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:30,712 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 23:04:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:04:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 23:04:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 23:04:30,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:30,713 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:30,713 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 23:04:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:30,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-27 23:04:30,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:30,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055381987] [2019-12-27 23:04:30,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:30,817 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:30,818 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:30,818 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:30,818 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 23:04:30,826 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,827 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,827 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,827 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,827 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,827 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,828 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,828 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,828 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,828 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,828 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,829 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,829 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,829 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,829 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,829 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,829 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,830 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,830 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,830 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,831 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,831 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,831 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:30,831 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,831 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:30,831 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,832 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,832 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,832 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,832 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,833 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,833 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,833 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,833 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,834 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:30,834 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,834 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:30,834 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,834 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,835 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,835 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,835 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,835 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,836 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,836 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,836 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,836 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,838 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,838 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,841 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,841 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,842 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,842 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,842 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:30,845 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,845 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,845 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,846 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,846 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:30,846 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:30,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:04:30,847 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:30,847 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:30,847 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:30,847 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:30,847 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:30,848 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:30,848 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:30,848 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:30,851 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 23:04:30,851 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 23:04:30,874 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 23:04:30,875 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 23:04:30,877 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:30,881 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 23:04:30,900 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 23:04:30,901 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 23:04:30,903 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:30,907 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-27 23:04:30,907 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:31,934 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 23:04:32,199 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-27 23:04:32,200 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-27 23:04:32,200 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 23:04:32,211 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 23:04:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 23:04:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:32,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:32,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:32,212 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:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:32,213 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-27 23:04:32,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:32,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307745894] [2019-12-27 23:04:32,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:32,255 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:32,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307745894] [2019-12-27 23:04:32,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:32,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:32,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [128863729] [2019-12-27 23:04:32,257 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:32,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:32,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:32,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:32,258 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:32,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:32,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:32,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:32,259 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 23:04:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:32,294 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 23:04:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:32,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:32,299 INFO L225 Difference]: With dead ends: 185 [2019-12-27 23:04:32,299 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 23:04:32,299 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:32,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 23:04:32,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 23:04:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 23:04:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 23:04:32,327 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 23:04:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:32,328 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 23:04:32,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 23:04:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:32,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:32,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:32,329 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:32,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:32,329 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-27 23:04:32,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:32,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629424678] [2019-12-27 23:04:32,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:32,383 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:32,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629424678] [2019-12-27 23:04:32,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:32,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:32,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701224296] [2019-12-27 23:04:32,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:32,385 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:32,387 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:32,388 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:32,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:32,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:32,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:32,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:32,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:32,389 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 23:04:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:32,455 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 23:04:32,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:32,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:32,462 INFO L225 Difference]: With dead ends: 204 [2019-12-27 23:04:32,462 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 23:04:32,463 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,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 23:04:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 23:04:32,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 23:04:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 23:04:32,501 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 23:04:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:32,501 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 23:04:32,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 23:04:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:32,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:32,504 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:32,504 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:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-27 23:04:32,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:32,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342828005] [2019-12-27 23:04:32,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:32,578 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:32,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342828005] [2019-12-27 23:04:32,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:32,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:32,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1032190698] [2019-12-27 23:04:32,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:32,581 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:32,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:32,583 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:32,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:32,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:32,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:32,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:32,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:32,584 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 23:04:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:32,661 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 23:04:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:32,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:32,664 INFO L225 Difference]: With dead ends: 189 [2019-12-27 23:04:32,664 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 23:04:32,665 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,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 23:04:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 23:04:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 23:04:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 23:04:32,676 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 23:04:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:32,678 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 23:04:32,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 23:04:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:04:32,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:32,680 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:32,680 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:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-27 23:04:32,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:32,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083031964] [2019-12-27 23:04:32,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:32,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:32,711 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:32,711 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:32,711 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 23:04:32,721 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,721 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,721 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,722 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,722 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,722 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,722 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,722 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,722 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,723 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,723 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,724 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,724 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,724 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,724 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,724 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,725 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,726 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,726 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,726 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,726 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,726 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,727 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:32,727 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,727 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:32,727 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,727 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,727 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,728 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,728 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,728 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,728 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,729 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:32,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,729 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:32,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,730 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,730 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,730 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,730 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,731 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,731 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,731 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,731 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:32,731 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,731 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:32,732 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,732 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,732 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,732 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,732 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,733 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,733 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,733 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,733 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,733 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,735 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,735 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,735 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,736 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,736 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,738 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,738 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,738 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,739 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,739 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,740 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,741 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,741 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:32,741 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,741 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,742 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,743 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,744 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,744 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,744 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:32,744 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,745 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,747 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:32,747 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,747 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:32,749 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 23:04:32,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:32,749 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:32,749 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:32,749 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:32,749 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:32,750 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:32,750 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:32,750 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:32,752 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-27 23:04:32,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 23:04:32,773 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 23:04:32,773 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 23:04:32,775 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:32,780 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 23:04:32,797 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 23:04:32,797 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 23:04:32,799 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:32,803 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-27 23:04:32,803 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:34,235 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 23:04:34,299 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-27 23:04:34,299 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-27 23:04:34,299 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 23:04:34,324 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 23:04:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 23:04:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:34,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:34,325 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:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-27 23:04:34,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774420612] [2019-12-27 23:04:34,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,353 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,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774420612] [2019-12-27 23:04:34,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:34,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:34,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [814987887] [2019-12-27 23:04:34,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:34,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:34,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:34,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:34,355 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:34,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:34,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:34,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:34,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:34,357 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 23:04:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:34,396 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 23:04:34,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:34,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:34,402 INFO L225 Difference]: With dead ends: 600 [2019-12-27 23:04:34,403 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 23:04:34,403 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,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 23:04:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 23:04:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 23:04:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 23:04:34,434 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 23:04:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:34,434 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 23:04:34,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 23:04:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:34,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,435 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:34,435 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:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-27 23:04:34,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971846416] [2019-12-27 23:04:34,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:04:34,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971846416] [2019-12-27 23:04:34,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:34,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:34,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632921350] [2019-12-27 23:04:34,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:34,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:34,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:34,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:34,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:34,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:34,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:34,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:34,472 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 23:04:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:34,566 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 23:04:34,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:34,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:34,573 INFO L225 Difference]: With dead ends: 802 [2019-12-27 23:04:34,574 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 23:04:34,574 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,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 23:04:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 23:04:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 23:04:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 23:04:34,603 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 23:04:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:34,603 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 23:04:34,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 23:04:34,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:34,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,610 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:34,610 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:34,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,611 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-27 23:04:34,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190241924] [2019-12-27 23:04:34,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,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:34,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190241924] [2019-12-27 23:04:34,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:34,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:34,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821170925] [2019-12-27 23:04:34,670 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:34,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:34,673 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:34,673 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:34,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:34,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:34,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:34,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:34,677 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 23:04:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:34,751 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 23:04:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:34,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:34,759 INFO L225 Difference]: With dead ends: 832 [2019-12-27 23:04:34,759 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 23:04:34,760 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,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 23:04:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 23:04:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 23:04:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 23:04:34,784 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 23:04:34,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:34,785 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 23:04:34,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 23:04:34,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:34,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:34,787 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,787 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:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:34,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-27 23:04:34,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:34,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970821851] [2019-12-27 23:04:34,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,884 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,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970821851] [2019-12-27 23:04:34,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188581097] [2019-12-27 23:04:34,885 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:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:34,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:34,961 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:34,993 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,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:34,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:04:34,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1168352082] [2019-12-27 23:04:34,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:34,997 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:35,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:04:35,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:35,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:35,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:35,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:35,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:35,003 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 7 states. [2019-12-27 23:04:35,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:35,185 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 23:04:35,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:35,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:35,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:35,193 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 23:04:35,193 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 23:04:35,194 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:35,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 23:04:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 23:04:35,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 23:04:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 23:04:35,219 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 23:04:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:35,220 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 23:04:35,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 23:04:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:35,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:35,221 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,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:35,425 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:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-27 23:04:35,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:35,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321906795] [2019-12-27 23:04:35,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:35,492 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,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321906795] [2019-12-27 23:04:35,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:35,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:35,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1957562483] [2019-12-27 23:04:35,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:35,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:35,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:04:35,498 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:35,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:35,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:35,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:35,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:35,499 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 23:04:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:35,719 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 23:04:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:35,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:35,726 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 23:04:35,726 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 23:04:35,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 23:04:35,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 23:04:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 23:04:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 23:04:35,751 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 23:04:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:35,752 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 23:04:35,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 23:04:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:04:35,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:35,753 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:35,753 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:35,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-27 23:04:35,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:35,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994378852] [2019-12-27 23:04:35,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:35,792 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:35,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994378852] [2019-12-27 23:04:35,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:35,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:35,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [223140648] [2019-12-27 23:04:35,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:35,795 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:35,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:04:35,797 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:35,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:35,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:35,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:35,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:35,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:35,799 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 23:04:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:35,868 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 23:04:35,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:35,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:04:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:35,874 INFO L225 Difference]: With dead ends: 736 [2019-12-27 23:04:35,874 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 23:04:35,875 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:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 23:04:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 23:04:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 23:04:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 23:04:35,895 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 23:04:35,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:35,895 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 23:04:35,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 23:04:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 23:04:35,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:35,897 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:35,897 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:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-27 23:04:35,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:35,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849192043] [2019-12-27 23:04:35,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:35,939 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:35,940 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:35,940 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:35,940 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 23:04:35,956 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,956 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,956 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,956 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,957 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,957 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,957 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,957 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,958 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,958 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,958 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,958 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,959 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,959 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,960 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,961 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,961 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,962 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,962 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,962 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,962 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,962 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,962 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,962 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,963 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,963 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,964 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,964 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:35,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,964 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:35,965 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,965 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,965 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,965 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,965 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,965 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,966 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,966 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,966 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,966 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:35,966 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,966 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:35,966 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,966 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,967 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,967 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,967 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,967 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,967 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,967 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,968 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,968 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:35,968 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,968 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:35,969 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,969 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,969 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,969 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,969 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,969 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,970 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,970 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:35,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,970 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:35,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,971 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,971 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,971 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,971 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,972 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,972 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,972 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,972 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,972 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,974 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,975 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,976 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,976 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,979 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,982 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:35,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,983 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,983 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:35,987 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:36,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,000 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:36,000 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,000 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,005 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:36,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,006 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:36,007 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 23:04:36,008 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:36,008 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:36,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:36,008 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:36,008 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:36,008 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:36,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:36,009 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:36,010 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-27 23:04:36,010 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 23:04:36,030 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 23:04:36,031 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 23:04:36,033 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:36,038 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 23:04:36,077 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 23:04:36,077 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 23:04:36,080 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:36,086 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-27 23:04:36,087 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:37,541 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:37,880 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-27 23:04:37,880 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-27 23:04:37,880 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 23:04:37,991 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 23:04:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 23:04:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:37,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:37,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:37,992 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:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-27 23:04:37,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:37,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573176336] [2019-12-27 23:04:37,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:38,011 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:38,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573176336] [2019-12-27 23:04:38,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:38,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:38,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [835646571] [2019-12-27 23:04:38,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:38,016 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:38,016 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:38,016 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:38,017 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:38,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:38,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:38,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:38,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:38,018 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 23:04:38,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:38,058 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 23:04:38,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:38,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:38,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:38,075 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 23:04:38,076 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 23:04:38,076 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:38,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 23:04:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 23:04:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 23:04:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 23:04:38,143 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 23:04:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:38,143 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 23:04:38,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 23:04:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:38,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:38,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:38,144 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:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-27 23:04:38,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:38,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873795963] [2019-12-27 23:04:38,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:38,203 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:38,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873795963] [2019-12-27 23:04:38,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:38,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:38,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198027749] [2019-12-27 23:04:38,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:38,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:38,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:38,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:38,206 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:38,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:38,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:38,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:38,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:38,207 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 23:04:38,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:38,287 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 23:04:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:38,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:38,310 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 23:04:38,310 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 23:04:38,310 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:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 23:04:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 23:04:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 23:04:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 23:04:38,391 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 23:04:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:38,392 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 23:04:38,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 23:04:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:38,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:38,393 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:38,393 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:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-27 23:04:38,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:38,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99145059] [2019-12-27 23:04:38,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:38,433 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:38,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99145059] [2019-12-27 23:04:38,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:38,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:38,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [674336022] [2019-12-27 23:04:38,434 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:38,435 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:38,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:38,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:38,437 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:38,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:38,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:38,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:38,438 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 23:04:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:38,549 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 23:04:38,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:38,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:38,595 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 23:04:38,595 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 23:04:38,596 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:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 23:04:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 23:04:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 23:04:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 23:04:38,778 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 23:04:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:38,780 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 23:04:38,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 23:04:38,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:38,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:38,781 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:38,782 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:38,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:38,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-27 23:04:38,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:38,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114382235] [2019-12-27 23:04:38,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:38,834 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:38,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114382235] [2019-12-27 23:04:38,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209792796] [2019-12-27 23:04:38,835 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:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:38,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:38,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:38,916 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:38,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:38,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:38,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206992531] [2019-12-27 23:04:38,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:38,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:38,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:04:38,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:38,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:04:38,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:38,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:38,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:38,953 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-27 23:04:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:39,340 INFO L93 Difference]: Finished difference Result 4795 states and 15556 transitions. [2019-12-27 23:04:39,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:39,340 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 23:04:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:39,359 INFO L225 Difference]: With dead ends: 4795 [2019-12-27 23:04:39,360 INFO L226 Difference]: Without dead ends: 4790 [2019-12-27 23:04:39,360 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:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2019-12-27 23:04:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 2109. [2019-12-27 23:04:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 23:04:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 23:04:39,459 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 23:04:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:39,459 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 23:04:39,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:39,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 23:04:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:39,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:39,460 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:39,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:39,665 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:39,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:39,665 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-27 23:04:39,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:39,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060339344] [2019-12-27 23:04:39,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:39,706 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:39,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060339344] [2019-12-27 23:04:39,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:39,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:39,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [372744971] [2019-12-27 23:04:39,707 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:39,708 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:39,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:04:39,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:39,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:39,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:39,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:39,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:39,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:39,711 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 23:04:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:39,939 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 23:04:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:39,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:39,955 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 23:04:39,955 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 23:04:39,955 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,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 23:04:40,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 23:04:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 23:04:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 23:04:40,040 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 23:04:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:40,040 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 23:04:40,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 23:04:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:04:40,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:40,041 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:40,042 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:40,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:40,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-27 23:04:40,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:40,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969017825] [2019-12-27 23:04:40,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:40,074 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:40,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969017825] [2019-12-27 23:04:40,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:40,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:40,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [364020565] [2019-12-27 23:04:40,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:40,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:40,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:04:40,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:40,079 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:40,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:40,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:40,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:40,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:40,080 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 23:04:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:40,172 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 23:04:40,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:40,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:04:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:40,187 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 23:04:40,187 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 23:04:40,188 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:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 23:04:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 23:04:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 23:04:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 23:04:40,265 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 23:04:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:40,265 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 23:04:40,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 23:04:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:40,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:40,267 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:40,267 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:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:40,268 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-27 23:04:40,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:40,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020564630] [2019-12-27 23:04:40,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:40,324 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:40,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020564630] [2019-12-27 23:04:40,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399068593] [2019-12-27 23:04:40,325 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:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:40,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:40,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:40,405 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:40,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:40,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:40,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47616609] [2019-12-27 23:04:40,406 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:40,407 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:40,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 23:04:40,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:40,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:04:40,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:04:40,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:40,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:04:40,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:04:40,471 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 10 states. [2019-12-27 23:04:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:40,897 INFO L93 Difference]: Finished difference Result 5135 states and 16723 transitions. [2019-12-27 23:04:40,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:40,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 23:04:40,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:40,917 INFO L225 Difference]: With dead ends: 5135 [2019-12-27 23:04:40,917 INFO L226 Difference]: Without dead ends: 5126 [2019-12-27 23:04:40,917 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:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2019-12-27 23:04:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2270. [2019-12-27 23:04:41,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 23:04:41,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 23:04:41,084 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 23:04:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:41,085 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 23:04:41,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:04:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 23:04:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:41,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:41,086 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:41,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:41,290 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:41,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-27 23:04:41,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:41,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382046935] [2019-12-27 23:04:41,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:41,349 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:41,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382046935] [2019-12-27 23:04:41,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900401388] [2019-12-27 23:04:41,350 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:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:41,421 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:41,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:41,429 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:41,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:41,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:41,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102710595] [2019-12-27 23:04:41,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:41,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:41,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 23:04:41,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:41,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:04:41,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:41,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:41,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:41,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:41,467 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-27 23:04:41,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:41,855 INFO L93 Difference]: Finished difference Result 5272 states and 17168 transitions. [2019-12-27 23:04:41,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:41,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 23:04:41,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:41,871 INFO L225 Difference]: With dead ends: 5272 [2019-12-27 23:04:41,871 INFO L226 Difference]: Without dead ends: 5259 [2019-12-27 23:04:41,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:04:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-12-27 23:04:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 2267. [2019-12-27 23:04:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 23:04:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 23:04:41,965 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 23:04:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:41,966 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 23:04:41,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 23:04:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:41,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:41,967 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:42,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:42,176 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:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-27 23:04:42,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:42,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397846322] [2019-12-27 23:04:42,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:42,245 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:42,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397846322] [2019-12-27 23:04:42,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:42,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:42,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1639670592] [2019-12-27 23:04:42,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:42,248 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:42,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:04:42,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:42,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:42,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:42,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:42,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:42,256 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 23:04:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:42,478 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 23:04:42,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:42,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:04:42,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:42,492 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 23:04:42,492 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 23:04:42,493 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:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 23:04:42,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 23:04:42,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 23:04:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 23:04:42,571 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 23:04:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:42,571 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 23:04:42,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 23:04:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:42,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:42,573 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:42,573 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:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-27 23:04:42,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:42,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077046849] [2019-12-27 23:04:42,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:42,615 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:42,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077046849] [2019-12-27 23:04:42,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:42,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:42,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913094264] [2019-12-27 23:04:42,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:42,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:42,620 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:04:42,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:42,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:42,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:42,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:42,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:42,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:42,621 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 23:04:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:42,871 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 23:04:42,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:42,872 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:04:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:42,879 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 23:04:42,880 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 23:04:42,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:04:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 23:04:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 23:04:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 23:04:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 23:04:42,936 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 23:04:42,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:42,936 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 23:04:42,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 23:04:42,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:42,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:42,937 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,938 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:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:42,938 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-27 23:04:42,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:42,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882864113] [2019-12-27 23:04:42,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:42,988 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:42,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882864113] [2019-12-27 23:04:42,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492393804] [2019-12-27 23:04:42,989 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:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:43,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:43,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:43,072 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:43,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:43,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:43,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169436172] [2019-12-27 23:04:43,073 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:43,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:43,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 23:04:43,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:43,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 23:04:43,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:04:43,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:43,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:04:43,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:04:43,212 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 23:04:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:44,802 INFO L93 Difference]: Finished difference Result 6643 states and 19902 transitions. [2019-12-27 23:04:44,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:04:44,802 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 23:04:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:44,812 INFO L225 Difference]: With dead ends: 6643 [2019-12-27 23:04:44,812 INFO L226 Difference]: Without dead ends: 6636 [2019-12-27 23:04:44,813 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:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2019-12-27 23:04:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 2101. [2019-12-27 23:04:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 23:04:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 23:04:44,873 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 23:04:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:44,873 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 23:04:44,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:04:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 23:04:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:44,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:44,875 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:45,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:45,077 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:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-27 23:04:45,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:45,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34053482] [2019-12-27 23:04:45,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:45,141 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:45,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34053482] [2019-12-27 23:04:45,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992995573] [2019-12-27 23:04:45,142 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:45,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:04:45,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:04:45,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:45,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:45,209 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:45,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:45,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:45,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574021337] [2019-12-27 23:04:45,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:45,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:45,218 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:04:45,218 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:45,270 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:04:45,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:04:45,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:45,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:04:45,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:04:45,271 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 12 states. [2019-12-27 23:04:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:46,294 INFO L93 Difference]: Finished difference Result 6356 states and 19271 transitions. [2019-12-27 23:04:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:04:46,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 23:04:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:46,308 INFO L225 Difference]: With dead ends: 6356 [2019-12-27 23:04:46,308 INFO L226 Difference]: Without dead ends: 6347 [2019-12-27 23:04:46,310 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:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2019-12-27 23:04:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 2071. [2019-12-27 23:04:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 23:04:46,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 23:04:46,454 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 23:04:46,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:46,454 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 23:04:46,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:04:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 23:04:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:46,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:46,458 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,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:46,662 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:46,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-27 23:04:46,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:46,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605207134] [2019-12-27 23:04:46,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:46,752 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:46,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605207134] [2019-12-27 23:04:46,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720322945] [2019-12-27 23:04:46,753 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:46,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:04:46,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:04:46,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:46,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:46,874 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:46,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:46,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:46,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525488324] [2019-12-27 23:04:46,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:46,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:46,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:04:46,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:47,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 23:04:47,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:04:47,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:47,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:04:47,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:04:47,022 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 15 states. [2019-12-27 23:04:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:48,575 INFO L93 Difference]: Finished difference Result 6519 states and 19507 transitions. [2019-12-27 23:04:48,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:04:48,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-27 23:04:48,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:48,586 INFO L225 Difference]: With dead ends: 6519 [2019-12-27 23:04:48,587 INFO L226 Difference]: Without dead ends: 6512 [2019-12-27 23:04:48,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1090, Invalid=3602, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 23:04:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2019-12-27 23:04:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 1997. [2019-12-27 23:04:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 23:04:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 23:04:48,670 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 23:04:48,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:48,671 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 23:04:48,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:04:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 23:04:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:48,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:48,674 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:48,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:48,886 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:48,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:48,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-27 23:04:48,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:48,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752852112] [2019-12-27 23:04:48,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:48,952 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:48,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752852112] [2019-12-27 23:04:48,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235976170] [2019-12-27 23:04:48,953 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:49,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:04:49,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:04:49,066 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:04:49,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:49,070 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:49,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:49,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:04:49,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1458703578] [2019-12-27 23:04:49,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:49,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:49,078 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 23:04:49,078 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:49,114 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:04:49,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:04:49,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:49,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:04:49,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:04:49,115 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-27 23:04:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:50,097 INFO L93 Difference]: Finished difference Result 6273 states and 19028 transitions. [2019-12-27 23:04:50,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:04:50,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 23:04:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:50,116 INFO L225 Difference]: With dead ends: 6273 [2019-12-27 23:04:50,116 INFO L226 Difference]: Without dead ends: 6264 [2019-12-27 23:04:50,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=557, Invalid=1795, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 23:04:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-12-27 23:04:50,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 1967. [2019-12-27 23:04:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 23:04:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 23:04:50,197 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 23:04:50,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:50,197 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 23:04:50,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:04:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 23:04:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:50,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:50,200 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:50,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:50,412 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:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-27 23:04:50,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:50,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278809088] [2019-12-27 23:04:50,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:50,459 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:50,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278809088] [2019-12-27 23:04:50,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:50,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:50,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986179533] [2019-12-27 23:04:50,460 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:50,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:50,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:04:50,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:50,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:50,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:50,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:50,465 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 23:04:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:50,530 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 23:04:50,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:50,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 23:04:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:50,536 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 23:04:50,536 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 23:04:50,537 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:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 23:04:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 23:04:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 23:04:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 23:04:50,576 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 23:04:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:50,576 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 23:04:50,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:50,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 23:04:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:50,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:50,578 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:50,578 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:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:50,578 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-27 23:04:50,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:50,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084198827] [2019-12-27 23:04:50,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:50,626 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:50,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084198827] [2019-12-27 23:04:50,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:50,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:04:50,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774860523] [2019-12-27 23:04:50,627 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:50,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:50,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:04:50,633 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:50,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:50,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:50,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:50,634 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 23:04:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:51,149 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 23:04:51,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:04:51,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:04:51,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:51,159 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 23:04:51,159 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 23:04:51,160 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:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 23:04:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 23:04:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 23:04:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 23:04:51,213 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 23:04:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:51,213 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 23:04:51,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 23:04:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:04:51,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:51,216 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:51,216 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:51,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:51,216 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-27 23:04:51,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:51,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743793287] [2019-12-27 23:04:51,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:51,286 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:51,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743793287] [2019-12-27 23:04:51,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:51,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:04:51,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [576856994] [2019-12-27 23:04:51,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:51,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:51,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:04:51,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:51,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:51,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:51,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:51,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:51,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:51,295 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 23:04:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:51,779 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 23:04:51,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:04:51,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:04:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:51,789 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 23:04:51,789 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 23:04:51,789 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:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 23:04:51,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 23:04:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 23:04:51,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 23:04:51,866 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 23:04:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:51,867 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 23:04:51,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:51,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 23:04:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 23:04:51,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:51,869 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:51,869 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:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-27 23:04:51,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:51,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300498314] [2019-12-27 23:04:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:04:51,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:04:51,891 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:04:51,892 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:04:51,892 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 23:04:51,904 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,904 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,905 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,905 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,905 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,905 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,905 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,905 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,906 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,907 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,907 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,908 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,908 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,909 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,909 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,910 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,910 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,911 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,911 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,911 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,912 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,912 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,912 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:51,912 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,913 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:51,913 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,913 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,913 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,913 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,914 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,914 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,914 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:51,915 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,915 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:51,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,916 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,916 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,917 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,917 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,917 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:51,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,918 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:51,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,918 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,918 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,919 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,919 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,919 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,919 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:51,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,920 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:51,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,920 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,920 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,921 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,921 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,922 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:51,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,922 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:51,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,922 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,922 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,923 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,923 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,923 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,923 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,923 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,929 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,929 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,929 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,930 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,930 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,931 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,931 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,931 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,931 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,931 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,933 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,933 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,933 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,933 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,934 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,935 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,935 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,937 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,937 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,937 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,938 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:51,938 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,939 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,939 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,939 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,939 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:51,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,941 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:51,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,943 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:51,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,944 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:51,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:04:51,945 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 23:04:51,945 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:04:51,945 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:04:51,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:04:51,946 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:04:51,946 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:04:51,946 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:04:51,946 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:04:51,946 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:04:51,947 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-27 23:04:51,948 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 23:04:51,979 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 23:04:51,979 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 23:04:51,982 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:51,989 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 23:04:52,019 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 23:04:52,026 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 23:04:52,028 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:52,033 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-27 23:04:52,033 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:04:53,496 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 23:04:53,959 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-27 23:04:53,959 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 23:04:53,960 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 23:04:54,420 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 23:04:54,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 23:04:54,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:04:54,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:54,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:04:54,421 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:54,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:54,421 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-27 23:04:54,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:54,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158262052] [2019-12-27 23:04:54,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:54,432 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:54,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158262052] [2019-12-27 23:04:54,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:54,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:04:54,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [231324916] [2019-12-27 23:04:54,433 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:54,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:54,434 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:04:54,434 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:54,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:54,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:04:54,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:04:54,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:04:54,435 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 23:04:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:54,500 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 23:04:54,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:04:54,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:04:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:54,516 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 23:04:54,517 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 23:04:54,517 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:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 23:04:54,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 23:04:54,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 23:04:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 23:04:54,673 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 23:04:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:54,674 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 23:04:54,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:04:54,674 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 23:04:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:04:54,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:54,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:54,675 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:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-27 23:04:54,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:54,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080743919] [2019-12-27 23:04:54,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:54,702 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:54,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080743919] [2019-12-27 23:04:54,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:54,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:54,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [128651368] [2019-12-27 23:04:54,704 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:54,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:54,705 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:04:54,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:54,705 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:54,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:54,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:54,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:54,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:54,706 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 23:04:54,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:54,826 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 23:04:54,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:54,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:04:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:54,861 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 23:04:54,861 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 23:04:54,861 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,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 23:04:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 23:04:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 23:04:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 23:04:55,771 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 23:04:55,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:55,771 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 23:04:55,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 23:04:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:04:55,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:55,772 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:55,772 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:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-27 23:04:55,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:55,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636985205] [2019-12-27 23:04:55,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:55,806 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:55,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636985205] [2019-12-27 23:04:55,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:55,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:55,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2014265390] [2019-12-27 23:04:55,807 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:55,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:55,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:04:55,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:55,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:55,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:55,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:55,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:55,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:55,810 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 23:04:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:55,928 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 23:04:55,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:55,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:04:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:55,953 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 23:04:55,953 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 23:04:55,953 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:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 23:04:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 23:04:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 23:04:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 23:04:56,116 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 23:04:56,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:56,116 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 23:04:56,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:56,116 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 23:04:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:56,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:56,117 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:56,117 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:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-27 23:04:56,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:56,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832659468] [2019-12-27 23:04:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:56,164 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:56,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832659468] [2019-12-27 23:04:56,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821734628] [2019-12-27 23:04:56,165 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:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:56,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:56,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:56,248 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:56,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:56,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:56,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1095419561] [2019-12-27 23:04:56,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:56,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:56,252 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:04:56,252 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:56,282 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:04:56,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:04:56,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:04:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:04:56,283 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-27 23:04:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:56,742 INFO L93 Difference]: Finished difference Result 17481 states and 68797 transitions. [2019-12-27 23:04:56,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:56,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 23:04:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:56,801 INFO L225 Difference]: With dead ends: 17481 [2019-12-27 23:04:56,801 INFO L226 Difference]: Without dead ends: 17476 [2019-12-27 23:04:56,802 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:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17476 states. [2019-12-27 23:04:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17476 to 7067. [2019-12-27 23:04:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 23:04:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 23:04:57,218 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 23:04:57,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:57,218 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 23:04:57,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:04:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 23:04:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:04:57,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:57,219 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:57,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:04:57,420 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:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-27 23:04:57,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:57,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23268260] [2019-12-27 23:04:57,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:57,452 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:57,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23268260] [2019-12-27 23:04:57,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:57,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:04:57,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [624291384] [2019-12-27 23:04:57,453 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:57,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:57,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:04:57,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:57,457 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:57,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:04:57,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:04:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:04:57,457 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 23:04:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:57,696 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 23:04:57,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:04:57,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:04:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:57,731 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 23:04:57,731 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 23:04:57,732 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:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 23:04:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 23:04:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 23:04:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 23:04:57,930 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 23:04:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:57,930 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 23:04:57,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:04:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 23:04:57,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:04:57,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:57,931 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:04:57,931 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:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:57,931 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-27 23:04:57,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:57,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977261059] [2019-12-27 23:04:57,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:57,952 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,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977261059] [2019-12-27 23:04:57,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:04:57,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:04:57,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1256369219] [2019-12-27 23:04:57,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:57,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:57,956 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:04:57,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:57,956 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:04:57,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:04:57,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:57,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:04:57,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:04:57,957 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 23:04:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:58,097 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 23:04:58,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:04:58,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:04:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:58,136 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 23:04:58,136 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 23:04:58,137 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:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 23:04:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 23:04:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 23:04:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 23:04:58,527 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 23:04:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:58,528 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 23:04:58,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:04:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 23:04:58,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:58,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:58,529 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,530 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:58,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:04:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-27 23:04:58,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:04:58,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036797819] [2019-12-27 23:04:58,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:04:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:58,565 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:58,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036797819] [2019-12-27 23:04:58,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076421969] [2019-12-27 23:04:58,565 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:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:04:58,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:04:58,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:04:58,646 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:58,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:04:58,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:04:58,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1870916233] [2019-12-27 23:04:58,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:04:58,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:04:58,652 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 23:04:58,652 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:04:58,705 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:04:58,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:04:58,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:04:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:04:58,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:04:58,706 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 10 states. [2019-12-27 23:04:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:04:59,315 INFO L93 Difference]: Finished difference Result 20047 states and 79810 transitions. [2019-12-27 23:04:59,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:04:59,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 23:04:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:04:59,403 INFO L225 Difference]: With dead ends: 20047 [2019-12-27 23:04:59,403 INFO L226 Difference]: Without dead ends: 20038 [2019-12-27 23:04:59,406 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:59,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20038 states. [2019-12-27 23:04:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20038 to 8204. [2019-12-27 23:04:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 23:04:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 23:04:59,802 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 23:04:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:04:59,802 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 23:04:59,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:04:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 23:04:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:04:59,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:04:59,804 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:00,016 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:00,016 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:05:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:00,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-27 23:05:00,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:00,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007360105] [2019-12-27 23:05:00,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:00,073 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:00,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007360105] [2019-12-27 23:05:00,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753186441] [2019-12-27 23:05:00,074 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:05:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:00,161 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:05:00,169 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:00,173 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:00,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:00,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:05:00,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1874978895] [2019-12-27 23:05:00,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:00,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:00,180 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 23:05:00,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:00,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:00,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:00,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:00,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:00,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:00,182 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 23:05:00,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:00,451 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-27 23:05:00,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:00,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:05:00,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:00,498 INFO L225 Difference]: With dead ends: 19158 [2019-12-27 23:05:00,498 INFO L226 Difference]: Without dead ends: 19149 [2019-12-27 23:05:00,499 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:05:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-27 23:05:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-27 23:05:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 23:05:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-27 23:05:01,492 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-27 23:05:01,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:01,492 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-27 23:05:01,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-27 23:05:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:05:01,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:01,493 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:01,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:01,694 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:05:01,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-27 23:05:01,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:01,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270345141] [2019-12-27 23:05:01,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:01,728 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:01,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270345141] [2019-12-27 23:05:01,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:01,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:01,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1889713885] [2019-12-27 23:05:01,728 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:01,730 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:01,731 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:05:01,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:01,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:01,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:01,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:01,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:01,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:01,732 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-27 23:05:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:02,015 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-27 23:05:02,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:02,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:05:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:02,062 INFO L225 Difference]: With dead ends: 19350 [2019-12-27 23:05:02,062 INFO L226 Difference]: Without dead ends: 19341 [2019-12-27 23:05:02,062 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:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-27 23:05:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-27 23:05:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-27 23:05:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-27 23:05:02,334 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-27 23:05:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:02,334 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-27 23:05:02,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-27 23:05:02,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:05:02,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:02,335 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:02,335 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:05:02,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:02,336 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-27 23:05:02,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:02,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355984499] [2019-12-27 23:05:02,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:02,380 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:02,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355984499] [2019-12-27 23:05:02,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:02,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:02,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [319215775] [2019-12-27 23:05:02,381 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:02,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:02,386 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:05:02,386 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:02,386 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:02,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:02,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:02,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:02,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:02,387 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-27 23:05:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:02,658 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 23:05:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:02,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:05:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:02,700 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 23:05:02,700 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 23:05:02,701 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:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 23:05:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 23:05:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 23:05:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 23:05:03,127 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 23:05:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:03,127 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 23:05:03,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 23:05:03,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:03,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:03,129 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,129 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:05:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-27 23:05:03,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:03,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914401462] [2019-12-27 23:05:03,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:03,175 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,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914401462] [2019-12-27 23:05:03,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206459751] [2019-12-27 23:05:03,176 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:05:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:03,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:03,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:03,268 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,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:03,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:03,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470944801] [2019-12-27 23:05:03,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:03,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:03,277 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 23:05:03,277 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:03,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:05:03,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:05:03,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:03,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:05:03,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:05:03,386 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-27 23:05:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:05,065 INFO L93 Difference]: Finished difference Result 29507 states and 108761 transitions. [2019-12-27 23:05:05,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:05:05,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 23:05:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:05,129 INFO L225 Difference]: With dead ends: 29507 [2019-12-27 23:05:05,129 INFO L226 Difference]: Without dead ends: 29500 [2019-12-27 23:05:05,130 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:05,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29500 states. [2019-12-27 23:05:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29500 to 7999. [2019-12-27 23:05:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-27 23:05:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-27 23:05:05,651 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-27 23:05:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:05,651 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-27 23:05:05,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:05:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-27 23:05:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:05,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:05,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:05:05,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:05,853 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:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:05,854 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-27 23:05:05,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:05,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417618534] [2019-12-27 23:05:05,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:05,911 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,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417618534] [2019-12-27 23:05:05,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464069330] [2019-12-27 23:05:05,911 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:05,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:05,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:06,000 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:06,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:06,004 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:06,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:06,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:06,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [483281626] [2019-12-27 23:05:06,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:06,007 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:06,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:05:06,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:06,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:06,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:05:06,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:05:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:05:06,067 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 12 states. [2019-12-27 23:05:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:07,133 INFO L93 Difference]: Finished difference Result 28304 states and 105368 transitions. [2019-12-27 23:05:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:05:07,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 23:05:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:07,196 INFO L225 Difference]: With dead ends: 28304 [2019-12-27 23:05:07,196 INFO L226 Difference]: Without dead ends: 28295 [2019-12-27 23:05:07,197 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:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28295 states. [2019-12-27 23:05:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28295 to 7893. [2019-12-27 23:05:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 23:05:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 23:05:07,498 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 23:05:07,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:07,498 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 23:05:07,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:05:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 23:05:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:07,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:07,500 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,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:07,700 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:07,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:07,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-27 23:05:07,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:07,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176849380] [2019-12-27 23:05:07,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:07,749 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:07,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176849380] [2019-12-27 23:05:07,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365771128] [2019-12-27 23:05:07,750 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:07,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:05:07,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:07,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:07,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:07,830 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:07,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:07,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:07,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706882475] [2019-12-27 23:05:07,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:07,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:07,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:05:07,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:07,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:05:07,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:05:07,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:07,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:05:07,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:05:07,863 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 11 states. [2019-12-27 23:05:08,195 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-27 23:05:08,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:08,965 INFO L93 Difference]: Finished difference Result 28007 states and 104728 transitions. [2019-12-27 23:05:08,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:05:08,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 23:05:08,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:09,035 INFO L225 Difference]: With dead ends: 28007 [2019-12-27 23:05:09,035 INFO L226 Difference]: Without dead ends: 28002 [2019-12-27 23:05:09,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:05:09,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28002 states. [2019-12-27 23:05:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28002 to 7675. [2019-12-27 23:05:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-27 23:05:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-27 23:05:09,360 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-27 23:05:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:09,360 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-27 23:05:09,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:05:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-27 23:05:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:09,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:09,361 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,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:09,562 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:09,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-27 23:05:09,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:09,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300980997] [2019-12-27 23:05:09,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:09,609 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:09,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300980997] [2019-12-27 23:05:09,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797589823] [2019-12-27 23:05:09,609 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:09,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:05:09,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:09,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:09,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:09,708 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:09,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:09,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:09,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [245172346] [2019-12-27 23:05:09,708 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:09,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:09,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 23:05:09,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:09,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:09,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:09,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:09,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:09,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:09,717 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 9 states. [2019-12-27 23:05:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:10,357 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-27 23:05:10,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:10,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:05:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:10,421 INFO L225 Difference]: With dead ends: 25959 [2019-12-27 23:05:10,421 INFO L226 Difference]: Without dead ends: 25953 [2019-12-27 23:05:10,421 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:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-27 23:05:10,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-27 23:05:10,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-27 23:05:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-27 23:05:10,968 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-27 23:05:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:10,968 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-27 23:05:10,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-27 23:05:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:10,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:10,970 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:11,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:11,175 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:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-27 23:05:11,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:11,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394730817] [2019-12-27 23:05:11,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:11,208 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:11,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394730817] [2019-12-27 23:05:11,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:11,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:11,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [364468625] [2019-12-27 23:05:11,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:11,210 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:11,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:05:11,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:11,214 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:11,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:11,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:11,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:11,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:11,215 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-27 23:05:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:11,340 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-27 23:05:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:11,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 23:05:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:11,372 INFO L225 Difference]: With dead ends: 12952 [2019-12-27 23:05:11,372 INFO L226 Difference]: Without dead ends: 12936 [2019-12-27 23:05:11,373 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:11,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-27 23:05:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-27 23:05:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-27 23:05:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-27 23:05:11,568 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-27 23:05:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:11,568 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-27 23:05:11,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:05:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-27 23:05:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:11,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:11,570 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:11,570 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:11,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-27 23:05:11,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:11,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009613873] [2019-12-27 23:05:11,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:11,628 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:11,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009613873] [2019-12-27 23:05:11,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:11,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:11,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [485678023] [2019-12-27 23:05:11,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:11,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:11,634 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:05:11,634 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:11,634 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:11,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:11,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:11,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:11,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:11,637 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-27 23:05:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:12,409 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-27 23:05:12,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:12,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:05:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:12,470 INFO L225 Difference]: With dead ends: 29252 [2019-12-27 23:05:12,471 INFO L226 Difference]: Without dead ends: 29245 [2019-12-27 23:05:12,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:05:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-27 23:05:12,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-27 23:05:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 23:05:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-27 23:05:12,786 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-27 23:05:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:12,787 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-27 23:05:12,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-27 23:05:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:05:12,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:12,788 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:12,788 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:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-27 23:05:12,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:12,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564215937] [2019-12-27 23:05:12,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:12,833 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:12,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564215937] [2019-12-27 23:05:12,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:12,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:12,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [144086241] [2019-12-27 23:05:12,834 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:12,835 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:12,838 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:05:12,838 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:12,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:12,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:12,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:12,839 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-27 23:05:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:13,644 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-27 23:05:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:13,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:05:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:13,705 INFO L225 Difference]: With dead ends: 28866 [2019-12-27 23:05:13,705 INFO L226 Difference]: Without dead ends: 28856 [2019-12-27 23:05:13,705 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:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-27 23:05:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-27 23:05:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 23:05:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 23:05:13,999 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 23:05:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:14,000 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 23:05:14,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 23:05:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:14,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:14,001 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,002 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:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-27 23:05:14,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:14,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569637706] [2019-12-27 23:05:14,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:14,055 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:14,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569637706] [2019-12-27 23:05:14,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626203933] [2019-12-27 23:05:14,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 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:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:14,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:05:14,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:14,135 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:14,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:14,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:05:14,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1794262497] [2019-12-27 23:05:14,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:14,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:14,142 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 23:05:14,142 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:14,226 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:05:14,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:05:14,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:14,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:05:14,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:05:14,226 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 11 states. [2019-12-27 23:05:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:14,904 INFO L93 Difference]: Finished difference Result 21073 states and 84547 transitions. [2019-12-27 23:05:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:05:14,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 23:05:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:14,965 INFO L225 Difference]: With dead ends: 21073 [2019-12-27 23:05:14,965 INFO L226 Difference]: Without dead ends: 21054 [2019-12-27 23:05:14,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:05:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21054 states. [2019-12-27 23:05:15,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21054 to 8674. [2019-12-27 23:05:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 23:05:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 23:05:15,224 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 23:05:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:15,225 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 23:05:15,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:05:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 23:05:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:15,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:15,227 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:15,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:15,428 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:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-27 23:05:15,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:15,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380740173] [2019-12-27 23:05:15,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:15,461 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:15,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380740173] [2019-12-27 23:05:15,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831895582] [2019-12-27 23:05:15,461 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:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:15,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:05:15,541 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:15,543 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:15,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:15,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 23:05:15,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1342583340] [2019-12-27 23:05:15,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:15,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:15,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 23:05:15,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:15,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:15,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:15,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:15,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:15,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:15,551 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 7 states. [2019-12-27 23:05:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:15,836 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-27 23:05:15,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:15,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:15,882 INFO L225 Difference]: With dead ends: 20331 [2019-12-27 23:05:15,882 INFO L226 Difference]: Without dead ends: 20317 [2019-12-27 23:05:15,883 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:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-27 23:05:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-27 23:05:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-27 23:05:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-27 23:05:16,358 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-27 23:05:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:16,358 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-27 23:05:16,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-27 23:05:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:16,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:16,361 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:16,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:16,561 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:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-27 23:05:16,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:16,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437069442] [2019-12-27 23:05:16,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:16,609 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:16,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437069442] [2019-12-27 23:05:16,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:16,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:16,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1956347965] [2019-12-27 23:05:16,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:16,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:16,616 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:05:16,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:16,616 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:16,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:16,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:16,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:16,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:16,618 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-27 23:05:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:16,897 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-27 23:05:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:16,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:16,945 INFO L225 Difference]: With dead ends: 20594 [2019-12-27 23:05:16,945 INFO L226 Difference]: Without dead ends: 20575 [2019-12-27 23:05:16,945 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:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-27 23:05:17,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-27 23:05:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-27 23:05:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-27 23:05:17,202 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-27 23:05:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:17,202 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-27 23:05:17,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:17,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-27 23:05:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:17,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:17,204 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:17,204 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:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-27 23:05:17,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:17,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050374570] [2019-12-27 23:05:17,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:17,246 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:17,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050374570] [2019-12-27 23:05:17,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:17,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:17,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1003271274] [2019-12-27 23:05:17,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:17,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:17,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:05:17,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:17,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:17,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:17,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:17,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:17,255 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-27 23:05:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:17,523 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-27 23:05:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:17,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:17,574 INFO L225 Difference]: With dead ends: 20360 [2019-12-27 23:05:17,574 INFO L226 Difference]: Without dead ends: 20341 [2019-12-27 23:05:17,575 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:17,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-27 23:05:17,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-27 23:05:17,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 23:05:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-27 23:05:17,844 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-27 23:05:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:17,845 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-27 23:05:17,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-27 23:05:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:17,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:17,847 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:17,847 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:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-27 23:05:17,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:17,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383428819] [2019-12-27 23:05:17,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:17,880 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:17,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383428819] [2019-12-27 23:05:17,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:17,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:17,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126697426] [2019-12-27 23:05:17,881 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:17,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:17,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:05:17,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:17,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:17,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:05:17,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:05:17,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:05:17,887 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-27 23:05:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:18,186 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-27 23:05:18,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:05:18,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:05:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:18,230 INFO L225 Difference]: With dead ends: 20740 [2019-12-27 23:05:18,230 INFO L226 Difference]: Without dead ends: 20721 [2019-12-27 23:05:18,230 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:18,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-27 23:05:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-27 23:05:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-27 23:05:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-27 23:05:18,486 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-27 23:05:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:18,487 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-27 23:05:18,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:05:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-27 23:05:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:05:18,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:18,489 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:18,489 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:18,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:18,489 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-27 23:05:18,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:18,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293054354] [2019-12-27 23:05:18,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:18,525 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:18,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293054354] [2019-12-27 23:05:18,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:18,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:05:18,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1071435255] [2019-12-27 23:05:18,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:18,528 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:18,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 23:05:18,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:18,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:18,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:05:18,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:18,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:05:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:05:18,716 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 11 states. [2019-12-27 23:05:19,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:19,436 INFO L93 Difference]: Finished difference Result 23635 states and 93345 transitions. [2019-12-27 23:05:19,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:05:19,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 23:05:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:19,512 INFO L225 Difference]: With dead ends: 23635 [2019-12-27 23:05:19,512 INFO L226 Difference]: Without dead ends: 23606 [2019-12-27 23:05:19,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:05:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23606 states. [2019-12-27 23:05:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23606 to 9286. [2019-12-27 23:05:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 23:05:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 23:05:19,817 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 23:05:19,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:19,817 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 23:05:19,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:05:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 23:05:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:19,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:19,821 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:19,821 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:19,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-27 23:05:19,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:19,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043098435] [2019-12-27 23:05:19,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:19,916 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:19,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043098435] [2019-12-27 23:05:19,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113511922] [2019-12-27 23:05:19,917 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:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:20,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:20,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:20,031 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,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:20,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:20,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512810983] [2019-12-27 23:05:20,032 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:20,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:20,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 23:05:20,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:20,287 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 23:05:20,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:05:20,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:20,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:05:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:05:20,288 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 19 states. [2019-12-27 23:05:21,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:21,995 INFO L93 Difference]: Finished difference Result 33531 states and 124595 transitions. [2019-12-27 23:05:21,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:05:21,995 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 23:05:21,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:22,065 INFO L225 Difference]: With dead ends: 33531 [2019-12-27 23:05:22,065 INFO L226 Difference]: Without dead ends: 33513 [2019-12-27 23:05:22,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1271, Invalid=3985, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 23:05:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33513 states. [2019-12-27 23:05:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33513 to 9200. [2019-12-27 23:05:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-27 23:05:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-27 23:05:22,426 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-27 23:05:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:22,427 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-27 23:05:22,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:05:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-27 23:05:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:22,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:22,430 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,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:22,631 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:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-27 23:05:22,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:22,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608377246] [2019-12-27 23:05:22,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:22,685 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,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608377246] [2019-12-27 23:05:22,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208156580] [2019-12-27 23:05:22,685 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:22,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:22,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:22,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:22,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:22,773 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,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:22,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:22,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439099793] [2019-12-27 23:05:22,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:22,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:22,801 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:05:22,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:23,013 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:05:23,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:23,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:23,014 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 13 states. [2019-12-27 23:05:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:24,155 INFO L93 Difference]: Finished difference Result 31912 states and 119979 transitions. [2019-12-27 23:05:24,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:05:24,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:24,223 INFO L225 Difference]: With dead ends: 31912 [2019-12-27 23:05:24,223 INFO L226 Difference]: Without dead ends: 31893 [2019-12-27 23:05:24,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=622, Invalid=1928, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 23:05:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31893 states. [2019-12-27 23:05:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31893 to 9197. [2019-12-27 23:05:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-27 23:05:24,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-27 23:05:24,575 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-27 23:05:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:24,575 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-27 23:05:24,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-27 23:05:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:24,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:24,578 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:24,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:24,779 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:24,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-27 23:05:24,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:24,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574733621] [2019-12-27 23:05:24,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:24,841 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:24,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574733621] [2019-12-27 23:05:24,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407062806] [2019-12-27 23:05:24,844 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:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:24,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:24,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:24,937 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:24,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:24,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:24,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715355293] [2019-12-27 23:05:24,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:24,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:24,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:05:24,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:25,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:05:25,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:25,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:25,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:25,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:25,040 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 13 states. [2019-12-27 23:05:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:26,112 INFO L93 Difference]: Finished difference Result 31552 states and 118615 transitions. [2019-12-27 23:05:26,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:05:26,112 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:26,179 INFO L225 Difference]: With dead ends: 31552 [2019-12-27 23:05:26,179 INFO L226 Difference]: Without dead ends: 31534 [2019-12-27 23:05:26,179 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:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31534 states. [2019-12-27 23:05:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31534 to 9121. [2019-12-27 23:05:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-27 23:05:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-27 23:05:26,533 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-27 23:05:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:26,534 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-27 23:05:26,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-27 23:05:26,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:26,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:26,537 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:26,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:26,738 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:26,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:26,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-27 23:05:26,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:26,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581548570] [2019-12-27 23:05:26,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:26,792 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:26,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581548570] [2019-12-27 23:05:26,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606677005] [2019-12-27 23:05:26,793 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:26,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:26,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:26,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:26,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:26,880 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:26,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:26,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:26,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [953675459] [2019-12-27 23:05:26,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:26,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:26,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 23:05:26,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:27,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:05:27,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:05:27,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:05:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:05:27,105 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 17 states. [2019-12-27 23:05:28,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:28,734 INFO L93 Difference]: Finished difference Result 32380 states and 120008 transitions. [2019-12-27 23:05:28,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:05:28,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:05:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:28,803 INFO L225 Difference]: With dead ends: 32380 [2019-12-27 23:05:28,804 INFO L226 Difference]: Without dead ends: 32361 [2019-12-27 23:05:28,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1169, Invalid=3801, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 23:05:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32361 states. [2019-12-27 23:05:29,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32361 to 9044. [2019-12-27 23:05:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 23:05:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 23:05:29,155 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 23:05:29,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:29,155 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 23:05:29,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:05:29,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 23:05:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:29,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:29,158 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:29,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:29,359 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:29,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:29,359 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-27 23:05:29,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:29,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719919631] [2019-12-27 23:05:29,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:29,405 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:29,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719919631] [2019-12-27 23:05:29,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189177981] [2019-12-27 23:05:29,406 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:29,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 23:05:29,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:29,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:29,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:29,492 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:29,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:29,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:29,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785938661] [2019-12-27 23:05:29,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:29,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:29,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 23:05:29,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:29,569 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:29,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:05:29,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:05:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:05:29,570 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 12 states. [2019-12-27 23:05:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:30,535 INFO L93 Difference]: Finished difference Result 30950 states and 116627 transitions. [2019-12-27 23:05:30,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:05:30,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 23:05:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:30,601 INFO L225 Difference]: With dead ends: 30950 [2019-12-27 23:05:30,601 INFO L226 Difference]: Without dead ends: 30936 [2019-12-27 23:05:30,601 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:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30936 states. [2019-12-27 23:05:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30936 to 8874. [2019-12-27 23:05:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-27 23:05:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-27 23:05:30,957 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-27 23:05:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:30,957 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-27 23:05:30,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:05:30,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-27 23:05:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:30,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:30,960 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:31,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:31,161 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:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-27 23:05:31,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:31,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004524936] [2019-12-27 23:05:31,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:31,213 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:31,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004524936] [2019-12-27 23:05:31,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10222834] [2019-12-27 23:05:31,213 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:31,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:05:31,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:31,294 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:31,295 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:31,297 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:31,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:31,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:31,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913094791] [2019-12-27 23:05:31,298 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:31,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:31,309 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:31,309 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:31,309 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:31,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:31,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:31,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:31,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:31,310 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 9 states. [2019-12-27 23:05:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:32,086 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-27 23:05:32,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:32,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:32,148 INFO L225 Difference]: With dead ends: 28993 [2019-12-27 23:05:32,149 INFO L226 Difference]: Without dead ends: 28982 [2019-12-27 23:05:32,149 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:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-27 23:05:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-27 23:05:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-27 23:05:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-27 23:05:32,468 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-27 23:05:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:32,468 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-27 23:05:32,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-27 23:05:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:32,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:32,471 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,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:32,672 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:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:32,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-27 23:05:32,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:32,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762457556] [2019-12-27 23:05:32,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:32,725 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:32,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762457556] [2019-12-27 23:05:32,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300906256] [2019-12-27 23:05:32,725 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:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:32,801 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:32,802 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:32,804 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:32,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:32,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:32,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1867992147] [2019-12-27 23:05:32,805 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:32,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:32,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:32,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:32,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:32,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:32,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:32,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:32,815 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 9 states. [2019-12-27 23:05:33,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:33,533 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-27 23:05:33,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:33,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:33,597 INFO L225 Difference]: With dead ends: 28840 [2019-12-27 23:05:33,597 INFO L226 Difference]: Without dead ends: 28830 [2019-12-27 23:05:33,598 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:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-27 23:05:33,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-27 23:05:33,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-27 23:05:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-27 23:05:33,920 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-27 23:05:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:33,920 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-27 23:05:33,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-27 23:05:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:33,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:33,923 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,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:34,124 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:34,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-27 23:05:34,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:34,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637601387] [2019-12-27 23:05:34,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:34,167 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:34,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637601387] [2019-12-27 23:05:34,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780590546] [2019-12-27 23:05:34,168 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:34,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:05:34,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:05:34,248 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:05:34,249 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:05:34,252 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:34,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:05:34,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 23:05:34,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501571585] [2019-12-27 23:05:34,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:34,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:34,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:05:34,265 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:34,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:34,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:34,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:34,309 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 13 states. [2019-12-27 23:05:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:35,775 INFO L93 Difference]: Finished difference Result 31746 states and 118539 transitions. [2019-12-27 23:05:35,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 23:05:35,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:35,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:35,844 INFO L225 Difference]: With dead ends: 31746 [2019-12-27 23:05:35,844 INFO L226 Difference]: Without dead ends: 31727 [2019-12-27 23:05:35,844 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:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31727 states. [2019-12-27 23:05:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31727 to 8722. [2019-12-27 23:05:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 23:05:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-27 23:05:36,333 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-27 23:05:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:36,333 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-27 23:05:36,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-27 23:05:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:36,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:36,337 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,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:05:36,538 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:36,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-27 23:05:36,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:36,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027539814] [2019-12-27 23:05:36,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:36,587 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,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027539814] [2019-12-27 23:05:36,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:36,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:36,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821778444] [2019-12-27 23:05:36,588 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:36,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:36,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:36,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:36,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:36,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:36,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:36,598 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-27 23:05:37,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:37,232 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-27 23:05:37,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:37,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:37,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:37,293 INFO L225 Difference]: With dead ends: 28362 [2019-12-27 23:05:37,293 INFO L226 Difference]: Without dead ends: 28352 [2019-12-27 23:05:37,294 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:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-27 23:05:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-27 23:05:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-27 23:05:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-27 23:05:37,603 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-27 23:05:37,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:37,603 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-27 23:05:37,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-27 23:05:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:37,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:37,606 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:37,606 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:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-27 23:05:37,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:37,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515415761] [2019-12-27 23:05:37,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:37,654 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:37,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515415761] [2019-12-27 23:05:37,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:37,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:37,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090850108] [2019-12-27 23:05:37,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:37,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:37,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:37,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:37,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:37,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:37,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:37,661 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-27 23:05:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:38,281 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-27 23:05:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:38,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:38,342 INFO L225 Difference]: With dead ends: 28156 [2019-12-27 23:05:38,343 INFO L226 Difference]: Without dead ends: 28146 [2019-12-27 23:05:38,343 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:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-27 23:05:38,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-27 23:05:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-27 23:05:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-27 23:05:38,641 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-27 23:05:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:38,641 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-27 23:05:38,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-27 23:05:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:38,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:38,644 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,644 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:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-27 23:05:38,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:38,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006601485] [2019-12-27 23:05:38,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:38,701 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,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006601485] [2019-12-27 23:05:38,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:38,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:38,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219376604] [2019-12-27 23:05:38,702 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:38,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:38,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:38,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:38,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:38,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:38,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:38,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:38,711 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-27 23:05:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:39,399 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-27 23:05:39,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:39,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:39,459 INFO L225 Difference]: With dead ends: 27714 [2019-12-27 23:05:39,460 INFO L226 Difference]: Without dead ends: 27700 [2019-12-27 23:05:39,460 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:39,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-27 23:05:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-27 23:05:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-27 23:05:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-27 23:05:39,765 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-27 23:05:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:39,765 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-27 23:05:39,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-27 23:05:39,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:39,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:39,769 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,769 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:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-27 23:05:39,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:39,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419850367] [2019-12-27 23:05:39,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:39,832 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,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419850367] [2019-12-27 23:05:39,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:39,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:39,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341883645] [2019-12-27 23:05:39,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:39,837 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:39,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:39,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:39,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:39,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:39,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:39,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:39,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:39,846 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-27 23:05:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:40,573 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-27 23:05:40,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:40,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:40,633 INFO L225 Difference]: With dead ends: 27553 [2019-12-27 23:05:40,633 INFO L226 Difference]: Without dead ends: 27543 [2019-12-27 23:05:40,633 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:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-27 23:05:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-27 23:05:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-27 23:05:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-27 23:05:40,925 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-27 23:05:40,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:40,926 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-27 23:05:40,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:40,926 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-27 23:05:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:40,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:40,929 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:40,929 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:40,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:40,929 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-27 23:05:40,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:40,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592664955] [2019-12-27 23:05:40,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:41,007 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:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592664955] [2019-12-27 23:05:41,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:41,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:41,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [872395942] [2019-12-27 23:05:41,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:41,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:41,015 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:41,015 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:41,015 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:41,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:41,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:41,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:41,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:41,016 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-27 23:05:41,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:41,730 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-27 23:05:41,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:41,731 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:41,790 INFO L225 Difference]: With dead ends: 27570 [2019-12-27 23:05:41,790 INFO L226 Difference]: Without dead ends: 27556 [2019-12-27 23:05:41,791 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:41,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-27 23:05:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-27 23:05:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-27 23:05:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-27 23:05:42,082 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-27 23:05:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:42,082 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-27 23:05:42,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:42,082 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-27 23:05:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:42,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:42,085 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,086 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:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-27 23:05:42,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:42,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397503832] [2019-12-27 23:05:42,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:42,126 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,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397503832] [2019-12-27 23:05:42,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:42,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:42,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1222066540] [2019-12-27 23:05:42,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:42,128 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:42,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:42,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:42,132 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:42,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:05:42,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:42,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:05:42,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:05:42,133 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-27 23:05:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:42,762 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-27 23:05:42,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:05:42,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:05:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:42,821 INFO L225 Difference]: With dead ends: 27265 [2019-12-27 23:05:42,821 INFO L226 Difference]: Without dead ends: 27251 [2019-12-27 23:05:42,822 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:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-27 23:05:43,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-27 23:05:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-27 23:05:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-27 23:05:43,108 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-27 23:05:43,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:43,108 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-27 23:05:43,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:05:43,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-27 23:05:43,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:43,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:43,111 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:43,111 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:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-27 23:05:43,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:43,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969334092] [2019-12-27 23:05:43,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:43,134 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:43,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969334092] [2019-12-27 23:05:43,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:43,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:43,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566617606] [2019-12-27 23:05:43,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:43,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:43,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:05:43,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:43,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:43,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:43,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:43,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:43,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:43,141 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-27 23:05:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:43,259 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-27 23:05:43,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:43,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 23:05:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:43,288 INFO L225 Difference]: With dead ends: 12944 [2019-12-27 23:05:43,288 INFO L226 Difference]: Without dead ends: 12912 [2019-12-27 23:05:43,289 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:43,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-27 23:05:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-27 23:05:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-27 23:05:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-27 23:05:43,478 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-27 23:05:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:43,478 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-27 23:05:43,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:05:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-27 23:05:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:43,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:43,481 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:43,481 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:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:43,481 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-27 23:05:43,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:43,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448729743] [2019-12-27 23:05:43,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:43,536 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:43,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448729743] [2019-12-27 23:05:43,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:43,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:43,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [126390607] [2019-12-27 23:05:43,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:43,538 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:43,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:43,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:43,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:05:43,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:05:43,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:05:43,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:05:43,711 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 17 states. [2019-12-27 23:05:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:45,988 INFO L93 Difference]: Finished difference Result 36090 states and 131919 transitions. [2019-12-27 23:05:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 23:05:45,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:05:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:46,066 INFO L225 Difference]: With dead ends: 36090 [2019-12-27 23:05:46,066 INFO L226 Difference]: Without dead ends: 36060 [2019-12-27 23:05:46,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 23:05:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36060 states. [2019-12-27 23:05:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36060 to 9188. [2019-12-27 23:05:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-27 23:05:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-27 23:05:46,442 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-27 23:05:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:46,442 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-27 23:05:46,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:05:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-27 23:05:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:46,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:46,445 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,446 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:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-27 23:05:46,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:46,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878625904] [2019-12-27 23:05:46,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:46,495 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:46,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878625904] [2019-12-27 23:05:46,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:46,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:46,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1045708370] [2019-12-27 23:05:46,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:46,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:46,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:05:46,504 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:46,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:46,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:46,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:46,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:46,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:46,565 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 13 states. [2019-12-27 23:05:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:48,204 INFO L93 Difference]: Finished difference Result 34324 states and 127393 transitions. [2019-12-27 23:05:48,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 23:05:48,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:48,278 INFO L225 Difference]: With dead ends: 34324 [2019-12-27 23:05:48,278 INFO L226 Difference]: Without dead ends: 34289 [2019-12-27 23:05:48,279 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:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34289 states. [2019-12-27 23:05:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34289 to 8937. [2019-12-27 23:05:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-27 23:05:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-27 23:05:48,642 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-27 23:05:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:48,642 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-27 23:05:48,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-27 23:05:48,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:48,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:48,645 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:48,645 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:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:48,646 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-27 23:05:48,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:48,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315406920] [2019-12-27 23:05:48,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:48,697 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:48,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315406920] [2019-12-27 23:05:48,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:48,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:48,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [595303950] [2019-12-27 23:05:48,698 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:48,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:48,704 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:05:48,705 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:48,758 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:05:48,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:05:48,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:48,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:05:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:05:48,759 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 13 states. [2019-12-27 23:05:50,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:50,471 INFO L93 Difference]: Finished difference Result 33898 states and 125701 transitions. [2019-12-27 23:05:50,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 23:05:50,472 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:05:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:50,543 INFO L225 Difference]: With dead ends: 33898 [2019-12-27 23:05:50,544 INFO L226 Difference]: Without dead ends: 33868 [2019-12-27 23:05:50,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:05:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33868 states. [2019-12-27 23:05:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33868 to 8839. [2019-12-27 23:05:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-27 23:05:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-27 23:05:50,904 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-27 23:05:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:50,904 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-27 23:05:50,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:05:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-27 23:05:50,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:05:50,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:50,907 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:50,907 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:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:50,908 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-27 23:05:50,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:50,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453481652] [2019-12-27 23:05:50,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:50,977 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:50,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453481652] [2019-12-27 23:05:50,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:50,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:05:50,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750646910] [2019-12-27 23:05:50,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:50,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:50,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:05:50,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:51,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:05:51,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:05:51,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:51,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:05:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:05:51,077 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 17 states. [2019-12-27 23:05:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:53,551 INFO L93 Difference]: Finished difference Result 34906 states and 127104 transitions. [2019-12-27 23:05:53,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 23:05:53,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:05:53,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:53,624 INFO L225 Difference]: With dead ends: 34906 [2019-12-27 23:05:53,625 INFO L226 Difference]: Without dead ends: 34871 [2019-12-27 23:05:53,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3074 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 23:05:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34871 states. [2019-12-27 23:05:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34871 to 8516. [2019-12-27 23:05:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 23:05:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 23:05:53,981 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 23:05:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:53,981 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 23:05:53,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:05:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 23:05:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:05:53,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:53,985 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:53,985 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:53,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:53,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-27 23:05:53,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:53,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123968888] [2019-12-27 23:05:53,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:05:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:05:54,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:05:54,006 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:05:54,006 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 23:05:54,007 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 23:05:54,020 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,021 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,021 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,021 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,021 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,021 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,021 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,021 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,022 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,023 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,023 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,023 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,023 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,023 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,023 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,023 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,024 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,024 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,024 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,024 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,024 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,024 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,024 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,025 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,025 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,025 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,025 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,025 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,025 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,025 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,026 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,027 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,028 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,028 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,028 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:54,028 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,029 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:54,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,029 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,029 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,029 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,029 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,030 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,030 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,030 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,030 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:54,030 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,030 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:54,030 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,030 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,031 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,031 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,031 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,031 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,031 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,031 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,031 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,032 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:54,032 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,032 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:54,032 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,032 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,032 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,032 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,032 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,033 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,033 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,033 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,033 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,033 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:54,033 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,033 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:54,034 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,034 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,034 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,034 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,034 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,035 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,035 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,035 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,035 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,035 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:54,035 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,035 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:54,036 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,036 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,036 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,036 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,036 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,036 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,036 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 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:54,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 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:54,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,037 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,038 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,038 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,038 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,038 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,038 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,039 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,039 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,039 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,039 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,039 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,040 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,040 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,040 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,041 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,041 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,042 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,042 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,042 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,043 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,043 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,043 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,043 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,044 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,045 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,045 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,045 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,045 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,045 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,046 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:54,046 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,046 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,047 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,047 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,047 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,048 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,048 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,048 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,048 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,049 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:54,049 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,050 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,050 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,050 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:54,051 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,051 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,051 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,052 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,053 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,053 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:54,053 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,053 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,053 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,054 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,054 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,054 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:54,054 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,054 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,054 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,055 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:54,055 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,055 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,055 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,055 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,056 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:05:54,057 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 23:05:54,057 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:05:54,057 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:05:54,057 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:05:54,058 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:05:54,058 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:05:54,058 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:05:54,058 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:05:54,058 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:05:54,061 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-27 23:05:54,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 23:05:54,085 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 23:05:54,086 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 23:05:54,089 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:54,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 23:05:54,126 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 23:05:54,126 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 23:05:54,129 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:54,140 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-27 23:05:54,140 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:05:56,081 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 23:05:56,228 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-27 23:05:56,228 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 23:05:56,228 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 23:05:57,586 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 23:05:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 23:05:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 23:05:57,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:57,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 23:05:57,587 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:57,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:57,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-27 23:05:57,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:57,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936862821] [2019-12-27 23:05:57,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:57,594 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:57,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936862821] [2019-12-27 23:05:57,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:57,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:05:57,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [877833819] [2019-12-27 23:05:57,595 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:57,596 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:57,596 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 23:05:57,596 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:57,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:57,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:05:57,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:57,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:05:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:05:57,597 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 23:05:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:57,723 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 23:05:57,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:05:57,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 23:05:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:57,771 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 23:05:57,772 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 23:05:57,772 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:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 23:05:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 23:05:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 23:05:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 23:05:58,146 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 23:05:58,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:58,146 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 23:05:58,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:05:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 23:05:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 23:05:58,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:58,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:58,147 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:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-27 23:05:58,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:58,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495092521] [2019-12-27 23:05:58,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:58,169 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:58,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495092521] [2019-12-27 23:05:58,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:58,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:58,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448086808] [2019-12-27 23:05:58,170 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:58,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:58,171 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 23:05:58,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:58,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:58,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:58,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:58,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:58,172 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 23:05:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:58,399 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 23:05:58,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:58,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 23:05:58,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:58,484 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 23:05:58,484 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 23:05:58,485 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:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 23:05:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 23:05:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 23:05:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 23:05:59,041 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 23:05:59,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:05:59,041 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 23:05:59,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:05:59,041 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 23:05:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 23:05:59,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:05:59,041 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:05:59,042 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:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:05:59,042 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-27 23:05:59,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:05:59,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818292594] [2019-12-27 23:05:59,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:05:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:05:59,058 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:59,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818292594] [2019-12-27 23:05:59,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:05:59,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:05:59,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [820346975] [2019-12-27 23:05:59,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:05:59,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:05:59,061 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 23:05:59,061 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:05:59,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:05:59,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:05:59,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:05:59,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:05:59,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:05:59,062 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 23:05:59,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:05:59,312 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 23:05:59,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:05:59,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 23:05:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:05:59,420 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 23:05:59,420 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 23:05:59,420 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:59,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 23:06:01,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 23:06:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 23:06:01,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 23:06:01,806 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 23:06:01,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:01,806 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 23:06:01,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:06:01,806 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 23:06:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:06:01,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:01,807 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:01,807 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:06:01,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:01,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-27 23:06:01,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:01,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606056754] [2019-12-27 23:06:01,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:01,848 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:06:01,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606056754] [2019-12-27 23:06:01,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109457021] [2019-12-27 23:06:01,849 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:06:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:01,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:06:01,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:01,952 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:06:01,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:01,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:06:01,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826937923] [2019-12-27 23:06:01,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:01,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:01,956 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 23:06:01,956 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:01,979 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:06:01,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:06:01,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:06:01,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:06:01,980 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 9 states. [2019-12-27 23:06:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:02,686 INFO L93 Difference]: Finished difference Result 58891 states and 273224 transitions. [2019-12-27 23:06:02,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:06:02,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 23:06:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:02,860 INFO L225 Difference]: With dead ends: 58891 [2019-12-27 23:06:02,860 INFO L226 Difference]: Without dead ends: 58886 [2019-12-27 23:06:02,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:06:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58886 states. [2019-12-27 23:06:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58886 to 22725. [2019-12-27 23:06:03,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 23:06:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 23:06:03,763 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 23:06:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:03,763 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 23:06:03,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:06:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 23:06:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 23:06:03,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:03,764 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:03,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:03,964 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:03,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:03,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-27 23:06:03,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:03,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749612162] [2019-12-27 23:06:03,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:03,998 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:03,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749612162] [2019-12-27 23:06:03,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:03,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:03,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1648582370] [2019-12-27 23:06:04,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:04,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:04,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 23:06:04,002 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:04,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:04,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:04,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:04,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:04,003 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 23:06:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:04,520 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 23:06:04,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:04,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 23:06:04,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:06,903 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 23:06:06,904 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 23:06:06,904 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:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 23:06:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 23:06:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 23:06:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 23:06:07,756 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 23:06:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:07,756 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 23:06:07,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 23:06:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 23:06:07,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:07,757 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:07,757 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:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-27 23:06:07,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:07,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669142463] [2019-12-27 23:06:07,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:07,775 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,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669142463] [2019-12-27 23:06:07,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:07,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:06:07,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311113816] [2019-12-27 23:06:07,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:07,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:07,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 23:06:07,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:07,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:07,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:06:07,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:07,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:06:07,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:06:07,780 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 23:06:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:08,080 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 23:06:08,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:06:08,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 23:06:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:08,202 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 23:06:08,202 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 23:06:08,203 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:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 23:06:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 23:06:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 23:06:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 23:06:09,001 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 23:06:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:09,001 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 23:06:09,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:06:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 23:06:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:09,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:09,002 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:09,002 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:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-27 23:06:09,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:09,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588867907] [2019-12-27 23:06:09,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:09,037 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:09,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588867907] [2019-12-27 23:06:09,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313873312] [2019-12-27 23:06:09,038 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:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:09,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:06:09,133 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:09,147 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:09,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:09,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:06:09,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [751328259] [2019-12-27 23:06:09,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:09,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:09,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 23:06:09,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:09,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:09,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:06:09,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:09,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:06:09,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:06:09,212 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 10 states. [2019-12-27 23:06:09,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:09,980 INFO L93 Difference]: Finished difference Result 69923 states and 329029 transitions. [2019-12-27 23:06:09,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:06:09,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 23:06:09,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:10,760 INFO L225 Difference]: With dead ends: 69923 [2019-12-27 23:06:10,761 INFO L226 Difference]: Without dead ends: 69914 [2019-12-27 23:06:10,761 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:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69914 states. [2019-12-27 23:06:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69914 to 27590. [2019-12-27 23:06:11,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 23:06:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 23:06:11,730 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 23:06:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:11,730 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 23:06:11,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:06:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 23:06:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:11,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:11,732 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:11,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:11,935 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:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-27 23:06:11,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:11,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947648147] [2019-12-27 23:06:11,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:11,961 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:11,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947648147] [2019-12-27 23:06:11,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:11,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:11,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2064053580] [2019-12-27 23:06:11,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:11,963 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:11,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:06:11,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:11,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:11,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:11,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:11,966 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-27 23:06:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:12,506 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-27 23:06:12,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:12,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:06:12,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:12,690 INFO L225 Difference]: With dead ends: 66182 [2019-12-27 23:06:12,690 INFO L226 Difference]: Without dead ends: 66173 [2019-12-27 23:06:12,691 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:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-27 23:06:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-27 23:06:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-27 23:06:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-27 23:06:13,678 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-27 23:06:13,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:13,678 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-27 23:06:13,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-27 23:06:13,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:13,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:13,679 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:13,679 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:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-27 23:06:13,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:13,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710607804] [2019-12-27 23:06:13,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:13,711 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:13,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710607804] [2019-12-27 23:06:13,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:13,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:13,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1491955767] [2019-12-27 23:06:13,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:13,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:13,715 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 23:06:13,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:13,716 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:13,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:13,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:13,716 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-27 23:06:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:14,514 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-27 23:06:14,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:14,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 23:06:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:14,706 INFO L225 Difference]: With dead ends: 66741 [2019-12-27 23:06:14,706 INFO L226 Difference]: Without dead ends: 66732 [2019-12-27 23:06:14,706 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:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-27 23:06:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-27 23:06:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-27 23:06:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-27 23:06:15,718 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-27 23:06:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:15,718 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-27 23:06:15,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-27 23:06:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 23:06:15,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:15,719 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:15,719 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:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-27 23:06:15,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:15,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540367800] [2019-12-27 23:06:15,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:15,752 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:15,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540367800] [2019-12-27 23:06:15,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:15,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:15,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1464524078] [2019-12-27 23:06:15,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:15,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:15,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 23:06:15,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:15,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:15,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:06:15,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:06:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:06:15,800 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 11 states. [2019-12-27 23:06:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:16,813 INFO L93 Difference]: Finished difference Result 76365 states and 356947 transitions. [2019-12-27 23:06:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:06:16,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 23:06:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:17,040 INFO L225 Difference]: With dead ends: 76365 [2019-12-27 23:06:17,040 INFO L226 Difference]: Without dead ends: 76352 [2019-12-27 23:06:17,040 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:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76352 states. [2019-12-27 23:06:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76352 to 28053. [2019-12-27 23:06:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 23:06:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 23:06:18,715 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 23:06:18,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:18,715 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 23:06:18,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:06:18,715 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 23:06:18,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:18,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:18,716 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:18,716 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:18,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:18,717 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-27 23:06:18,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:18,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457609352] [2019-12-27 23:06:18,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:18,781 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:18,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457609352] [2019-12-27 23:06:18,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804201808] [2019-12-27 23:06:18,782 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:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:18,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:06:18,877 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:18,890 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:18,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:18,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:06:18,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [829393517] [2019-12-27 23:06:18,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:18,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:18,897 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:06:18,897 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:18,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:18,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:06:18,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:18,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:06:18,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:06:18,955 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 12 states. [2019-12-27 23:06:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:20,531 INFO L93 Difference]: Finished difference Result 105784 states and 469658 transitions. [2019-12-27 23:06:20,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:06:20,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 23:06:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:20,859 INFO L225 Difference]: With dead ends: 105784 [2019-12-27 23:06:20,859 INFO L226 Difference]: Without dead ends: 105777 [2019-12-27 23:06:20,860 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:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105777 states. [2019-12-27 23:06:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105777 to 27701. [2019-12-27 23:06:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-27 23:06:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-27 23:06:23,284 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-27 23:06:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:23,285 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-27 23:06:23,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:06:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-27 23:06:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:23,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:23,286 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:23,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:23,487 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:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-27 23:06:23,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:23,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041991898] [2019-12-27 23:06:23,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:23,534 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:23,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041991898] [2019-12-27 23:06:23,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421483847] [2019-12-27 23:06:23,535 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:23,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:06:23,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:06:23,625 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:06:23,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:23,647 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:23,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:23,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:06:23,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1736339356] [2019-12-27 23:06:23,647 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:23,649 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:23,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 23:06:23,656 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:23,766 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:06:23,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:06:23,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:06:23,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:06:23,767 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 16 states. [2019-12-27 23:06:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:26,014 INFO L93 Difference]: Finished difference Result 108381 states and 476214 transitions. [2019-12-27 23:06:26,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:06:26,014 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 23:06:26,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:26,345 INFO L225 Difference]: With dead ends: 108381 [2019-12-27 23:06:26,345 INFO L226 Difference]: Without dead ends: 108372 [2019-12-27 23:06:26,346 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:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108372 states. [2019-12-27 23:06:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108372 to 27343. [2019-12-27 23:06:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 23:06:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 23:06:28,574 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 23:06:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:28,575 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 23:06:28,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:06:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 23:06:28,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:28,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:28,576 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:06:28,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:28,776 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:28,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:28,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-27 23:06:28,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:28,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825247321] [2019-12-27 23:06:28,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:28,795 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:28,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825247321] [2019-12-27 23:06:28,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:28,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:06:28,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [850407953] [2019-12-27 23:06:28,796 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:28,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:28,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:06:28,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:28,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:28,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:06:28,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:28,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:06:28,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:06:28,800 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-27 23:06:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:29,139 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-27 23:06:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:06:29,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 23:06:29,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:29,281 INFO L225 Difference]: With dead ends: 49005 [2019-12-27 23:06:29,281 INFO L226 Difference]: Without dead ends: 48989 [2019-12-27 23:06:29,281 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:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-27 23:06:30,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-27 23:06:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-27 23:06:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-27 23:06:30,204 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-27 23:06:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:30,204 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-27 23:06:30,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:06:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-27 23:06:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:30,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:30,205 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:30,205 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:30,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:30,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-27 23:06:30,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:30,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056029329] [2019-12-27 23:06:30,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:30,248 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:30,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056029329] [2019-12-27 23:06:30,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:30,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:30,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979048809] [2019-12-27 23:06:30,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:30,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:30,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:06:30,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:30,253 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:30,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:06:30,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:06:30,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:06:30,254 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-27 23:06:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:31,963 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-27 23:06:31,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:06:31,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:06:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:32,279 INFO L225 Difference]: With dead ends: 112418 [2019-12-27 23:06:32,279 INFO L226 Difference]: Without dead ends: 112411 [2019-12-27 23:06:32,280 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:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-27 23:06:33,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-27 23:06:33,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-27 23:06:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-27 23:06:33,826 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-27 23:06:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:33,826 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-27 23:06:33,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:06:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-27 23:06:33,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:33,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:33,827 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:33,827 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:33,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:33,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-27 23:06:33,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:33,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231270095] [2019-12-27 23:06:33,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:33,876 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:33,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231270095] [2019-12-27 23:06:33,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:33,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:33,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [848958447] [2019-12-27 23:06:33,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:33,879 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:33,881 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 23:06:33,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:33,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:33,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:06:33,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:33,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:06:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:06:33,882 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-27 23:06:35,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:35,503 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-27 23:06:35,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:06:35,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 23:06:35,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:35,839 INFO L225 Difference]: With dead ends: 111816 [2019-12-27 23:06:35,839 INFO L226 Difference]: Without dead ends: 111807 [2019-12-27 23:06:35,839 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:36,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-27 23:06:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-27 23:06:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-27 23:06:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-27 23:06:37,631 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-27 23:06:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:37,632 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-27 23:06:37,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:06:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-27 23:06:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:37,633 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:37,633 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:37,633 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:37,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:37,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-27 23:06:37,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:37,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135945796] [2019-12-27 23:06:37,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:37,696 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:37,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135945796] [2019-12-27 23:06:37,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:37,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:37,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602095139] [2019-12-27 23:06:37,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:37,698 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:37,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 23:06:37,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:37,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:06:37,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:06:37,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:37,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:06:37,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:06:37,749 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 13 states. [2019-12-27 23:06:38,711 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-27 23:06:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:40,261 INFO L93 Difference]: Finished difference Result 127187 states and 567692 transitions. [2019-12-27 23:06:40,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 23:06:40,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 23:06:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:40,628 INFO L225 Difference]: With dead ends: 127187 [2019-12-27 23:06:40,628 INFO L226 Difference]: Without dead ends: 127174 [2019-12-27 23:06:40,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:06:40,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127174 states. [2019-12-27 23:06:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127174 to 31950. [2019-12-27 23:06:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-27 23:06:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-27 23:06:43,056 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-27 23:06:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:43,057 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-27 23:06:43,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:06:43,057 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-27 23:06:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 23:06:43,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:43,058 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:43,058 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:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-27 23:06:43,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:43,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894142471] [2019-12-27 23:06:43,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:43,109 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:43,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894142471] [2019-12-27 23:06:43,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:43,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:06:43,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [553034591] [2019-12-27 23:06:43,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:43,112 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:43,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 23:06:43,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:43,233 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:06:43,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:06:43,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:06:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:06:43,234 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 17 states. [2019-12-27 23:06:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:46,253 INFO L93 Difference]: Finished difference Result 131458 states and 578305 transitions. [2019-12-27 23:06:46,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 23:06:46,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 23:06:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:46,632 INFO L225 Difference]: With dead ends: 131458 [2019-12-27 23:06:46,633 INFO L226 Difference]: Without dead ends: 131442 [2019-12-27 23:06:46,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3232 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 23:06:47,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131442 states. [2019-12-27 23:06:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131442 to 30899. [2019-12-27 23:06:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 23:06:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 23:06:49,010 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 23:06:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:49,011 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 23:06:49,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:06:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 23:06:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:06:49,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:49,012 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,012 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,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-27 23:06:49,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:49,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334211339] [2019-12-27 23:06:49,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:49,080 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,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334211339] [2019-12-27 23:06:49,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510591019] [2019-12-27 23:06:49,081 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,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:49,172 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:06:49,173 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:49,188 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,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:49,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:06:49,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94306228] [2019-12-27 23:06:49,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:49,191 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:49,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 23:06:49,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:49,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:06:49,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:06:49,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:49,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:06:49,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:06:49,274 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 11 states. [2019-12-27 23:06:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:50,113 INFO L93 Difference]: Finished difference Result 79677 states and 379896 transitions. [2019-12-27 23:06:50,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:06:50,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 23:06:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:50,823 INFO L225 Difference]: With dead ends: 79677 [2019-12-27 23:06:50,823 INFO L226 Difference]: Without dead ends: 79658 [2019-12-27 23:06:50,823 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:51,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79658 states. [2019-12-27 23:06:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79658 to 31876. [2019-12-27 23:06:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 23:06:52,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 23:06:52,028 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 23:06:52,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:52,028 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 23:06:52,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:06:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 23:06:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:06:52,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:52,030 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,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:52,231 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,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:52,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-27 23:06:52,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:52,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918472853] [2019-12-27 23:06:52,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:52,264 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,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918472853] [2019-12-27 23:06:52,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676499937] [2019-12-27 23:06:52,264 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,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:52,356 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 23:06:52,357 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:06:52,372 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,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:06:52,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 23:06:52,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2066385410] [2019-12-27 23:06:52,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:52,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:52,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 23:06:52,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:52,380 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:06:52,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:52,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:52,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:52,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:06:52,381 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-27 23:06:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:52,992 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-27 23:06:52,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:52,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:06:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:53,216 INFO L225 Difference]: With dead ends: 77025 [2019-12-27 23:06:53,216 INFO L226 Difference]: Without dead ends: 77011 [2019-12-27 23:06:53,216 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,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-27 23:06:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-27 23:06:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-27 23:06:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-27 23:06:54,806 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-27 23:06:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:54,806 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-27 23:06:54,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-27 23:06:54,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:06:54,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:54,808 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:55,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:06:55,009 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:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-27 23:06:55,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:55,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122691566] [2019-12-27 23:06:55,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:55,044 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:55,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122691566] [2019-12-27 23:06:55,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:55,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:55,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972948473] [2019-12-27 23:06:55,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:55,047 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:55,050 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:06:55,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:55,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:55,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:55,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:55,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:55,051 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-27 23:06:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:55,681 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-27 23:06:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:55,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:06:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:55,924 INFO L225 Difference]: With dead ends: 78384 [2019-12-27 23:06:55,925 INFO L226 Difference]: Without dead ends: 78365 [2019-12-27 23:06:55,925 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:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-27 23:06:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-27 23:06:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-27 23:06:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-27 23:06:57,671 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-27 23:06:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:06:57,671 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-27 23:06:57,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:06:57,672 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-27 23:06:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:06:57,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:06:57,674 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:57,674 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:06:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:06:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-27 23:06:57,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:06:57,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529046624] [2019-12-27 23:06:57,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:06:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:06:57,724 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:57,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529046624] [2019-12-27 23:06:57,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:06:57,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:06:57,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [206925043] [2019-12-27 23:06:57,725 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:06:57,727 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:06:57,731 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:06:57,731 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:06:57,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:06:57,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:06:57,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:06:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:06:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:06:57,733 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-27 23:06:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:06:58,361 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-27 23:06:58,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:06:58,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:06:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:06:58,602 INFO L225 Difference]: With dead ends: 78506 [2019-12-27 23:06:58,602 INFO L226 Difference]: Without dead ends: 78487 [2019-12-27 23:06:58,602 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:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-27 23:07:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-27 23:07:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-27 23:07:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-27 23:07:00,460 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-27 23:07:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:00,460 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-27 23:07:00,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:07:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-27 23:07:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:07:00,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:00,462 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,462 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:00,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:00,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-27 23:07:00,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:00,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079499613] [2019-12-27 23:07:00,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:00,496 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,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079499613] [2019-12-27 23:07:00,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:00,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:07:00,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [255106512] [2019-12-27 23:07:00,497 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:00,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:00,501 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:07:00,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:00,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:07:00,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:07:00,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:00,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:07:00,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:07:00,502 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-27 23:07:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:01,145 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-27 23:07:01,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:07:01,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 23:07:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:01,409 INFO L225 Difference]: With dead ends: 80886 [2019-12-27 23:07:01,410 INFO L226 Difference]: Without dead ends: 80867 [2019-12-27 23:07:01,410 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:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-27 23:07:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-27 23:07:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-27 23:07:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-27 23:07:03,471 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-27 23:07:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:03,471 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-27 23:07:03,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:07:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-27 23:07:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:07:03,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:03,473 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,474 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:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:03,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-27 23:07:03,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:03,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322777807] [2019-12-27 23:07:03,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:03,506 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,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322777807] [2019-12-27 23:07:03,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:03,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:07:03,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705914070] [2019-12-27 23:07:03,507 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:03,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:03,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 23:07:03,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:03,609 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:07:03,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:03,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:03,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:07:03,610 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 13 states. [2019-12-27 23:07:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:04,669 INFO L93 Difference]: Finished difference Result 93460 states and 441982 transitions. [2019-12-27 23:07:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:07:04,669 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 23:07:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:04,945 INFO L225 Difference]: With dead ends: 93460 [2019-12-27 23:07:04,945 INFO L226 Difference]: Without dead ends: 93431 [2019-12-27 23:07:04,945 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:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93431 states. [2019-12-27 23:07:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93431 to 35912. [2019-12-27 23:07:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 23:07:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 23:07:07,001 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 23:07:07,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:07,001 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 23:07:07,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 23:07:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:07,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:07,004 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:07,004 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:07,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-27 23:07:07,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:07,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227537331] [2019-12-27 23:07:07,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:07,100 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:07,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227537331] [2019-12-27 23:07:07,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695791735] [2019-12-27 23:07:07,101 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:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:07,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:07,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:07,249 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:07,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:07,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:07,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [220785817] [2019-12-27 23:07:07,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:07,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:07,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 23:07:07,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:07,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:07:07,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:07:07,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:07,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:07:07,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:07:07,396 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 17 states. [2019-12-27 23:07:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:09,709 INFO L93 Difference]: Finished difference Result 135566 states and 606990 transitions. [2019-12-27 23:07:09,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:07:09,709 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 23:07:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:10,129 INFO L225 Difference]: With dead ends: 135566 [2019-12-27 23:07:10,129 INFO L226 Difference]: Without dead ends: 135548 [2019-12-27 23:07:10,130 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:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135548 states. [2019-12-27 23:07:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135548 to 35598. [2019-12-27 23:07:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-27 23:07:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-27 23:07:15,286 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-27 23:07:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:15,286 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-27 23:07:15,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:07:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-27 23:07:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:15,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:15,289 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:15,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:15,490 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:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-27 23:07:15,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:15,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544827001] [2019-12-27 23:07:15,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:15,538 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:15,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544827001] [2019-12-27 23:07:15,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336548516] [2019-12-27 23:07:15,538 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:15,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:07:15,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:15,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:15,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:15,654 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:15,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:15,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:15,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581620904] [2019-12-27 23:07:15,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:15,656 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:15,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:07:15,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:15,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:07:15,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:15,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:15,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:15,763 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 13 states. [2019-12-27 23:07:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:18,461 INFO L93 Difference]: Finished difference Result 129234 states and 584373 transitions. [2019-12-27 23:07:18,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:07:18,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:07:18,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:18,831 INFO L225 Difference]: With dead ends: 129234 [2019-12-27 23:07:18,831 INFO L226 Difference]: Without dead ends: 129215 [2019-12-27 23:07:18,832 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:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129215 states. [2019-12-27 23:07:20,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129215 to 35531. [2019-12-27 23:07:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 23:07:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-27 23:07:24,702 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-27 23:07:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:24,702 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-27 23:07:24,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-27 23:07:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:24,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:24,706 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:24,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:24,907 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:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-27 23:07:24,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:24,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701050939] [2019-12-27 23:07:24,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:24,962 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:24,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701050939] [2019-12-27 23:07:24,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238713602] [2019-12-27 23:07:24,962 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:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:25,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:25,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:25,068 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:25,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:25,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:25,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182989994] [2019-12-27 23:07:25,069 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:25,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:25,079 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 23:07:25,079 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:25,165 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 23:07:25,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:25,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:25,166 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 13 states. [2019-12-27 23:07:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:26,955 INFO L93 Difference]: Finished difference Result 128198 states and 579481 transitions. [2019-12-27 23:07:26,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:07:26,956 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:07:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:27,326 INFO L225 Difference]: With dead ends: 128198 [2019-12-27 23:07:27,326 INFO L226 Difference]: Without dead ends: 128180 [2019-12-27 23:07:27,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=665, Invalid=2091, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 23:07:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128180 states. [2019-12-27 23:07:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128180 to 35223. [2019-12-27 23:07:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-27 23:07:29,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-27 23:07:29,596 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-27 23:07:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:29,596 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-27 23:07:29,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-27 23:07:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:29,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:29,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:07:29,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:29,800 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:29,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:29,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-27 23:07:29,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:29,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123798027] [2019-12-27 23:07:29,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:29,846 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:29,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123798027] [2019-12-27 23:07:29,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633592619] [2019-12-27 23:07:29,847 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:29,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:07:29,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:29,937 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:29,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:29,964 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:29,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:29,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:29,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952350823] [2019-12-27 23:07:29,965 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:29,967 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:29,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 23:07:29,979 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:30,184 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 23:07:30,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:07:30,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:30,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:07:30,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:07:30,186 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 19 states. [2019-12-27 23:07:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:33,472 INFO L93 Difference]: Finished difference Result 132194 states and 590498 transitions. [2019-12-27 23:07:33,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 23:07:33,472 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 23:07:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:33,873 INFO L225 Difference]: With dead ends: 132194 [2019-12-27 23:07:33,873 INFO L226 Difference]: Without dead ends: 132175 [2019-12-27 23:07:33,873 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:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132175 states. [2019-12-27 23:07:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132175 to 34934. [2019-12-27 23:07:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 23:07:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 23:07:35,677 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 23:07:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:35,678 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 23:07:35,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:07:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 23:07:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:35,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:35,680 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:35,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:35,881 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:35,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:35,882 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-27 23:07:35,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:35,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995290369] [2019-12-27 23:07:35,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:35,926 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:35,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995290369] [2019-12-27 23:07:35,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282324061] [2019-12-27 23:07:35,926 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:36,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 23:07:36,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:36,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:36,018 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:36,031 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:36,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:36,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:36,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866903673] [2019-12-27 23:07:36,033 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:36,035 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:36,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:07:36,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:36,069 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 23:07:36,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:07:36,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:36,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:07:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:07:36,070 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 11 states. [2019-12-27 23:07:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:37,922 INFO L93 Difference]: Finished difference Result 126084 states and 571437 transitions. [2019-12-27 23:07:37,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:07:37,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 23:07:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:38,282 INFO L225 Difference]: With dead ends: 126084 [2019-12-27 23:07:38,283 INFO L226 Difference]: Without dead ends: 126070 [2019-12-27 23:07:38,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 23:07:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126070 states. [2019-12-27 23:07:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126070 to 34396. [2019-12-27 23:07:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-27 23:07:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-27 23:07:43,343 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-27 23:07:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:43,343 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-27 23:07:43,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:07:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-27 23:07:43,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:43,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:43,345 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:43,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:43,546 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:43,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:43,547 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-27 23:07:43,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:43,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384092185] [2019-12-27 23:07:43,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:43,597 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:43,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384092185] [2019-12-27 23:07:43,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24893050] [2019-12-27 23:07:43,598 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:43,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:07:43,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:43,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:43,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:43,733 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:43,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:43,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:43,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465319179] [2019-12-27 23:07:43,733 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:43,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:43,744 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:07:43,744 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:43,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:07:43,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:07:43,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:43,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:07:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:07:43,746 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-27 23:07:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:44,858 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-27 23:07:44,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:07:44,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:07:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:45,239 INFO L225 Difference]: With dead ends: 117673 [2019-12-27 23:07:45,239 INFO L226 Difference]: Without dead ends: 117662 [2019-12-27 23:07:45,240 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,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-27 23:07:47,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-27 23:07:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-27 23:07:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-27 23:07:47,448 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-27 23:07:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:47,448 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-27 23:07:47,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:07:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-27 23:07:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:47,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:47,451 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:47,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:47,651 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:47,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:47,652 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-27 23:07:47,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:47,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494121472] [2019-12-27 23:07:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:47,694 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,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494121472] [2019-12-27 23:07:47,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169659957] [2019-12-27 23:07:47,695 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,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:47,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:47,788 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:47,808 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,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:47,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:47,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527386309] [2019-12-27 23:07:47,809 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:47,811 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:47,816 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 23:07:47,816 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:47,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:07:47,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:07:47,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:07:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:07:47,817 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-27 23:07:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:49,079 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-27 23:07:49,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:07:49,080 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:07:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:49,427 INFO L225 Difference]: With dead ends: 117232 [2019-12-27 23:07:49,427 INFO L226 Difference]: Without dead ends: 117222 [2019-12-27 23:07:49,428 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,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-27 23:07:51,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-27 23:07:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-27 23:07:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-27 23:07:51,821 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-27 23:07:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:51,821 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-27 23:07:51,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:07:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-27 23:07:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:51,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:51,823 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:52,026 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:52,027 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:52,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-27 23:07:52,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:52,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328831574] [2019-12-27 23:07:52,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:52,071 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:52,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328831574] [2019-12-27 23:07:52,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755002645] [2019-12-27 23:07:52,072 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:52,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:07:52,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:07:52,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 23:07:52,166 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:07:52,182 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:52,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:07:52,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 23:07:52,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241393713] [2019-12-27 23:07:52,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:52,184 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:52,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 23:07:52,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:52,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 23:07:52,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:07:52,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:52,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:07:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:07:52,238 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 13 states. [2019-12-27 23:07:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:54,401 INFO L93 Difference]: Finished difference Result 130450 states and 586382 transitions. [2019-12-27 23:07:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-27 23:07:54,402 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 23:07:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:55,480 INFO L225 Difference]: With dead ends: 130450 [2019-12-27 23:07:55,480 INFO L226 Difference]: Without dead ends: 130431 [2019-12-27 23:07:55,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 23:07:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130431 states. [2019-12-27 23:07:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130431 to 33768. [2019-12-27 23:07:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 23:07:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-27 23:07:57,121 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-27 23:07:57,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:57,122 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-27 23:07:57,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:07:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-27 23:07:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:57,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:57,125 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:57,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:07:57,326 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:57,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-27 23:07:57,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:57,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627569799] [2019-12-27 23:07:57,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:57,346 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:57,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627569799] [2019-12-27 23:07:57,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:57,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:07:57,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [384890115] [2019-12-27 23:07:57,347 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:57,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:57,351 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:07:57,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:57,352 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:07:57,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:07:57,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:57,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:07:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:07:57,352 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-27 23:07:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:07:57,741 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-27 23:07:57,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:07:57,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 23:07:57,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:07:57,928 INFO L225 Difference]: With dead ends: 59584 [2019-12-27 23:07:57,929 INFO L226 Difference]: Without dead ends: 59552 [2019-12-27 23:07:57,929 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:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-27 23:07:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-27 23:07:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-27 23:07:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-27 23:07:59,483 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-27 23:07:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:07:59,484 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-27 23:07:59,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:07:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-27 23:07:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:07:59,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:07:59,487 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:59,487 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:07:59,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:07:59,487 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-27 23:07:59,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:07:59,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695907513] [2019-12-27 23:07:59,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:07:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:07:59,554 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:59,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695907513] [2019-12-27 23:07:59,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:07:59,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:07:59,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481754725] [2019-12-27 23:07:59,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:07:59,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:07:59,562 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:07:59,562 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:07:59,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:07:59,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:07:59,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:07:59,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:07:59,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:07:59,563 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-27 23:08:00,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:00,832 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-27 23:08:00,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:08:00,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:08:00,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:02,030 INFO L225 Difference]: With dead ends: 137478 [2019-12-27 23:08:02,031 INFO L226 Difference]: Without dead ends: 137462 [2019-12-27 23:08:02,031 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:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-27 23:08:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-27 23:08:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-27 23:08:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-27 23:08:03,933 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-27 23:08:03,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:03,934 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-27 23:08:03,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:08:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-27 23:08:03,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:08:03,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:03,936 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:03,937 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:03,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:03,937 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-27 23:08:03,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:03,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848943360] [2019-12-27 23:08:03,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:03,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:03,992 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:03,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848943360] [2019-12-27 23:08:03,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:03,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:08:03,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2091489023] [2019-12-27 23:08:03,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:03,996 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:04,001 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:08:04,001 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:04,001 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:04,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:08:04,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:04,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:08:04,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:08:04,002 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-27 23:08:05,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:05,732 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-27 23:08:05,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:08:05,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:08:05,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:06,146 INFO L225 Difference]: With dead ends: 136774 [2019-12-27 23:08:06,146 INFO L226 Difference]: Without dead ends: 136758 [2019-12-27 23:08:06,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:08:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. [2019-12-27 23:08:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-27 23:08:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-27 23:08:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41129 states to 41129 states and 222593 transitions. [2019-12-27 23:08:11,699 INFO L78 Accepts]: Start accepts. Automaton has 41129 states and 222593 transitions. Word has length 25 [2019-12-27 23:08:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:11,700 INFO L462 AbstractCegarLoop]: Abstraction has 41129 states and 222593 transitions. [2019-12-27 23:08:11,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:08:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 41129 states and 222593 transitions. [2019-12-27 23:08:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:08:11,702 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:11,702 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:11,702 INFO L410 AbstractCegarLoop]: === Iteration 35 === [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:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash -61078994, now seen corresponding path program 6 times [2019-12-27 23:08:11,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:11,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69589444] [2019-12-27 23:08:11,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:11,752 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:11,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69589444] [2019-12-27 23:08:11,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:11,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:08:11,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [373896471] [2019-12-27 23:08:11,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:11,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:11,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:08:11,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:11,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:11,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:08:11,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:08:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:08:11,760 INFO L87 Difference]: Start difference. First operand 41129 states and 222593 transitions. Second operand 9 states. [2019-12-27 23:08:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:13,097 INFO L93 Difference]: Finished difference Result 134734 states and 630461 transitions. [2019-12-27 23:08:13,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:08:13,097 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:08:13,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:08:13,495 INFO L225 Difference]: With dead ends: 134734 [2019-12-27 23:08:13,496 INFO L226 Difference]: Without dead ends: 134714 [2019-12-27 23:08:13,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:08:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134714 states. [2019-12-27 23:08:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134714 to 39950. [2019-12-27 23:08:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2019-12-27 23:08:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 216201 transitions. [2019-12-27 23:08:16,153 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 216201 transitions. Word has length 25 [2019-12-27 23:08:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:08:16,153 INFO L462 AbstractCegarLoop]: Abstraction has 39950 states and 216201 transitions. [2019-12-27 23:08:16,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:08:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 216201 transitions. [2019-12-27 23:08:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 23:08:16,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:08:16,155 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:16,156 INFO L410 AbstractCegarLoop]: === Iteration 36 === [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:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:08:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash -61103236, now seen corresponding path program 3 times [2019-12-27 23:08:16,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:08:16,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508704173] [2019-12-27 23:08:16,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:08:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:08:16,216 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:16,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508704173] [2019-12-27 23:08:16,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:08:16,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:08:16,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [699247372] [2019-12-27 23:08:16,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:08:16,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:08:16,223 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 23:08:16,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:08:16,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:08:16,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:08:16,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:08:16,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:08:16,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:08:16,224 INFO L87 Difference]: Start difference. First operand 39950 states and 216201 transitions. Second operand 9 states. [2019-12-27 23:08:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:08:17,488 INFO L93 Difference]: Finished difference Result 134487 states and 629694 transitions. [2019-12-27 23:08:17,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:08:17,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 23:08:17,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2019-12-27 23:08:18,836 INFO L225 Difference]: With dead ends: 134487 [2019-12-27 23:08:18,836 INFO L226 Difference]: Without dead ends: 134471 [2019-12-27 23:08:18,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:08:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134471 states. [2019-12-27 23:08:19,082 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 23:08:19,085 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 23:08:19,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:08:19 BasicIcfg [2019-12-27 23:08:19,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:08:19,086 INFO L168 Benchmark]: Toolchain (without parser) took 231614.67 ms. Allocated memory was 145.2 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 102.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 23:08:19,087 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 23:08:19,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.42 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 162.2 MB in the end (delta: -60.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:19,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.05 ms. Allocated memory is still 202.9 MB. Free memory was 162.2 MB in the beginning and 160.2 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:19,087 INFO L168 Benchmark]: Boogie Preprocessor took 25.19 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:19,088 INFO L168 Benchmark]: RCFGBuilder took 410.10 ms. Allocated memory is still 202.9 MB. Free memory was 158.8 MB in the beginning and 139.6 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:08:19,088 INFO L168 Benchmark]: TraceAbstraction took 230455.83 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 139.6 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 23:08:19,090 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.24 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 673.42 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 162.2 MB in the end (delta: -60.6 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.05 ms. Allocated memory is still 202.9 MB. Free memory was 162.2 MB in the beginning and 160.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.19 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 410.10 ms. Allocated memory is still 202.9 MB. Free memory was 158.8 MB in the beginning and 139.6 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 230455.83 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 139.6 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.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.3s, 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.8s, 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 executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 145.0s, OverallIterations: 36, TraceHistogramMax: 5, AutomataDifference: 60.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2740 SDtfs, 10402 SDslu, 9342 SDs, 0 SdLazy, 14020 SolverSat, 1011 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1527 GetRequests, 382 SyntacticMatches, 17 SemanticMatches, 1128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16331 ImplicationChecksByTransitivity, 13.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: 73.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 2130106 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1080 NumberOfCodeBlocks, 1072 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1030 ConstructedInterpolants, 0 QuantifiedInterpolants, 66732 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 50 InterpolantComputations, 22 PerfectInterpolantSequences, 480/674 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