/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-SemanticLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 11:42:17,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 11:42:17,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 11:42:17,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 11:42:17,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 11:42:17,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 11:42:17,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 11:42:17,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 11:42:17,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 11:42:17,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 11:42:17,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 11:42:17,377 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 11:42:17,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 11:42:17,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 11:42:17,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 11:42:17,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 11:42:17,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 11:42:17,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 11:42:17,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 11:42:17,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 11:42:17,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 11:42:17,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 11:42:17,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 11:42:17,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 11:42:17,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 11:42:17,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 11:42:17,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 11:42:17,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 11:42:17,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 11:42:17,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 11:42:17,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 11:42:17,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 11:42:17,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 11:42:17,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 11:42:17,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 11:42:17,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 11:42:17,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 11:42:17,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 11:42:17,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 11:42:17,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 11:42:17,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 11:42:17,411 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-SemanticLbe-McrStrategy.epf [2020-04-18 11:42:17,425 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 11:42:17,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 11:42:17,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 11:42:17,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 11:42:17,427 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 11:42:17,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 11:42:17,428 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 11:42:17,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 11:42:17,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 11:42:17,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 11:42:17,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 11:42:17,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 11:42:17,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 11:42:17,430 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 11:42:17,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 11:42:17,431 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 11:42:17,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 11:42:17,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 11:42:17,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 11:42:17,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 11:42:17,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 11:42:17,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 11:42:17,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 11:42:17,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 11:42:17,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 11:42:17,433 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 11:42:17,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 11:42:17,434 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 11:42:17,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 11:42:17,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 11:42:17,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 11:42:17,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 11:42:17,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 11:42:17,724 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 11:42:17,725 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 11:42:17,725 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i [2020-04-18 11:42:17,797 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04dd3751/851172ff54f44155b45557713c1f088b/FLAGf473e5da3 [2020-04-18 11:42:18,341 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 11:42:18,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-variant-1.i [2020-04-18 11:42:18,354 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04dd3751/851172ff54f44155b45557713c1f088b/FLAGf473e5da3 [2020-04-18 11:42:18,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a04dd3751/851172ff54f44155b45557713c1f088b [2020-04-18 11:42:18,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 11:42:18,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 11:42:18,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 11:42:18,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 11:42:18,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 11:42:18,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:42:18" (1/1) ... [2020-04-18 11:42:18,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a30e0a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:18, skipping insertion in model container [2020-04-18 11:42:18,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 11:42:18" (1/1) ... [2020-04-18 11:42:18,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 11:42:18,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 11:42:19,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:42:19,260 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 11:42:19,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 11:42:19,407 INFO L208 MainTranslator]: Completed translation [2020-04-18 11:42:19,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19 WrapperNode [2020-04-18 11:42:19,408 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 11:42:19,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 11:42:19,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 11:42:19,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 11:42:19,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 11:42:19,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 11:42:19,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 11:42:19,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 11:42:19,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,528 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (1/1) ... [2020-04-18 11:42:19,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 11:42:19,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 11:42:19,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 11:42:19,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 11:42:19,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (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 [2020-04-18 11:42:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2020-04-18 11:42:19,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2020-04-18 11:42:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2020-04-18 11:42:19,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2020-04-18 11:42:19,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 11:42:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-18 11:42:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 11:42:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 11:42:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 11:42:19,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 11:42:19,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 11:42:19,610 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 11:42:20,041 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 11:42:20,041 INFO L295 CfgBuilder]: Removed 11 assume(true) statements. [2020-04-18 11:42:20,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:42:20 BoogieIcfgContainer [2020-04-18 11:42:20,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 11:42:20,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 11:42:20,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 11:42:20,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 11:42:20,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 11:42:18" (1/3) ... [2020-04-18 11:42:20,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55538e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:42:20, skipping insertion in model container [2020-04-18 11:42:20,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 11:42:19" (2/3) ... [2020-04-18 11:42:20,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55538e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 11:42:20, skipping insertion in model container [2020-04-18 11:42:20,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 11:42:20" (3/3) ... [2020-04-18 11:42:20,056 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2020-04-18 11:42:20,067 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 11:42:20,067 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 11:42:20,076 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-04-18 11:42:20,077 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 11:42:20,105 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,106 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,106 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,106 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,107 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,107 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,108 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,108 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,108 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,109 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,109 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,110 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,110 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,110 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,111 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,112 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,113 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,113 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,113 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,113 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,114 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,114 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,114 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,115 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,115 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,115 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,119 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,119 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,120 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,120 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,120 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,120 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,121 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,121 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,121 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,121 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,127 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,128 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,128 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,128 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,129 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:20,146 INFO L251 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-04-18 11:42:20,168 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:20,168 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:20,168 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:20,169 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:20,169 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:20,169 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:20,169 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:20,169 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:20,186 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 76 transitions, 162 flow [2020-04-18 11:42:20,188 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 11:42:20,237 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 11:42:20,237 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 11:42:20,243 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 11:42:20,247 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 76 transitions, 162 flow [2020-04-18 11:42:20,271 INFO L129 PetriNetUnfolder]: 6/86 cut-off events. [2020-04-18 11:42:20,272 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-04-18 11:42:20,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 86 events. 6/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2020-04-18 11:42:20,275 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1242 [2020-04-18 11:42:20,276 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:21,667 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-04-18 11:42:22,162 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-04-18 11:42:22,680 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-04-18 11:42:23,192 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:42:23,347 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:23,352 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1089 [2020-04-18 11:42:23,352 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-04-18 11:42:23,356 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 12 transitions, 34 flow [2020-04-18 11:42:23,364 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2020-04-18 11:42:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-04-18 11:42:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:23,371 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:23,371 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:42:23,372 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:23,377 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 1 times [2020-04-18 11:42:23,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:23,383 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [692550701] [2020-04-18 11:42:23,398 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:23,409 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:42:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:23,411 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:23,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:23,412 INFO L82 PathProgramCache]: Analyzing trace with hash 313215, now seen corresponding path program 2 times [2020-04-18 11:42:23,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:23,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305942814] [2020-04-18 11:42:23,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:23,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305942814] [2020-04-18 11:42:23,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:23,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:42:23,621 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:23,622 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:23,624 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:23,624 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:23,639 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:23,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:23,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:23,646 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:42:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:23,658 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:42:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:42:23,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:23,660 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [692550701] [2020-04-18 11:42:23,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:23,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:42:23,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [692550701] [2020-04-18 11:42:23,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:42:23,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:23,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:23,674 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2020-04-18 11:42:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:23,701 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2020-04-18 11:42:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:42:23,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:42:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:23,711 INFO L225 Difference]: With dead ends: 35 [2020-04-18 11:42:23,712 INFO L226 Difference]: Without dead ends: 31 [2020-04-18 11:42:23,713 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-04-18 11:42:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-04-18 11:42:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-04-18 11:42:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2020-04-18 11:42:23,744 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2020-04-18 11:42:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:23,744 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2020-04-18 11:42:23,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:42:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2020-04-18 11:42:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:42:23,745 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:23,745 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:23,745 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:23,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 1 times [2020-04-18 11:42:23,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:23,746 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [47335251] [2020-04-18 11:42:23,747 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:23,748 INFO L259 McrAutomatonBuilder]: Finished intersection with 12 states and 15 transitions. [2020-04-18 11:42:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-04-18 11:42:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:42:23,749 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:23,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583485, now seen corresponding path program 2 times [2020-04-18 11:42:23,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:23,750 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124471653] [2020-04-18 11:42:23,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:23,836 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124471653] [2020-04-18 11:42:23,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:23,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:23,837 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:23,839 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:23,843 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 13 transitions. [2020-04-18 11:42:23,843 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:23,861 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:42:23,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:23,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:23,862 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 5 states. [2020-04-18 11:42:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:23,879 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 11:42:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 11:42:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-04-18 11:42:23,880 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:23,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1465583995, now seen corresponding path program 3 times [2020-04-18 11:42:23,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:23,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231054965] [2020-04-18 11:42:23,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:23,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231054965] [2020-04-18 11:42:23,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:23,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:23,971 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:23,971 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:23,974 INFO L259 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-04-18 11:42:23,987 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:24,000 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:24,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 11:42:24,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:42:24,001 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2020-04-18 11:42:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:24,019 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-04-18 11:42:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-04-18 11:42:24,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:24,020 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [47335251] [2020-04-18 11:42:24,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:24,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 11:42:24,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [47335251] [2020-04-18 11:42:24,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 11:42:24,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:24,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:42:24,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:42:24,022 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 6 states. [2020-04-18 11:42:24,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:24,079 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2020-04-18 11:42:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:24,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-04-18 11:42:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:24,080 INFO L225 Difference]: With dead ends: 26 [2020-04-18 11:42:24,080 INFO L226 Difference]: Without dead ends: 24 [2020-04-18 11:42:24,082 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:42:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-04-18 11:42:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-04-18 11:42:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-04-18 11:42:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2020-04-18 11:42:24,086 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2020-04-18 11:42:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:24,086 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2020-04-18 11:42:24,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 11:42:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2020-04-18 11:42:24,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 11:42:24,087 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:24,087 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:24,087 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:24,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:24,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 1 times [2020-04-18 11:42:24,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:24,088 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [184938079] [2020-04-18 11:42:24,089 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:24,089 INFO L259 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-04-18 11:42:24,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-04-18 11:42:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-04-18 11:42:24,090 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:24,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1811562961, now seen corresponding path program 2 times [2020-04-18 11:42:24,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:24,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451641540] [2020-04-18 11:42:24,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:24,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:42:24,214 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:42:24,214 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:42:24,215 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:42:24,216 WARN L363 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:42:24,216 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2020-04-18 11:42:24,229 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,230 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,230 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,230 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,230 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,230 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,231 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,231 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,231 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,231 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,231 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,231 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,232 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,232 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,232 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,232 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,232 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,232 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,233 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,233 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,233 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,234 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,234 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,234 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,234 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,234 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,234 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,235 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,235 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,236 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,236 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,236 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,236 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,236 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,237 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,237 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,238 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,238 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,239 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,239 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,240 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,240 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,240 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,241 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,241 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,241 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,241 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,242 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,242 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,242 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,242 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,242 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,242 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,243 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,245 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,246 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,247 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,249 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,249 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:24,252 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 11:42:24,252 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:24,252 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:24,253 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:24,253 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:24,253 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:24,253 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:24,253 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:24,253 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:24,255 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 234 flow [2020-04-18 11:42:24,256 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 11:42:24,281 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 11:42:24,281 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 11:42:24,282 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 11:42:24,286 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 234 flow [2020-04-18 11:42:24,306 INFO L129 PetriNetUnfolder]: 9/120 cut-off events. [2020-04-18 11:42:24,306 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-04-18 11:42:24,308 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 129. Up to 6 conditions per place. [2020-04-18 11:42:24,311 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2844 [2020-04-18 11:42:24,311 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:26,300 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2020-04-18 11:42:26,985 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:42:27,121 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:27,157 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3583 [2020-04-18 11:42:27,158 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2020-04-18 11:42:27,158 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 28 transitions, 80 flow [2020-04-18 11:42:27,188 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 632 states. [2020-04-18 11:42:27,188 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states. [2020-04-18 11:42:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:27,189 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:27,189 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:42:27,189 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 1 times [2020-04-18 11:42:27,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:27,190 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1735334622] [2020-04-18 11:42:27,191 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:27,191 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:42:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:27,192 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash 544994, now seen corresponding path program 2 times [2020-04-18 11:42:27,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:27,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581078646] [2020-04-18 11:42:27,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:27,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581078646] [2020-04-18 11:42:27,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:27,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:42:27,251 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:27,251 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:27,251 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:27,252 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:27,256 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:27,257 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:42:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:27,258 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:42:27,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:42:27,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:27,259 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1735334622] [2020-04-18 11:42:27,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:27,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:42:27,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1735334622] [2020-04-18 11:42:27,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:42:27,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:27,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:27,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:27,261 INFO L87 Difference]: Start difference. First operand 632 states. Second operand 3 states. [2020-04-18 11:42:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:27,309 INFO L93 Difference]: Finished difference Result 748 states and 2357 transitions. [2020-04-18 11:42:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:42:27,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:42:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:27,329 INFO L225 Difference]: With dead ends: 748 [2020-04-18 11:42:27,329 INFO L226 Difference]: Without dead ends: 691 [2020-04-18 11:42:27,330 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2020-04-18 11:42:27,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 612. [2020-04-18 11:42:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-04-18 11:42:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1968 transitions. [2020-04-18 11:42:27,437 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1968 transitions. Word has length 3 [2020-04-18 11:42:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:27,437 INFO L479 AbstractCegarLoop]: Abstraction has 612 states and 1968 transitions. [2020-04-18 11:42:27,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:42:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1968 transitions. [2020-04-18 11:42:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:27,438 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:27,438 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:27,439 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:27,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 1 times [2020-04-18 11:42:27,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:27,440 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1853407279] [2020-04-18 11:42:27,440 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:27,441 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:42:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:42:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:27,444 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:27,445 INFO L82 PathProgramCache]: Analyzing trace with hash 625478199, now seen corresponding path program 2 times [2020-04-18 11:42:27,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:27,445 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519840304] [2020-04-18 11:42:27,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:27,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519840304] [2020-04-18 11:42:27,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:27,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:27,541 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:27,542 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:27,543 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:42:27,544 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:27,563 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:27,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:27,564 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2020-04-18 11:42:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:27,593 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-04-18 11:42:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-04-18 11:42:27,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:27,594 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1853407279] [2020-04-18 11:42:27,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:27,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:27,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1853407279] [2020-04-18 11:42:27,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:27,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:27,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:27,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:27,595 INFO L87 Difference]: Start difference. First operand 612 states and 1968 transitions. Second operand 5 states. [2020-04-18 11:42:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:27,690 INFO L93 Difference]: Finished difference Result 900 states and 2708 transitions. [2020-04-18 11:42:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:27,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:42:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:27,700 INFO L225 Difference]: With dead ends: 900 [2020-04-18 11:42:27,701 INFO L226 Difference]: Without dead ends: 880 [2020-04-18 11:42:27,707 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2020-04-18 11:42:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 563. [2020-04-18 11:42:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2020-04-18 11:42:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1857 transitions. [2020-04-18 11:42:27,756 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1857 transitions. Word has length 10 [2020-04-18 11:42:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:27,758 INFO L479 AbstractCegarLoop]: Abstraction has 563 states and 1857 transitions. [2020-04-18 11:42:27,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1857 transitions. [2020-04-18 11:42:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:27,760 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:27,760 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:27,760 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 1 times [2020-04-18 11:42:27,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:27,761 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1314532471] [2020-04-18 11:42:27,762 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:27,763 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:42:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2020-04-18 11:42:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:27,764 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -696224660, now seen corresponding path program 2 times [2020-04-18 11:42:27,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:27,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145706782] [2020-04-18 11:42:27,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:27,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:42:27,821 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:42:27,822 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:42:27,822 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:42:27,822 WARN L363 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:42:27,824 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2020-04-18 11:42:27,838 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,838 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,838 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,840 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,841 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,842 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,842 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,842 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,842 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,842 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,842 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,853 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,858 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,858 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,858 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,858 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,859 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,859 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,859 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,859 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,859 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,859 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,860 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,860 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,860 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,860 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,860 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,860 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,862 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,862 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,862 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,865 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,870 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,870 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,873 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,873 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,873 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,873 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,873 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,873 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,881 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:27,886 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-04-18 11:42:27,886 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:27,886 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:27,886 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:27,886 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:27,886 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:27,887 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:27,887 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:27,887 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:27,889 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 134 transitions, 310 flow [2020-04-18 11:42:27,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 11:42:27,916 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 11:42:27,916 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 11:42:27,918 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 11:42:27,924 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 310 flow [2020-04-18 11:42:27,958 INFO L129 PetriNetUnfolder]: 12/154 cut-off events. [2020-04-18 11:42:27,958 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-04-18 11:42:27,960 INFO L80 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 154 events. 12/154 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 326 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 168. Up to 8 conditions per place. [2020-04-18 11:42:27,966 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 5130 [2020-04-18 11:42:27,966 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:30,630 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2020-04-18 11:42:31,509 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:42:31,649 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:31,660 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7545 [2020-04-18 11:42:31,660 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2020-04-18 11:42:31,661 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 38 transitions, 118 flow [2020-04-18 11:42:31,923 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3782 states. [2020-04-18 11:42:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states. [2020-04-18 11:42:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:31,924 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:31,924 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:42:31,924 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 1 times [2020-04-18 11:42:31,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:31,925 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1529383768] [2020-04-18 11:42:31,925 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:31,926 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:42:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:31,926 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:31,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:31,926 INFO L82 PathProgramCache]: Analyzing trace with hash 833041, now seen corresponding path program 2 times [2020-04-18 11:42:31,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:31,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294291810] [2020-04-18 11:42:31,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:31,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294291810] [2020-04-18 11:42:31,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:31,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:42:31,956 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:31,956 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:31,957 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:31,957 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:31,962 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:31,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:31,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:31,963 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:42:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:31,963 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:42:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:42:31,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:31,964 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1529383768] [2020-04-18 11:42:31,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:31,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:42:31,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1529383768] [2020-04-18 11:42:31,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:42:31,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:31,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:31,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:31,965 INFO L87 Difference]: Start difference. First operand 3782 states. Second operand 3 states. [2020-04-18 11:42:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:32,093 INFO L93 Difference]: Finished difference Result 4669 states and 19397 transitions. [2020-04-18 11:42:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:42:32,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:42:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:32,136 INFO L225 Difference]: With dead ends: 4669 [2020-04-18 11:42:32,137 INFO L226 Difference]: Without dead ends: 4342 [2020-04-18 11:42:32,137 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2020-04-18 11:42:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 3858. [2020-04-18 11:42:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2020-04-18 11:42:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 16290 transitions. [2020-04-18 11:42:32,336 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 16290 transitions. Word has length 3 [2020-04-18 11:42:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:32,336 INFO L479 AbstractCegarLoop]: Abstraction has 3858 states and 16290 transitions. [2020-04-18 11:42:32,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:42:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 16290 transitions. [2020-04-18 11:42:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:32,337 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:32,337 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:32,337 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:32,338 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 1 times [2020-04-18 11:42:32,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:32,338 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2130768303] [2020-04-18 11:42:32,339 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:32,339 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:42:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:42:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:32,341 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:32,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:32,341 INFO L82 PathProgramCache]: Analyzing trace with hash -887292407, now seen corresponding path program 2 times [2020-04-18 11:42:32,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:32,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322738107] [2020-04-18 11:42:32,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:32,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:32,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322738107] [2020-04-18 11:42:32,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:32,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:32,374 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:32,375 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:32,377 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 11:42:32,377 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:32,382 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:32,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:32,384 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 11:42:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:32,390 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:42:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:42:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:32,391 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash -642397451, now seen corresponding path program 3 times [2020-04-18 11:42:32,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:32,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546389356] [2020-04-18 11:42:32,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:32,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546389356] [2020-04-18 11:42:32,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:32,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:32,452 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:32,455 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:32,456 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:42:32,457 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:32,470 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:32,471 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 11:42:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:32,502 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:42:32,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:42:32,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:32,503 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2130768303] [2020-04-18 11:42:32,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:32,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:32,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2130768303] [2020-04-18 11:42:32,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:32,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:32,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:32,505 INFO L87 Difference]: Start difference. First operand 3858 states and 16290 transitions. Second operand 5 states. [2020-04-18 11:42:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:32,703 INFO L93 Difference]: Finished difference Result 6408 states and 25485 transitions. [2020-04-18 11:42:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:32,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:42:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:32,787 INFO L225 Difference]: With dead ends: 6408 [2020-04-18 11:42:32,787 INFO L226 Difference]: Without dead ends: 6352 [2020-04-18 11:42:32,788 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:32,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2020-04-18 11:42:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 3890. [2020-04-18 11:42:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3890 states. [2020-04-18 11:42:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 16721 transitions. [2020-04-18 11:42:33,081 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 16721 transitions. Word has length 10 [2020-04-18 11:42:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:33,081 INFO L479 AbstractCegarLoop]: Abstraction has 3890 states and 16721 transitions. [2020-04-18 11:42:33,081 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 16721 transitions. [2020-04-18 11:42:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:33,083 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:33,083 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:33,084 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:33,086 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 1 times [2020-04-18 11:42:33,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:33,086 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1262527264] [2020-04-18 11:42:33,087 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:33,088 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 11:42:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 11:42:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:33,089 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash 291634045, now seen corresponding path program 2 times [2020-04-18 11:42:33,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:33,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943361970] [2020-04-18 11:42:33,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:33,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943361970] [2020-04-18 11:42:33,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:33,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:33,251 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:33,252 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:33,255 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 11:42:33,256 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:33,262 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:33,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:33,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:33,262 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 11:42:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:33,267 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:42:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:42:33,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:33,268 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash -834312959, now seen corresponding path program 3 times [2020-04-18 11:42:33,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:33,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832392493] [2020-04-18 11:42:33,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:33,330 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832392493] [2020-04-18 11:42:33,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:33,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:33,330 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:33,331 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:33,334 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:42:33,334 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:33,348 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:33,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:33,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:33,349 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 11:42:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:33,375 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:42:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:42:33,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:33,376 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1262527264] [2020-04-18 11:42:33,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:33,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:33,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1262527264] [2020-04-18 11:42:33,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:33,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:33,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:33,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:33,377 INFO L87 Difference]: Start difference. First operand 3890 states and 16721 transitions. Second operand 5 states. [2020-04-18 11:42:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:33,530 INFO L93 Difference]: Finished difference Result 6754 states and 26605 transitions. [2020-04-18 11:42:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:33,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 11:42:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:33,562 INFO L225 Difference]: With dead ends: 6754 [2020-04-18 11:42:33,562 INFO L226 Difference]: Without dead ends: 6698 [2020-04-18 11:42:33,563 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2020-04-18 11:42:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 3876. [2020-04-18 11:42:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3876 states. [2020-04-18 11:42:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 16342 transitions. [2020-04-18 11:42:33,758 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 16342 transitions. Word has length 14 [2020-04-18 11:42:33,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:33,759 INFO L479 AbstractCegarLoop]: Abstraction has 3876 states and 16342 transitions. [2020-04-18 11:42:33,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 16342 transitions. [2020-04-18 11:42:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:33,761 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:33,761 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:33,761 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1249108271, now seen corresponding path program 1 times [2020-04-18 11:42:33,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:33,762 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [643877295] [2020-04-18 11:42:33,763 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:33,764 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 11:42:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 11:42:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:33,767 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1668101585, now seen corresponding path program 2 times [2020-04-18 11:42:33,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:33,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222152097] [2020-04-18 11:42:33,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:33,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222152097] [2020-04-18 11:42:33,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:33,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:33,794 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:33,796 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:33,804 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 11:42:33,805 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:33,811 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:33,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:33,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:33,812 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 11:42:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:33,822 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:42:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:42:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:33,822 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1831618405, now seen corresponding path program 3 times [2020-04-18 11:42:33,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:33,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724123439] [2020-04-18 11:42:33,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:33,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724123439] [2020-04-18 11:42:33,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:33,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:33,851 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:33,853 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:33,859 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 11:42:33,859 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:33,891 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:42:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:42:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:33,892 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 11:42:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:33,951 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:42:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:42:33,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:33,951 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [643877295] [2020-04-18 11:42:33,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:33,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:33,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [643877295] [2020-04-18 11:42:33,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 11:42:33,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:33,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:42:33,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:42:33,953 INFO L87 Difference]: Start difference. First operand 3876 states and 16342 transitions. Second operand 7 states. [2020-04-18 11:42:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:34,446 INFO L93 Difference]: Finished difference Result 3088 states and 8648 transitions. [2020-04-18 11:42:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 11:42:34,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 11:42:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:34,456 INFO L225 Difference]: With dead ends: 3088 [2020-04-18 11:42:34,456 INFO L226 Difference]: Without dead ends: 3088 [2020-04-18 11:42:34,456 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:42:34,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2020-04-18 11:42:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 1610. [2020-04-18 11:42:34,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2020-04-18 11:42:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 4847 transitions. [2020-04-18 11:42:34,517 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 4847 transitions. Word has length 17 [2020-04-18 11:42:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:34,517 INFO L479 AbstractCegarLoop]: Abstraction has 1610 states and 4847 transitions. [2020-04-18 11:42:34,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 11:42:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 4847 transitions. [2020-04-18 11:42:34,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:34,518 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:34,519 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:34,519 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:34,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:34,519 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 1 times [2020-04-18 11:42:34,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:34,520 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [96596208] [2020-04-18 11:42:34,520 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:34,522 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 11:42:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:42:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:34,523 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:34,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2035634917, now seen corresponding path program 2 times [2020-04-18 11:42:34,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:34,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784481658] [2020-04-18 11:42:34,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:34,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784481658] [2020-04-18 11:42:34,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:34,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:34,547 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:34,549 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:34,556 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 11:42:34,556 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:34,563 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:34,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:34,564 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:42:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:34,575 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 11:42:34,575 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 11:42:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:34,576 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1261580793, now seen corresponding path program 3 times [2020-04-18 11:42:34,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:34,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404379000] [2020-04-18 11:42:34,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:34,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404379000] [2020-04-18 11:42:34,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:34,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:42:34,627 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:34,629 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:34,637 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 11:42:34,637 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:34,649 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:34,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:34,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:34,650 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 11:42:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:34,696 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 11:42:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 11:42:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:34,697 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:34,697 INFO L82 PathProgramCache]: Analyzing trace with hash 229330979, now seen corresponding path program 4 times [2020-04-18 11:42:34,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:34,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215915926] [2020-04-18 11:42:34,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:34,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215915926] [2020-04-18 11:42:34,775 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073569651] [2020-04-18 11:42:34,776 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 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 [2020-04-18 11:42:34,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:42:34,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:42:34,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:42:34,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:42:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:34,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:42:34,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:42:34,942 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:34,944 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:34,952 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 11:42:34,952 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:35,034 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:35,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:42:35,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:42:35,035 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 11:42:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:35,240 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 11:42:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 11:42:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:35,241 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:35,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -2129177993, now seen corresponding path program 5 times [2020-04-18 11:42:35,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:35,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117998108] [2020-04-18 11:42:35,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:35,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117998108] [2020-04-18 11:42:35,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:35,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:35,268 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:35,270 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:35,274 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 11:42:35,274 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:35,290 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:35,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:42:35,291 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 11:42:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:35,304 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 11:42:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 11:42:35,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:35,305 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [96596208] [2020-04-18 11:42:35,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:35,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:35,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [96596208] [2020-04-18 11:42:35,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:42:35,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:42:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:42:35,308 INFO L87 Difference]: Start difference. First operand 1610 states and 4847 transitions. Second operand 13 states. [2020-04-18 11:42:35,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:35,866 INFO L93 Difference]: Finished difference Result 2817 states and 8005 transitions. [2020-04-18 11:42:35,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:42:35,867 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 11:42:35,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:35,878 INFO L225 Difference]: With dead ends: 2817 [2020-04-18 11:42:35,878 INFO L226 Difference]: Without dead ends: 2796 [2020-04-18 11:42:35,879 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:42:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2020-04-18 11:42:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 1515. [2020-04-18 11:42:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2020-04-18 11:42:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 4566 transitions. [2020-04-18 11:42:35,944 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 4566 transitions. Word has length 18 [2020-04-18 11:42:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:35,944 INFO L479 AbstractCegarLoop]: Abstraction has 1515 states and 4566 transitions. [2020-04-18 11:42:35,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:42:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 4566 transitions. [2020-04-18 11:42:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:35,946 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:35,946 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:36,160 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:42:36,160 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 1 times [2020-04-18 11:42:36,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:36,161 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2003571561] [2020-04-18 11:42:36,162 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:36,163 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 11:42:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 11:42:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:36,165 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:36,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash 171542214, now seen corresponding path program 2 times [2020-04-18 11:42:36,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:36,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459568449] [2020-04-18 11:42:36,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:36,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459568449] [2020-04-18 11:42:36,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:36,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:36,200 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:36,202 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:36,211 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 11:42:36,211 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:36,218 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:36,219 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 11:42:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:36,274 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 11:42:36,275 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 11:42:36,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:36,275 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:36,276 INFO L82 PathProgramCache]: Analyzing trace with hash 945596338, now seen corresponding path program 3 times [2020-04-18 11:42:36,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:36,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15137496] [2020-04-18 11:42:36,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:36,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15137496] [2020-04-18 11:42:36,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:36,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:36,311 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:36,313 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:36,318 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 11:42:36,318 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:36,349 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:42:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:42:36,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:36,350 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 11:42:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:36,422 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 11:42:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 11:42:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:36,423 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:36,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1270613072, now seen corresponding path program 4 times [2020-04-18 11:42:36,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:36,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238222086] [2020-04-18 11:42:36,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:36,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238222086] [2020-04-18 11:42:36,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:36,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:42:36,491 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:36,493 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:36,497 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:42:36,497 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:36,520 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 11:42:36,521 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 5 states. [2020-04-18 11:42:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:36,582 INFO L93 Difference]: Finished difference Result 116 states and 204 transitions. [2020-04-18 11:42:36,582 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 204 transitions. [2020-04-18 11:42:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:36,583 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1406801102, now seen corresponding path program 5 times [2020-04-18 11:42:36,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:36,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732817833] [2020-04-18 11:42:36,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:36,661 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732817833] [2020-04-18 11:42:36,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:36,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:42:36,661 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:36,663 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:36,666 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:36,667 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:36,698 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:42:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:42:36,699 INFO L87 Difference]: Start difference. First operand 116 states and 204 transitions. Second operand 7 states. [2020-04-18 11:42:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:36,836 INFO L93 Difference]: Finished difference Result 118 states and 205 transitions. [2020-04-18 11:42:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 205 transitions. [2020-04-18 11:42:36,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:36,837 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2003571561] [2020-04-18 11:42:36,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:36,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:42:36,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2003571561] [2020-04-18 11:42:36,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 11:42:36,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:36,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:42:36,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 11:42:36,838 INFO L87 Difference]: Start difference. First operand 1515 states and 4566 transitions. Second operand 11 states. [2020-04-18 11:42:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:37,857 INFO L93 Difference]: Finished difference Result 3265 states and 8876 transitions. [2020-04-18 11:42:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-04-18 11:42:37,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-04-18 11:42:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:37,867 INFO L225 Difference]: With dead ends: 3265 [2020-04-18 11:42:37,868 INFO L226 Difference]: Without dead ends: 3232 [2020-04-18 11:42:37,869 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2020-04-18 11:42:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2020-04-18 11:42:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 1205. [2020-04-18 11:42:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2020-04-18 11:42:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 3518 transitions. [2020-04-18 11:42:37,930 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 3518 transitions. Word has length 18 [2020-04-18 11:42:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:37,930 INFO L479 AbstractCegarLoop]: Abstraction has 1205 states and 3518 transitions. [2020-04-18 11:42:37,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 11:42:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 3518 transitions. [2020-04-18 11:42:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:37,932 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:37,932 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:37,932 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:37,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 1 times [2020-04-18 11:42:37,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:37,934 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1486165588] [2020-04-18 11:42:37,934 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:37,935 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:42:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 11:42:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:37,936 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:37,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1594234652, now seen corresponding path program 2 times [2020-04-18 11:42:37,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:37,937 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940834946] [2020-04-18 11:42:37,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:37,965 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940834946] [2020-04-18 11:42:37,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:37,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:37,966 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:37,969 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:37,973 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 11:42:37,973 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:37,982 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:37,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:37,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:37,983 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 11:42:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:37,987 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:42:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:42:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:37,988 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1086137922, now seen corresponding path program 3 times [2020-04-18 11:42:37,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:37,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655321280] [2020-04-18 11:42:37,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:38,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655321280] [2020-04-18 11:42:38,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:38,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:38,033 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:38,035 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:38,038 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:38,038 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:38,050 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:38,051 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 11:42:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:38,078 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:42:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:42:38,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:38,079 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1486165588] [2020-04-18 11:42:38,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:38,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:38,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1486165588] [2020-04-18 11:42:38,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:38,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:38,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:38,081 INFO L87 Difference]: Start difference. First operand 1205 states and 3518 transitions. Second operand 5 states. [2020-04-18 11:42:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:38,228 INFO L93 Difference]: Finished difference Result 2245 states and 6476 transitions. [2020-04-18 11:42:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:38,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 11:42:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:38,236 INFO L225 Difference]: With dead ends: 2245 [2020-04-18 11:42:38,237 INFO L226 Difference]: Without dead ends: 2233 [2020-04-18 11:42:38,237 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2020-04-18 11:42:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1434. [2020-04-18 11:42:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2020-04-18 11:42:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 4291 transitions. [2020-04-18 11:42:38,283 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 4291 transitions. Word has length 18 [2020-04-18 11:42:38,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:38,284 INFO L479 AbstractCegarLoop]: Abstraction has 1434 states and 4291 transitions. [2020-04-18 11:42:38,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 4291 transitions. [2020-04-18 11:42:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:38,285 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:38,286 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:38,286 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 11:42:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 1 times [2020-04-18 11:42:38,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:38,287 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1545912944] [2020-04-18 11:42:38,287 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:38,287 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-04-18 11:42:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:38,288 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:38,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:38,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1078743820, now seen corresponding path program 2 times [2020-04-18 11:42:38,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:38,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309549697] [2020-04-18 11:42:38,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:42:38,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:42:38,316 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:42:38,316 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:42:38,317 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:42:38,317 WARN L363 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:42:38,317 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2020-04-18 11:42:38,331 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,331 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,332 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,332 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,332 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,332 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,332 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,332 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,332 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,333 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,333 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,333 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,333 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,333 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,333 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,333 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,334 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,334 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,334 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,334 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,334 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,334 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,335 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,335 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,335 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,335 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,335 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,335 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,335 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,336 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,336 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,336 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,336 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,336 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,336 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,336 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,337 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,337 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,337 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,337 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,337 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,337 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,338 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,338 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,338 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,338 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,338 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,338 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,338 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,339 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,339 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,339 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,339 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,339 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,339 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,339 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,340 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,340 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,340 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,341 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,341 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,341 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,341 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,342 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,342 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,342 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,342 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,343 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,343 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,343 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,344 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,344 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,344 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,345 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,345 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,346 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,346 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,347 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,347 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,348 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,348 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,349 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,349 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,350 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,350 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,350 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,350 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,351 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,351 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,351 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,351 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,351 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,351 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,351 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,354 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,355 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,355 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,355 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,355 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,355 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,356 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,356 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,357 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,358 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,358 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,358 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,358 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,358 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,358 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,358 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,359 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,359 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,360 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,360 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,360 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,361 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,361 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,361 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,361 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,361 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,361 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,361 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,362 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,362 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,362 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,362 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,363 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,363 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,364 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,364 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,369 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,370 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,370 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,371 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,371 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,372 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,372 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:42:38,373 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-04-18 11:42:38,373 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:42:38,373 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:42:38,373 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:42:38,373 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:42:38,374 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:42:38,374 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:42:38,374 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:42:38,374 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:42:38,376 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 163 transitions, 390 flow [2020-04-18 11:42:38,376 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 11:42:38,400 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 11:42:38,400 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 11:42:38,402 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 11:42:38,411 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 167 places, 163 transitions, 390 flow [2020-04-18 11:42:38,436 INFO L129 PetriNetUnfolder]: 15/188 cut-off events. [2020-04-18 11:42:38,437 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-04-18 11:42:38,438 INFO L80 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 188 events. 15/188 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 431 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 208. Up to 10 conditions per place. [2020-04-18 11:42:38,447 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 8100 [2020-04-18 11:42:38,447 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:42:40,573 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-04-18 11:42:40,676 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2020-04-18 11:42:42,206 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-04-18 11:42:42,347 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:42,750 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 100 [2020-04-18 11:42:42,897 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:42:42,906 INFO L206 etLargeBlockEncoding]: Checked pairs total: 10326 [2020-04-18 11:42:42,906 INFO L214 etLargeBlockEncoding]: Total number of compositions: 154 [2020-04-18 11:42:42,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 48 transitions, 160 flow [2020-04-18 11:42:43,923 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13592 states. [2020-04-18 11:42:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 13592 states. [2020-04-18 11:42:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:43,924 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:43,924 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:42:43,924 INFO L427 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:43,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1182523, now seen corresponding path program 1 times [2020-04-18 11:42:43,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:43,925 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1800076363] [2020-04-18 11:42:43,925 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:43,925 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:42:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:42:43,925 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:43,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:43,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1182523, now seen corresponding path program 2 times [2020-04-18 11:42:43,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:43,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142136639] [2020-04-18 11:42:43,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:43,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142136639] [2020-04-18 11:42:43,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:43,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:42:43,949 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:43,949 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:43,950 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:42:43,950 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:43,954 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:43,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:43,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:43,955 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:42:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:43,955 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:42:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:42:43,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:43,956 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1800076363] [2020-04-18 11:42:43,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:43,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:42:43,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1800076363] [2020-04-18 11:42:43,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:42:43,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:43,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:43,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:43,957 INFO L87 Difference]: Start difference. First operand 13592 states. Second operand 3 states. [2020-04-18 11:42:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:44,129 INFO L93 Difference]: Finished difference Result 15456 states and 79163 transitions. [2020-04-18 11:42:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:42:44,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:42:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:44,965 INFO L225 Difference]: With dead ends: 15456 [2020-04-18 11:42:44,966 INFO L226 Difference]: Without dead ends: 14450 [2020-04-18 11:42:44,966 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14450 states. [2020-04-18 11:42:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14450 to 13395. [2020-04-18 11:42:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13395 states. [2020-04-18 11:42:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13395 states to 13395 states and 69324 transitions. [2020-04-18 11:42:45,506 INFO L78 Accepts]: Start accepts. Automaton has 13395 states and 69324 transitions. Word has length 3 [2020-04-18 11:42:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:45,506 INFO L479 AbstractCegarLoop]: Abstraction has 13395 states and 69324 transitions. [2020-04-18 11:42:45,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:42:45,507 INFO L276 IsEmpty]: Start isEmpty. Operand 13395 states and 69324 transitions. [2020-04-18 11:42:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:45,507 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:45,507 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:45,507 INFO L427 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:45,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1868590315, now seen corresponding path program 1 times [2020-04-18 11:42:45,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:45,508 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [770081827] [2020-04-18 11:42:45,508 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:45,508 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:42:45,509 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:42:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:45,509 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:45,509 INFO L82 PathProgramCache]: Analyzing trace with hash 995781737, now seen corresponding path program 2 times [2020-04-18 11:42:45,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:45,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750243789] [2020-04-18 11:42:45,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:45,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750243789] [2020-04-18 11:42:45,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:45,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:45,527 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:45,528 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:45,529 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 11:42:45,529 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:45,534 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:45,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:45,535 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 11:42:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:45,538 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:42:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:42:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:42:45,538 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:45,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:45,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1868590315, now seen corresponding path program 3 times [2020-04-18 11:42:45,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:45,539 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103663513] [2020-04-18 11:42:45,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:45,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103663513] [2020-04-18 11:42:45,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:45,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:45,595 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:45,596 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:45,597 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:42:45,597 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:45,609 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:45,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:45,609 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 11:42:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:45,639 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:42:45,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:42:45,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:45,639 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [770081827] [2020-04-18 11:42:45,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:45,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:45,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [770081827] [2020-04-18 11:42:45,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:45,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:45,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:45,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:45,641 INFO L87 Difference]: Start difference. First operand 13395 states and 69324 transitions. Second operand 5 states. [2020-04-18 11:42:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:46,262 INFO L93 Difference]: Finished difference Result 23586 states and 116096 transitions. [2020-04-18 11:42:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:46,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:42:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:46,398 INFO L225 Difference]: With dead ends: 23586 [2020-04-18 11:42:46,399 INFO L226 Difference]: Without dead ends: 23544 [2020-04-18 11:42:46,402 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23544 states. [2020-04-18 11:42:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23544 to 14448. [2020-04-18 11:42:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14448 states. [2020-04-18 11:42:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14448 states to 14448 states and 75696 transitions. [2020-04-18 11:42:47,215 INFO L78 Accepts]: Start accepts. Automaton has 14448 states and 75696 transitions. Word has length 10 [2020-04-18 11:42:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:47,215 INFO L479 AbstractCegarLoop]: Abstraction has 14448 states and 75696 transitions. [2020-04-18 11:42:47,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 14448 states and 75696 transitions. [2020-04-18 11:42:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:47,216 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:47,216 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:47,216 INFO L427 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:47,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1801459304, now seen corresponding path program 1 times [2020-04-18 11:42:47,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:47,217 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [773046872] [2020-04-18 11:42:47,218 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:47,218 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 11:42:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 11:42:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:47,219 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:47,219 INFO L82 PathProgramCache]: Analyzing trace with hash -780798330, now seen corresponding path program 2 times [2020-04-18 11:42:47,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:47,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916109275] [2020-04-18 11:42:47,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:47,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916109275] [2020-04-18 11:42:47,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:47,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:47,238 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:47,239 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:47,241 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 11:42:47,241 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:47,247 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:47,248 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 11:42:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:47,252 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:42:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:42:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:42:47,253 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:47,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:47,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1801459304, now seen corresponding path program 3 times [2020-04-18 11:42:47,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:47,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454438547] [2020-04-18 11:42:47,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:47,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454438547] [2020-04-18 11:42:47,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:47,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:47,290 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:47,291 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:47,293 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:42:47,293 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:47,305 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:47,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:47,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:47,306 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 11:42:47,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:47,331 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:42:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:42:47,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:47,331 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [773046872] [2020-04-18 11:42:47,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:47,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:47,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [773046872] [2020-04-18 11:42:47,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:47,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:47,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:47,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:47,333 INFO L87 Difference]: Start difference. First operand 14448 states and 75696 transitions. Second operand 5 states. [2020-04-18 11:42:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:48,592 INFO L93 Difference]: Finished difference Result 25978 states and 129320 transitions. [2020-04-18 11:42:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:48,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 11:42:48,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:48,714 INFO L225 Difference]: With dead ends: 25978 [2020-04-18 11:42:48,714 INFO L226 Difference]: Without dead ends: 25910 [2020-04-18 11:42:48,714 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25910 states. [2020-04-18 11:42:49,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25910 to 15939. [2020-04-18 11:42:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15939 states. [2020-04-18 11:42:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15939 states to 15939 states and 84384 transitions. [2020-04-18 11:42:49,669 INFO L78 Accepts]: Start accepts. Automaton has 15939 states and 84384 transitions. Word has length 14 [2020-04-18 11:42:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:49,670 INFO L479 AbstractCegarLoop]: Abstraction has 15939 states and 84384 transitions. [2020-04-18 11:42:49,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 15939 states and 84384 transitions. [2020-04-18 11:42:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:49,672 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:49,672 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:49,672 INFO L427 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:49,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1447988544, now seen corresponding path program 1 times [2020-04-18 11:42:49,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:49,673 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [389899982] [2020-04-18 11:42:49,674 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:49,675 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 11:42:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 11:42:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:49,676 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:49,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:49,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1896075284, now seen corresponding path program 2 times [2020-04-18 11:42:49,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:49,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189957359] [2020-04-18 11:42:49,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:49,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189957359] [2020-04-18 11:42:49,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:49,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:49,709 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:49,710 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:49,716 INFO L259 McrAutomatonBuilder]: Finished intersection with 51 states and 93 transitions. [2020-04-18 11:42:49,716 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:49,722 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:49,723 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 11:42:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:49,733 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:42:49,734 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:42:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:42:49,734 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1447852374, now seen corresponding path program 3 times [2020-04-18 11:42:49,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:49,735 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253596502] [2020-04-18 11:42:49,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:49,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253596502] [2020-04-18 11:42:49,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:49,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:49,765 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:49,766 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:49,771 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 40 transitions. [2020-04-18 11:42:49,771 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:49,777 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:49,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:42:49,778 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 3 states. [2020-04-18 11:42:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:49,783 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:42:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:42:49,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:49,784 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [389899982] [2020-04-18 11:42:49,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:49,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:49,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [389899982] [2020-04-18 11:42:49,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-04-18 11:42:49,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:49,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-04-18 11:42:49,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:42:49,785 INFO L87 Difference]: Start difference. First operand 15939 states and 84384 transitions. Second operand 4 states. [2020-04-18 11:42:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:49,899 INFO L93 Difference]: Finished difference Result 3938 states and 11224 transitions. [2020-04-18 11:42:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-04-18 11:42:49,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-04-18 11:42:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:49,909 INFO L225 Difference]: With dead ends: 3938 [2020-04-18 11:42:49,909 INFO L226 Difference]: Without dead ends: 3938 [2020-04-18 11:42:49,911 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2020-04-18 11:42:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3357. [2020-04-18 11:42:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3357 states. [2020-04-18 11:42:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 9797 transitions. [2020-04-18 11:42:50,027 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 9797 transitions. Word has length 17 [2020-04-18 11:42:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:50,027 INFO L479 AbstractCegarLoop]: Abstraction has 3357 states and 9797 transitions. [2020-04-18 11:42:50,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-04-18 11:42:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 9797 transitions. [2020-04-18 11:42:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:50,029 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:50,030 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:50,030 INFO L427 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash -905254240, now seen corresponding path program 1 times [2020-04-18 11:42:50,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:50,031 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [824330938] [2020-04-18 11:42:50,031 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,033 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 11:42:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:42:50,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:50,034 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:50,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1351207242, now seen corresponding path program 2 times [2020-04-18 11:42:50,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078309546] [2020-04-18 11:42:50,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:50,060 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078309546] [2020-04-18 11:42:50,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:50,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:50,060 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,062 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,069 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 96 transitions. [2020-04-18 11:42:50,069 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,075 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:50,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:50,076 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:42:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:50,088 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 11:42:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 11:42:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:50,089 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1933749536, now seen corresponding path program 3 times [2020-04-18 11:42:50,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033936173] [2020-04-18 11:42:50,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:50,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033936173] [2020-04-18 11:42:50,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:50,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:50,115 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,118 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,124 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 45 transitions. [2020-04-18 11:42:50,124 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,130 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:50,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:50,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:42:50,131 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 3 states. [2020-04-18 11:42:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:50,139 INFO L93 Difference]: Finished difference Result 118 states and 222 transitions. [2020-04-18 11:42:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 222 transitions. [2020-04-18 11:42:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:50,140 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash -864333490, now seen corresponding path program 4 times [2020-04-18 11:42:50,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753133587] [2020-04-18 11:42:50,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:50,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753133587] [2020-04-18 11:42:50,186 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949006192] [2020-04-18 11:42:50,186 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 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 [2020-04-18 11:42:50,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:42:50,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:42:50,282 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 11:42:50,284 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:42:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:50,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:42:50,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 11:42:50,319 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,323 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,330 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 11:42:50,330 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,463 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 14 times. [2020-04-18 11:42:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 11:42:50,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:42:50,464 INFO L87 Difference]: Start difference. First operand 118 states and 222 transitions. Second operand 14 states. [2020-04-18 11:42:50,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:50,615 INFO L93 Difference]: Finished difference Result 131 states and 234 transitions. [2020-04-18 11:42:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 234 transitions. [2020-04-18 11:42:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:50,616 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -905254240, now seen corresponding path program 5 times [2020-04-18 11:42:50,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:50,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930655547] [2020-04-18 11:42:50,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:50,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930655547] [2020-04-18 11:42:50,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003074778] [2020-04-18 11:42:50,696 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-04-18 11:42:50,792 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-04-18 11:42:50,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:42:50,793 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:42:50,795 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:42:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:50,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:42:50,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:42:50,856 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:50,858 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:50,864 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 11:42:50,864 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:50,917 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 10 times. [2020-04-18 11:42:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-04-18 11:42:50,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:42:50,918 INFO L87 Difference]: Start difference. First operand 131 states and 234 transitions. Second operand 16 states. [2020-04-18 11:42:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:51,119 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 11:42:51,119 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 11:42:51,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:51,121 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [824330938] [2020-04-18 11:42:51,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:51,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:42:51,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [824330938] [2020-04-18 11:42:51,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 11:42:51,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 11:42:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2020-04-18 11:42:51,123 INFO L87 Difference]: Start difference. First operand 3357 states and 9797 transitions. Second operand 19 states. [2020-04-18 11:42:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:52,714 INFO L93 Difference]: Finished difference Result 5986 states and 16536 transitions. [2020-04-18 11:42:52,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:42:52,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2020-04-18 11:42:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:52,727 INFO L225 Difference]: With dead ends: 5986 [2020-04-18 11:42:52,727 INFO L226 Difference]: Without dead ends: 5962 [2020-04-18 11:42:52,728 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=879, Invalid=2781, Unknown=0, NotChecked=0, Total=3660 [2020-04-18 11:42:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5962 states. [2020-04-18 11:42:52,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5962 to 3137. [2020-04-18 11:42:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3137 states. [2020-04-18 11:42:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 9109 transitions. [2020-04-18 11:42:52,964 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 9109 transitions. Word has length 18 [2020-04-18 11:42:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:52,965 INFO L479 AbstractCegarLoop]: Abstraction has 3137 states and 9109 transitions. [2020-04-18 11:42:52,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 11:42:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 9109 transitions. [2020-04-18 11:42:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:52,967 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:52,967 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:53,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:42:53,372 INFO L427 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1569744228, now seen corresponding path program 1 times [2020-04-18 11:42:53,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:53,373 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2029528054] [2020-04-18 11:42:53,374 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,375 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:42:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 11:42:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,375 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash -508177918, now seen corresponding path program 2 times [2020-04-18 11:42:53,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:53,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198141415] [2020-04-18 11:42:53,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:53,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198141415] [2020-04-18 11:42:53,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:53,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:53,394 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:53,395 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,398 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 11:42:53,399 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:53,404 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:53,404 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 11:42:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,409 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:42:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:42:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,409 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1569744228, now seen corresponding path program 3 times [2020-04-18 11:42:53,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:53,412 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162754025] [2020-04-18 11:42:53,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:53,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162754025] [2020-04-18 11:42:53,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:53,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:53,462 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:53,464 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,467 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:53,467 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:53,479 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:53,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:53,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:53,480 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 11:42:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,503 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:42:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:42:53,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:53,503 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2029528054] [2020-04-18 11:42:53,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:53,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:53,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2029528054] [2020-04-18 11:42:53,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:42:53,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:53,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:53,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:53,505 INFO L87 Difference]: Start difference. First operand 3137 states and 9109 transitions. Second operand 5 states. [2020-04-18 11:42:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,646 INFO L93 Difference]: Finished difference Result 5118 states and 14425 transitions. [2020-04-18 11:42:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:42:53,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 11:42:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:53,657 INFO L225 Difference]: With dead ends: 5118 [2020-04-18 11:42:53,658 INFO L226 Difference]: Without dead ends: 5108 [2020-04-18 11:42:53,658 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:42:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5108 states. [2020-04-18 11:42:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5108 to 3381. [2020-04-18 11:42:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3381 states. [2020-04-18 11:42:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 9842 transitions. [2020-04-18 11:42:53,757 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 9842 transitions. Word has length 18 [2020-04-18 11:42:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:53,757 INFO L479 AbstractCegarLoop]: Abstraction has 3381 states and 9842 transitions. [2020-04-18 11:42:53,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:42:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 9842 transitions. [2020-04-18 11:42:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,758 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:53,758 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:53,759 INFO L427 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash 162149792, now seen corresponding path program 1 times [2020-04-18 11:42:53,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:53,759 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [71366085] [2020-04-18 11:42:53,760 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,761 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 11:42:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 11:42:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,762 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1351204760, now seen corresponding path program 2 times [2020-04-18 11:42:53,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:53,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850023007] [2020-04-18 11:42:53,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:53,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850023007] [2020-04-18 11:42:53,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:53,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:53,792 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:53,794 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,801 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 96 transitions. [2020-04-18 11:42:53,801 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:53,809 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:53,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:53,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:53,810 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 11:42:53,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,820 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 11:42:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 11:42:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,821 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:53,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1933769374, now seen corresponding path program 3 times [2020-04-18 11:42:53,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:53,821 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345277638] [2020-04-18 11:42:53,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:53,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:42:53,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345277638] [2020-04-18 11:42:53,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:53,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:53,844 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:53,846 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,852 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 47 transitions. [2020-04-18 11:42:53,852 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:53,857 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:53,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:53,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:42:53,858 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 3 states. [2020-04-18 11:42:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:53,865 INFO L93 Difference]: Finished difference Result 106 states and 194 transitions. [2020-04-18 11:42:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 194 transitions. [2020-04-18 11:42:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:53,865 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash 162152972, now seen corresponding path program 4 times [2020-04-18 11:42:53,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:53,866 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697504785] [2020-04-18 11:42:53,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:53,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697504785] [2020-04-18 11:42:53,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:53,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:42:53,909 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:53,911 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:53,914 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:42:53,914 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:53,954 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:42:53,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:42:53,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:42:53,955 INFO L87 Difference]: Start difference. First operand 106 states and 194 transitions. Second operand 7 states. [2020-04-18 11:42:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:54,211 INFO L93 Difference]: Finished difference Result 133 states and 237 transitions. [2020-04-18 11:42:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 237 transitions. [2020-04-18 11:42:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:42:54,212 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 162149792, now seen corresponding path program 5 times [2020-04-18 11:42:54,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:54,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110294551] [2020-04-18 11:42:54,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:42:54,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110294551] [2020-04-18 11:42:54,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:54,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:42:54,268 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:54,269 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:54,273 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:42:54,273 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:54,296 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:42:54,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:42:54,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:42:54,297 INFO L87 Difference]: Start difference. First operand 133 states and 237 transitions. Second operand 7 states. [2020-04-18 11:42:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:54,422 INFO L93 Difference]: Finished difference Result 142 states and 247 transitions. [2020-04-18 11:42:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 247 transitions. [2020-04-18 11:42:54,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:54,424 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [71366085] [2020-04-18 11:42:54,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:54,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:42:54,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [71366085] [2020-04-18 11:42:54,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-04-18 11:42:54,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:54,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:42:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:42:54,426 INFO L87 Difference]: Start difference. First operand 3381 states and 9842 transitions. Second operand 10 states. [2020-04-18 11:42:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:55,151 INFO L93 Difference]: Finished difference Result 6300 states and 17419 transitions. [2020-04-18 11:42:55,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:42:55,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-04-18 11:42:55,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:55,161 INFO L225 Difference]: With dead ends: 6300 [2020-04-18 11:42:55,161 INFO L226 Difference]: Without dead ends: 6273 [2020-04-18 11:42:55,162 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 11:42:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2020-04-18 11:42:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 3234. [2020-04-18 11:42:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3234 states. [2020-04-18 11:42:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3234 states to 3234 states and 9399 transitions. [2020-04-18 11:42:55,254 INFO L78 Accepts]: Start accepts. Automaton has 3234 states and 9399 transitions. Word has length 18 [2020-04-18 11:42:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:55,254 INFO L479 AbstractCegarLoop]: Abstraction has 3234 states and 9399 transitions. [2020-04-18 11:42:55,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-04-18 11:42:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3234 states and 9399 transitions. [2020-04-18 11:42:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:55,257 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:55,257 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:55,257 INFO L427 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:55,258 INFO L82 PathProgramCache]: Analyzing trace with hash -287862172, now seen corresponding path program 1 times [2020-04-18 11:42:55,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:55,258 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1174000406] [2020-04-18 11:42:55,259 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:55,261 INFO L259 McrAutomatonBuilder]: Finished intersection with 130 states and 280 transitions. [2020-04-18 11:42:55,262 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-04-18 11:42:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:55,263 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 404362866, now seen corresponding path program 2 times [2020-04-18 11:42:55,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:55,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140545165] [2020-04-18 11:42:55,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:55,292 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140545165] [2020-04-18 11:42:55,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:55,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:55,293 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:55,295 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:55,308 INFO L259 McrAutomatonBuilder]: Finished intersection with 83 states and 159 transitions. [2020-04-18 11:42:55,308 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:55,321 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:55,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:55,322 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2020-04-18 11:42:55,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:55,332 INFO L93 Difference]: Finished difference Result 157 states and 317 transitions. [2020-04-18 11:42:55,332 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 317 transitions. [2020-04-18 11:42:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:55,333 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:55,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1117305998, now seen corresponding path program 3 times [2020-04-18 11:42:55,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:55,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240564375] [2020-04-18 11:42:55,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-04-18 11:42:55,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240564375] [2020-04-18 11:42:55,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:55,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:55,362 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:55,365 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:55,377 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 103 transitions. [2020-04-18 11:42:55,378 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:55,384 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:55,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:55,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:42:55,385 INFO L87 Difference]: Start difference. First operand 157 states and 317 transitions. Second operand 3 states. [2020-04-18 11:42:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:55,392 INFO L93 Difference]: Finished difference Result 166 states and 326 transitions. [2020-04-18 11:42:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 326 transitions. [2020-04-18 11:42:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:55,393 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:55,393 INFO L82 PathProgramCache]: Analyzing trace with hash -247140892, now seen corresponding path program 4 times [2020-04-18 11:42:55,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:55,393 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731378753] [2020-04-18 11:42:55,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:55,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731378753] [2020-04-18 11:42:55,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307505052] [2020-04-18 11:42:55,439 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 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 [2020-04-18 11:42:55,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:42:55,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:42:55,522 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 11:42:55,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:42:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:55,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:42:55,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-04-18 11:42:55,567 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:55,570 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:55,583 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2020-04-18 11:42:55,583 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:55,814 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 24 times. [2020-04-18 11:42:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:42:55,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2020-04-18 11:42:55,815 INFO L87 Difference]: Start difference. First operand 166 states and 326 transitions. Second operand 17 states. [2020-04-18 11:42:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:56,121 INFO L93 Difference]: Finished difference Result 179 states and 338 transitions. [2020-04-18 11:42:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 338 transitions. [2020-04-18 11:42:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:56,122 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash -287862172, now seen corresponding path program 5 times [2020-04-18 11:42:56,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:56,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063359937] [2020-04-18 11:42:56,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:56,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063359937] [2020-04-18 11:42:56,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825328705] [2020-04-18 11:42:56,173 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-04-18 11:42:56,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:42:56,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:42:56,265 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:42:56,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:42:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:56,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:42:56,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:42:56,358 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:56,361 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:56,374 INFO L259 McrAutomatonBuilder]: Finished intersection with 55 states and 86 transitions. [2020-04-18 11:42:56,374 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:56,459 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 16 times. [2020-04-18 11:42:56,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 11:42:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:42:56,460 INFO L87 Difference]: Start difference. First operand 179 states and 338 transitions. Second operand 18 states. [2020-04-18 11:42:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:56,662 INFO L93 Difference]: Finished difference Result 181 states and 339 transitions. [2020-04-18 11:42:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 339 transitions. [2020-04-18 11:42:56,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:56,663 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1174000406] [2020-04-18 11:42:56,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:56,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:42:56,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1174000406] [2020-04-18 11:42:56,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-04-18 11:42:56,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:56,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-04-18 11:42:56,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=601, Unknown=0, NotChecked=0, Total=812 [2020-04-18 11:42:56,664 INFO L87 Difference]: Start difference. First operand 3234 states and 9399 transitions. Second operand 22 states. [2020-04-18 11:42:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:58,455 INFO L93 Difference]: Finished difference Result 6095 states and 16808 transitions. [2020-04-18 11:42:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:42:58,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2020-04-18 11:42:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:42:58,465 INFO L225 Difference]: With dead ends: 6095 [2020-04-18 11:42:58,466 INFO L226 Difference]: Without dead ends: 6079 [2020-04-18 11:42:58,467 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 171 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=998, Invalid=3034, Unknown=0, NotChecked=0, Total=4032 [2020-04-18 11:42:58,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2020-04-18 11:42:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 3114. [2020-04-18 11:42:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2020-04-18 11:42:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 9010 transitions. [2020-04-18 11:42:58,547 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 9010 transitions. Word has length 22 [2020-04-18 11:42:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:42:58,548 INFO L479 AbstractCegarLoop]: Abstraction has 3114 states and 9010 transitions. [2020-04-18 11:42:58,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-04-18 11:42:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 9010 transitions. [2020-04-18 11:42:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:58,550 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:42:58,550 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:42:58,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:42:58,963 INFO L427 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:42:58,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:58,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1897707635, now seen corresponding path program 1 times [2020-04-18 11:42:58,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:42:58,964 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [353895904] [2020-04-18 11:42:58,965 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:58,967 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 11:42:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 11:42:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:58,968 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:42:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2114617359, now seen corresponding path program 2 times [2020-04-18 11:42:58,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:58,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839374419] [2020-04-18 11:42:58,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:58,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:42:58,991 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839374419] [2020-04-18 11:42:58,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:58,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:42:58,992 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:58,994 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:59,004 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 106 transitions. [2020-04-18 11:42:59,005 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:59,022 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:59,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:59,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:42:59,023 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 11:42:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:59,033 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 11:42:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 11:42:59,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:59,033 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:42:59,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1853794693, now seen corresponding path program 3 times [2020-04-18 11:42:59,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:59,034 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262782384] [2020-04-18 11:42:59,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:59,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262782384] [2020-04-18 11:42:59,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:59,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:42:59,086 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:59,089 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:59,098 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 11:42:59,099 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:59,117 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:42:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:42:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:42:59,118 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 5 states. [2020-04-18 11:42:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:59,181 INFO L93 Difference]: Finished difference Result 129 states and 237 transitions. [2020-04-18 11:42:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 237 transitions. [2020-04-18 11:42:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:59,182 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:42:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1897707635, now seen corresponding path program 4 times [2020-04-18 11:42:59,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:59,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564278503] [2020-04-18 11:42:59,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:59,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:59,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564278503] [2020-04-18 11:42:59,249 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435844313] [2020-04-18 11:42:59,249 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 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 [2020-04-18 11:42:59,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:42:59,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:42:59,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:42:59,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:42:59,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:59,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:42:59,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:42:59,431 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:59,433 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:59,443 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 11:42:59,443 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:59,509 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:42:59,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:42:59,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:42:59,510 INFO L87 Difference]: Start difference. First operand 129 states and 237 transitions. Second operand 12 states. [2020-04-18 11:42:59,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:59,696 INFO L93 Difference]: Finished difference Result 131 states and 238 transitions. [2020-04-18 11:42:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 238 transitions. [2020-04-18 11:42:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:42:59,697 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:42:59,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:42:59,697 INFO L82 PathProgramCache]: Analyzing trace with hash 657147077, now seen corresponding path program 5 times [2020-04-18 11:42:59,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:42:59,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380327362] [2020-04-18 11:42:59,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:42:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:42:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:42:59,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380327362] [2020-04-18 11:42:59,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:42:59,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:42:59,726 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:42:59,728 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:42:59,733 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-04-18 11:42:59,733 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:42:59,743 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:42:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:42:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:42:59,744 INFO L87 Difference]: Start difference. First operand 131 states and 238 transitions. Second operand 3 states. [2020-04-18 11:42:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:42:59,750 INFO L93 Difference]: Finished difference Result 141 states and 247 transitions. [2020-04-18 11:42:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 247 transitions. [2020-04-18 11:42:59,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:42:59,751 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [353895904] [2020-04-18 11:42:59,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:42:59,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:42:59,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [353895904] [2020-04-18 11:42:59,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:42:59,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:42:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:42:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:42:59,752 INFO L87 Difference]: Start difference. First operand 3114 states and 9010 transitions. Second operand 13 states. [2020-04-18 11:43:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:00,461 INFO L93 Difference]: Finished difference Result 6230 states and 17201 transitions. [2020-04-18 11:43:00,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:43:00,461 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 11:43:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:00,591 INFO L225 Difference]: With dead ends: 6230 [2020-04-18 11:43:00,591 INFO L226 Difference]: Without dead ends: 6214 [2020-04-18 11:43:00,592 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:43:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2020-04-18 11:43:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 3152. [2020-04-18 11:43:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3152 states. [2020-04-18 11:43:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 9145 transitions. [2020-04-18 11:43:00,666 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 9145 transitions. Word has length 22 [2020-04-18 11:43:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:00,667 INFO L479 AbstractCegarLoop]: Abstraction has 3152 states and 9145 transitions. [2020-04-18 11:43:00,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:43:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 9145 transitions. [2020-04-18 11:43:00,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:00,669 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:00,669 INFO L425 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:00,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:43:00,872 INFO L427 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2020-04-18 11:43:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:00,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1666591514, now seen corresponding path program 1 times [2020-04-18 11:43:00,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:00,874 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1487971106] [2020-04-18 11:43:00,874 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:00,875 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:43:00,875 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-04-18 11:43:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:43:00,876 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:00,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1666591514, now seen corresponding path program 2 times [2020-04-18 11:43:00,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:00,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029911226] [2020-04-18 11:43:00,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:43:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:43:00,908 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:43:00,909 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:43:00,909 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:43:00,910 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:43:00,911 WARN L363 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:43:00,911 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2020-04-18 11:43:00,934 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,935 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,937 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,940 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,940 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,940 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,940 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,940 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,940 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,941 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,942 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,942 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,942 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,942 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,942 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,942 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,943 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,943 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,943 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,943 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,943 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,944 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,944 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,944 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,944 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,944 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,944 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,944 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,945 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,946 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,946 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,946 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,946 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,946 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,947 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,948 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,948 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,948 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,948 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,948 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,949 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,949 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,949 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,949 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,949 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,950 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,951 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,952 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,952 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,953 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,953 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,954 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,956 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,957 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,957 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,957 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,957 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,957 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,957 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,957 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,958 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,958 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,959 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,960 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,960 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,960 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,960 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,961 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,961 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,962 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,963 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,963 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,963 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,963 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,963 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,963 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,963 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,964 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,964 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,966 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,967 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,967 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,967 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,967 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,967 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,968 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,968 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,969 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,969 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,970 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,970 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,971 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,971 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,972 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,972 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,973 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,973 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,973 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,974 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,975 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,975 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,979 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,979 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:43:00,983 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-04-18 11:43:00,983 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:43:00,983 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:43:00,983 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:43:00,983 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:43:00,983 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:43:00,983 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:43:00,984 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:43:00,984 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:43:00,986 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 192 transitions, 474 flow [2020-04-18 11:43:00,986 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 11:43:01,018 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 11:43:01,018 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 11:43:01,021 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 11:43:01,037 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 197 places, 192 transitions, 474 flow [2020-04-18 11:43:01,068 INFO L129 PetriNetUnfolder]: 18/222 cut-off events. [2020-04-18 11:43:01,069 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2020-04-18 11:43:01,071 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 222 events. 18/222 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 530 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 249. Up to 12 conditions per place. [2020-04-18 11:43:01,079 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11754 [2020-04-18 11:43:01,079 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 11:43:05,542 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2020-04-18 11:43:06,075 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2020-04-18 11:43:06,196 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-04-18 11:43:06,204 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17154 [2020-04-18 11:43:06,205 INFO L214 etLargeBlockEncoding]: Total number of compositions: 177 [2020-04-18 11:43:06,205 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 57 transitions, 204 flow [2020-04-18 11:43:32,341 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97217 states. [2020-04-18 11:43:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 97217 states. [2020-04-18 11:43:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:43:32,342 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:32,342 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-04-18 11:43:32,342 INFO L427 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]=== [2020-04-18 11:43:32,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1587786, now seen corresponding path program 1 times [2020-04-18 11:43:32,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:32,342 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [892622457] [2020-04-18 11:43:32,343 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:32,343 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:43:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states. [2020-04-18 11:43:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-04-18 11:43:32,343 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:32,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1587786, now seen corresponding path program 2 times [2020-04-18 11:43:32,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:32,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856796580] [2020-04-18 11:43:32,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:32,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856796580] [2020-04-18 11:43:32,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:32,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-04-18 11:43:32,378 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:32,378 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:32,378 INFO L259 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-04-18 11:43:32,378 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:32,393 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:32,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:32,394 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 3 states. [2020-04-18 11:43:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:32,394 INFO L93 Difference]: Finished difference Result 4 states and 3 transitions. [2020-04-18 11:43:32,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 3 transitions. [2020-04-18 11:43:32,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:32,395 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [892622457] [2020-04-18 11:43:32,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:32,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [1] total 1 [2020-04-18 11:43:32,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [892622457] [2020-04-18 11:43:32,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 11:43:32,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:32,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:32,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:32,396 INFO L87 Difference]: Start difference. First operand 97217 states. Second operand 3 states. [2020-04-18 11:43:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:33,400 INFO L93 Difference]: Finished difference Result 118175 states and 731030 transitions. [2020-04-18 11:43:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 11:43:33,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-04-18 11:43:33,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:38,020 INFO L225 Difference]: With dead ends: 118175 [2020-04-18 11:43:38,021 INFO L226 Difference]: Without dead ends: 110531 [2020-04-18 11:43:38,021 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110531 states. [2020-04-18 11:43:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110531 to 100755. [2020-04-18 11:43:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100755 states. [2020-04-18 11:43:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100755 states to 100755 states and 628402 transitions. [2020-04-18 11:43:44,147 INFO L78 Accepts]: Start accepts. Automaton has 100755 states and 628402 transitions. Word has length 3 [2020-04-18 11:43:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:43:44,147 INFO L479 AbstractCegarLoop]: Abstraction has 100755 states and 628402 transitions. [2020-04-18 11:43:44,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 11:43:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 100755 states and 628402 transitions. [2020-04-18 11:43:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:43:44,148 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:43:44,148 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:43:44,148 INFO L427 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]=== [2020-04-18 11:43:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1592599097, now seen corresponding path program 1 times [2020-04-18 11:43:44,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:43:44,149 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1374545329] [2020-04-18 11:43:44,149 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:44,149 INFO L259 McrAutomatonBuilder]: Finished intersection with 18 states and 24 transitions. [2020-04-18 11:43:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-04-18 11:43:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:43:44,149 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:43:44,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash 621429795, now seen corresponding path program 2 times [2020-04-18 11:43:44,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:44,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091331518] [2020-04-18 11:43:44,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:44,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091331518] [2020-04-18 11:43:44,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:44,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:43:44,175 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:44,176 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:44,177 INFO L259 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-04-18 11:43:44,177 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:44,182 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:43:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:43:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:43:44,183 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2020-04-18 11:43:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:44,186 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:43:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:43:44,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-04-18 11:43:44,187 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:43:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:43:44,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1592599097, now seen corresponding path program 3 times [2020-04-18 11:43:44,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:43:44,188 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970946607] [2020-04-18 11:43:44,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:43:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:43:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:43:44,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970946607] [2020-04-18 11:43:44,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:43:44,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:43:44,216 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:43:44,217 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:43:44,218 INFO L259 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-04-18 11:43:44,218 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:43:44,228 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:43:44,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:44,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:43:44,228 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2020-04-18 11:43:44,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:44,249 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-04-18 11:43:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2020-04-18 11:43:44,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:43:44,250 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1374545329] [2020-04-18 11:43:44,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:43:44,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:43:44,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1374545329] [2020-04-18 11:43:44,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:43:44,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:43:44,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:43:44,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:44,251 INFO L87 Difference]: Start difference. First operand 100755 states and 628402 transitions. Second operand 5 states. [2020-04-18 11:43:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:43:51,576 INFO L93 Difference]: Finished difference Result 187755 states and 1125902 transitions. [2020-04-18 11:43:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:43:51,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-04-18 11:43:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:43:53,843 INFO L225 Difference]: With dead ends: 187755 [2020-04-18 11:43:53,843 INFO L226 Difference]: Without dead ends: 187578 [2020-04-18 11:43:53,843 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:43:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187578 states. [2020-04-18 11:44:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187578 to 111945. [2020-04-18 11:44:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111945 states. [2020-04-18 11:44:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111945 states to 111945 states and 706831 transitions. [2020-04-18 11:44:02,090 INFO L78 Accepts]: Start accepts. Automaton has 111945 states and 706831 transitions. Word has length 10 [2020-04-18 11:44:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:02,090 INFO L479 AbstractCegarLoop]: Abstraction has 111945 states and 706831 transitions. [2020-04-18 11:44:02,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:44:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 111945 states and 706831 transitions. [2020-04-18 11:44:02,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:44:02,090 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:02,090 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:02,091 INFO L427 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]=== [2020-04-18 11:44:02,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2054167379, now seen corresponding path program 1 times [2020-04-18 11:44:02,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:02,091 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1129165927] [2020-04-18 11:44:02,091 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:02,092 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-04-18 11:44:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-04-18 11:44:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:44:02,092 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:02,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:02,092 INFO L82 PathProgramCache]: Analyzing trace with hash -335609603, now seen corresponding path program 2 times [2020-04-18 11:44:02,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:02,093 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432316068] [2020-04-18 11:44:02,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:02,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432316068] [2020-04-18 11:44:02,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:02,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:02,120 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:02,121 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:02,124 INFO L259 McrAutomatonBuilder]: Finished intersection with 25 states and 34 transitions. [2020-04-18 11:44:02,124 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:02,130 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:02,130 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2020-04-18 11:44:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:02,135 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:44:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:44:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-04-18 11:44:02,135 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:02,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:02,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2054167379, now seen corresponding path program 3 times [2020-04-18 11:44:02,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:02,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251619260] [2020-04-18 11:44:02,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:02,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251619260] [2020-04-18 11:44:02,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:02,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:02,174 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:02,175 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:02,177 INFO L259 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-04-18 11:44:02,177 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:02,189 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:02,190 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 5 states. [2020-04-18 11:44:02,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:02,223 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2020-04-18 11:44:02,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-04-18 11:44:02,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:02,224 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1129165927] [2020-04-18 11:44:02,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:02,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:02,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1129165927] [2020-04-18 11:44:02,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:44:02,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:02,226 INFO L87 Difference]: Start difference. First operand 111945 states and 706831 transitions. Second operand 5 states. [2020-04-18 11:44:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:10,876 INFO L93 Difference]: Finished difference Result 212246 states and 1288288 transitions. [2020-04-18 11:44:10,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:44:10,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-04-18 11:44:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:11,937 INFO L225 Difference]: With dead ends: 212246 [2020-04-18 11:44:11,937 INFO L226 Difference]: Without dead ends: 211934 [2020-04-18 11:44:11,937 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:21,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211934 states. [2020-04-18 11:44:25,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211934 to 127498. [2020-04-18 11:44:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127498 states. [2020-04-18 11:44:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127498 states to 127498 states and 815584 transitions. [2020-04-18 11:44:27,627 INFO L78 Accepts]: Start accepts. Automaton has 127498 states and 815584 transitions. Word has length 14 [2020-04-18 11:44:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:27,628 INFO L479 AbstractCegarLoop]: Abstraction has 127498 states and 815584 transitions. [2020-04-18 11:44:27,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:44:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 127498 states and 815584 transitions. [2020-04-18 11:44:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:44:27,629 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:27,629 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:27,629 INFO L427 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]=== [2020-04-18 11:44:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash -53690513, now seen corresponding path program 1 times [2020-04-18 11:44:27,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:27,630 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [495760275] [2020-04-18 11:44:27,630 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:27,631 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 150 transitions. [2020-04-18 11:44:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-04-18 11:44:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:44:27,632 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash 986041821, now seen corresponding path program 2 times [2020-04-18 11:44:27,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:27,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623660587] [2020-04-18 11:44:27,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:27,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623660587] [2020-04-18 11:44:27,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:27,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:27,649 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:27,651 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:27,657 INFO L259 McrAutomatonBuilder]: Finished intersection with 52 states and 94 transitions. [2020-04-18 11:44:27,657 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:27,667 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:27,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:27,668 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-04-18 11:44:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:27,680 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:44:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:44:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-04-18 11:44:27,681 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:27,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:27,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1236722085, now seen corresponding path program 3 times [2020-04-18 11:44:27,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:27,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645658014] [2020-04-18 11:44:27,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:27,699 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645658014] [2020-04-18 11:44:27,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:27,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:27,700 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:27,702 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:27,706 INFO L259 McrAutomatonBuilder]: Finished intersection with 38 states and 57 transitions. [2020-04-18 11:44:27,707 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:27,740 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:27,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:44:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:27,741 INFO L87 Difference]: Start difference. First operand 85 states and 160 transitions. Second operand 6 states. [2020-04-18 11:44:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:27,803 INFO L93 Difference]: Finished difference Result 85 states and 160 transitions. [2020-04-18 11:44:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 160 transitions. [2020-04-18 11:44:27,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:27,804 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [495760275] [2020-04-18 11:44:27,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:27,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:27,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [495760275] [2020-04-18 11:44:27,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 11:44:27,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:27,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:27,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:44:27,805 INFO L87 Difference]: Start difference. First operand 127498 states and 815584 transitions. Second operand 7 states. [2020-04-18 11:44:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:28,466 INFO L93 Difference]: Finished difference Result 28630 states and 88425 transitions. [2020-04-18 11:44:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-04-18 11:44:28,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-04-18 11:44:28,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:28,519 INFO L225 Difference]: With dead ends: 28630 [2020-04-18 11:44:28,519 INFO L226 Difference]: Without dead ends: 28630 [2020-04-18 11:44:28,520 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:44:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28630 states. [2020-04-18 11:44:28,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28630 to 13870. [2020-04-18 11:44:28,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2020-04-18 11:44:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 45593 transitions. [2020-04-18 11:44:28,937 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 45593 transitions. Word has length 17 [2020-04-18 11:44:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:28,937 INFO L479 AbstractCegarLoop]: Abstraction has 13870 states and 45593 transitions. [2020-04-18 11:44:28,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 11:44:28,937 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 45593 transitions. [2020-04-18 11:44:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:28,938 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:28,938 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:28,938 INFO L427 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]=== [2020-04-18 11:44:28,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:28,938 INFO L82 PathProgramCache]: Analyzing trace with hash 693844998, now seen corresponding path program 1 times [2020-04-18 11:44:28,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:28,939 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [656235135] [2020-04-18 11:44:28,939 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:28,940 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 188 transitions. [2020-04-18 11:44:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:44:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:28,941 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1361063164, now seen corresponding path program 2 times [2020-04-18 11:44:28,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:28,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122996369] [2020-04-18 11:44:28,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:28,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122996369] [2020-04-18 11:44:28,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:28,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:28,964 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:28,966 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:28,973 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 94 transitions. [2020-04-18 11:44:28,973 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:28,979 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:28,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:28,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:28,980 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:44:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:28,990 INFO L93 Difference]: Finished difference Result 109 states and 213 transitions. [2020-04-18 11:44:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 213 transitions. [2020-04-18 11:44:28,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:28,990 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:28,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:28,991 INFO L82 PathProgramCache]: Analyzing trace with hash -489186574, now seen corresponding path program 3 times [2020-04-18 11:44:28,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:28,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900119394] [2020-04-18 11:44:28,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:29,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900119394] [2020-04-18 11:44:29,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:29,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:29,030 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:29,032 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:29,039 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 76 transitions. [2020-04-18 11:44:29,039 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:29,052 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:29,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:29,053 INFO L87 Difference]: Start difference. First operand 109 states and 213 transitions. Second operand 5 states. [2020-04-18 11:44:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:29,122 INFO L93 Difference]: Finished difference Result 121 states and 225 transitions. [2020-04-18 11:44:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 225 transitions. [2020-04-18 11:44:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:29,123 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash 693844998, now seen corresponding path program 4 times [2020-04-18 11:44:29,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:29,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974324978] [2020-04-18 11:44:29,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:29,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974324978] [2020-04-18 11:44:29,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756049754] [2020-04-18 11:44:29,184 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 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 [2020-04-18 11:44:29,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:44:29,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:44:29,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:44:29,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:44:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:29,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:44:29,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:44:29,385 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:29,389 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:29,396 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 50 transitions. [2020-04-18 11:44:29,396 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:29,466 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:29,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:44:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:44:29,467 INFO L87 Difference]: Start difference. First operand 121 states and 225 transitions. Second operand 12 states. [2020-04-18 11:44:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:29,638 INFO L93 Difference]: Finished difference Result 123 states and 226 transitions. [2020-04-18 11:44:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 226 transitions. [2020-04-18 11:44:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:29,638 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash -801276942, now seen corresponding path program 5 times [2020-04-18 11:44:29,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:29,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002385890] [2020-04-18 11:44:29,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:29,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002385890] [2020-04-18 11:44:29,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:29,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:29,660 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:29,661 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:29,665 INFO L259 McrAutomatonBuilder]: Finished intersection with 24 states and 28 transitions. [2020-04-18 11:44:29,665 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:29,676 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:29,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:29,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:29,676 INFO L87 Difference]: Start difference. First operand 123 states and 226 transitions. Second operand 3 states. [2020-04-18 11:44:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:29,683 INFO L93 Difference]: Finished difference Result 133 states and 235 transitions. [2020-04-18 11:44:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 235 transitions. [2020-04-18 11:44:29,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:29,684 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [656235135] [2020-04-18 11:44:29,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:29,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:29,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [656235135] [2020-04-18 11:44:29,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:44:29,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:29,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:44:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:29,685 INFO L87 Difference]: Start difference. First operand 13870 states and 45593 transitions. Second operand 13 states. [2020-04-18 11:44:31,601 WARN L192 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 16 [2020-04-18 11:44:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:32,346 INFO L93 Difference]: Finished difference Result 28297 states and 88595 transitions. [2020-04-18 11:44:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:44:32,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 11:44:32,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:32,398 INFO L225 Difference]: With dead ends: 28297 [2020-04-18 11:44:32,398 INFO L226 Difference]: Without dead ends: 28227 [2020-04-18 11:44:32,399 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:44:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2020-04-18 11:44:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 13185. [2020-04-18 11:44:32,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13185 states. [2020-04-18 11:44:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13185 states to 13185 states and 43189 transitions. [2020-04-18 11:44:32,800 INFO L78 Accepts]: Start accepts. Automaton has 13185 states and 43189 transitions. Word has length 18 [2020-04-18 11:44:32,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:32,801 INFO L479 AbstractCegarLoop]: Abstraction has 13185 states and 43189 transitions. [2020-04-18 11:44:32,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:44:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 13185 states and 43189 transitions. [2020-04-18 11:44:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:32,801 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:32,802 INFO L425 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:33,004 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:33,005 INFO L427 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]=== [2020-04-18 11:44:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1124175233, now seen corresponding path program 1 times [2020-04-18 11:44:33,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:33,006 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [450119498] [2020-04-18 11:44:33,007 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:33,008 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2020-04-18 11:44:33,009 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2020-04-18 11:44:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:33,009 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:33,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash 502526883, now seen corresponding path program 2 times [2020-04-18 11:44:33,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:33,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713294225] [2020-04-18 11:44:33,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:33,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713294225] [2020-04-18 11:44:33,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:33,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:33,023 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:33,025 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:33,030 INFO L259 McrAutomatonBuilder]: Finished intersection with 53 states and 95 transitions. [2020-04-18 11:44:33,030 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:33,035 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:33,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:33,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:33,036 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2020-04-18 11:44:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:33,047 INFO L93 Difference]: Finished difference Result 97 states and 185 transitions. [2020-04-18 11:44:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 185 transitions. [2020-04-18 11:44:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:33,047 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash 316322533, now seen corresponding path program 3 times [2020-04-18 11:44:33,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:33,048 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901470072] [2020-04-18 11:44:33,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:33,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:44:33,083 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901470072] [2020-04-18 11:44:33,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:33,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:33,084 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:33,086 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:33,092 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-04-18 11:44:33,092 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:33,125 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:44:33,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:33,126 INFO L87 Difference]: Start difference. First operand 97 states and 185 transitions. Second operand 6 states. [2020-04-18 11:44:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:33,201 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-04-18 11:44:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 192 transitions. [2020-04-18 11:44:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:33,202 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1124039693, now seen corresponding path program 4 times [2020-04-18 11:44:33,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:33,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571033444] [2020-04-18 11:44:33,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:33,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571033444] [2020-04-18 11:44:33,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:33,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:33,252 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:33,254 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:33,257 INFO L259 McrAutomatonBuilder]: Finished intersection with 22 states and 24 transitions. [2020-04-18 11:44:33,257 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:33,328 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:44:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:44:33,329 INFO L87 Difference]: Start difference. First operand 103 states and 192 transitions. Second operand 7 states. [2020-04-18 11:44:33,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:33,584 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2020-04-18 11:44:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 235 transitions. [2020-04-18 11:44:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:33,585 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:33,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1124175233, now seen corresponding path program 5 times [2020-04-18 11:44:33,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:33,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53803405] [2020-04-18 11:44:33,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:33,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:33,656 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53803405] [2020-04-18 11:44:33,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:33,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:44:33,656 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:33,658 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:33,661 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:44:33,661 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:33,704 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:44:33,704 INFO L87 Difference]: Start difference. First operand 130 states and 235 transitions. Second operand 7 states. [2020-04-18 11:44:33,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:33,826 INFO L93 Difference]: Finished difference Result 139 states and 245 transitions. [2020-04-18 11:44:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 245 transitions. [2020-04-18 11:44:33,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:33,827 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [450119498] [2020-04-18 11:44:33,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:33,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:44:33,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [450119498] [2020-04-18 11:44:33,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:44:33,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:44:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2020-04-18 11:44:33,829 INFO L87 Difference]: Start difference. First operand 13185 states and 43189 transitions. Second operand 13 states. [2020-04-18 11:44:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:35,918 INFO L93 Difference]: Finished difference Result 41864 states and 127091 transitions. [2020-04-18 11:44:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:44:35,918 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-04-18 11:44:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:35,986 INFO L225 Difference]: With dead ends: 41864 [2020-04-18 11:44:35,986 INFO L226 Difference]: Without dead ends: 41780 [2020-04-18 11:44:35,987 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=769, Invalid=3137, Unknown=0, NotChecked=0, Total=3906 [2020-04-18 11:44:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41780 states. [2020-04-18 11:44:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41780 to 12294. [2020-04-18 11:44:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12294 states. [2020-04-18 11:44:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 40114 transitions. [2020-04-18 11:44:36,434 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 40114 transitions. Word has length 18 [2020-04-18 11:44:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:36,435 INFO L479 AbstractCegarLoop]: Abstraction has 12294 states and 40114 transitions. [2020-04-18 11:44:36,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:44:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 40114 transitions. [2020-04-18 11:44:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:36,435 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:36,435 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:36,436 INFO L427 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]=== [2020-04-18 11:44:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash 427682604, now seen corresponding path program 1 times [2020-04-18 11:44:36,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:36,436 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [341070915] [2020-04-18 11:44:36,437 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:36,438 INFO L259 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-04-18 11:44:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-04-18 11:44:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:36,438 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:36,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash 431466270, now seen corresponding path program 2 times [2020-04-18 11:44:36,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:36,439 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791791633] [2020-04-18 11:44:36,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:36,463 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791791633] [2020-04-18 11:44:36,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:36,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:36,463 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:36,465 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:36,468 INFO L259 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-04-18 11:44:36,468 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:36,473 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:36,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:36,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:36,473 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-04-18 11:44:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:36,477 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:44:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:44:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-04-18 11:44:36,477 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash 427682604, now seen corresponding path program 3 times [2020-04-18 11:44:36,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:36,478 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898366238] [2020-04-18 11:44:36,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:36,505 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898366238] [2020-04-18 11:44:36,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:36,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:36,506 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:36,507 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:36,510 INFO L259 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-04-18 11:44:36,510 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:36,519 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:36,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:36,520 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 5 states. [2020-04-18 11:44:36,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:36,539 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2020-04-18 11:44:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2020-04-18 11:44:36,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:36,540 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [341070915] [2020-04-18 11:44:36,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:36,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:36,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [341070915] [2020-04-18 11:44:36,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:44:36,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:36,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:36,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:36,541 INFO L87 Difference]: Start difference. First operand 12294 states and 40114 transitions. Second operand 5 states. [2020-04-18 11:44:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:36,726 INFO L93 Difference]: Finished difference Result 24605 states and 79893 transitions. [2020-04-18 11:44:36,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:44:36,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-04-18 11:44:36,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:36,770 INFO L225 Difference]: With dead ends: 24605 [2020-04-18 11:44:36,770 INFO L226 Difference]: Without dead ends: 24581 [2020-04-18 11:44:36,770 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24581 states. [2020-04-18 11:44:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24581 to 13787. [2020-04-18 11:44:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13787 states. [2020-04-18 11:44:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13787 states to 13787 states and 45295 transitions. [2020-04-18 11:44:37,137 INFO L78 Accepts]: Start accepts. Automaton has 13787 states and 45295 transitions. Word has length 18 [2020-04-18 11:44:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:37,137 INFO L479 AbstractCegarLoop]: Abstraction has 13787 states and 45295 transitions. [2020-04-18 11:44:37,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:44:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 13787 states and 45295 transitions. [2020-04-18 11:44:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:37,139 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:37,139 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:37,139 INFO L427 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]=== [2020-04-18 11:44:37,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:37,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1364464123, now seen corresponding path program 1 times [2020-04-18 11:44:37,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:37,140 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1531480472] [2020-04-18 11:44:37,140 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:37,142 INFO L259 McrAutomatonBuilder]: Finished intersection with 130 states and 280 transitions. [2020-04-18 11:44:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states. [2020-04-18 11:44:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:37,144 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash -62775899, now seen corresponding path program 2 times [2020-04-18 11:44:37,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:37,144 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895157636] [2020-04-18 11:44:37,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:37,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895157636] [2020-04-18 11:44:37,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:37,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:37,173 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:37,175 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:37,188 INFO L259 McrAutomatonBuilder]: Finished intersection with 85 states and 162 transitions. [2020-04-18 11:44:37,188 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:37,193 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:37,194 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 3 states. [2020-04-18 11:44:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:37,203 INFO L93 Difference]: Finished difference Result 157 states and 317 transitions. [2020-04-18 11:44:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 317 transitions. [2020-04-18 11:44:37,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:37,204 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:37,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1578647187, now seen corresponding path program 3 times [2020-04-18 11:44:37,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:37,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095631360] [2020-04-18 11:44:37,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:37,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095631360] [2020-04-18 11:44:37,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:37,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:37,247 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:37,250 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:37,259 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 132 transitions. [2020-04-18 11:44:37,260 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:37,270 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:44:37,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:37,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:37,271 INFO L87 Difference]: Start difference. First operand 157 states and 317 transitions. Second operand 5 states. [2020-04-18 11:44:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:37,325 INFO L93 Difference]: Finished difference Result 169 states and 329 transitions. [2020-04-18 11:44:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 329 transitions. [2020-04-18 11:44:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:37,326 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:37,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1364464123, now seen corresponding path program 4 times [2020-04-18 11:44:37,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:37,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917101195] [2020-04-18 11:44:37,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:37,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917101195] [2020-04-18 11:44:37,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582172979] [2020-04-18 11:44:37,373 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 [2020-04-18 11:44:37,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:44:37,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:44:37,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:44:37,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:44:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:37,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:44:37,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:44:37,543 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:37,546 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:37,560 INFO L259 McrAutomatonBuilder]: Finished intersection with 55 states and 86 transitions. [2020-04-18 11:44:37,560 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:37,624 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:44:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:44:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:44:37,625 INFO L87 Difference]: Start difference. First operand 169 states and 329 transitions. Second operand 12 states. [2020-04-18 11:44:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:37,792 INFO L93 Difference]: Finished difference Result 171 states and 330 transitions. [2020-04-18 11:44:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 330 transitions. [2020-04-18 11:44:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:37,793 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:37,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1193480429, now seen corresponding path program 5 times [2020-04-18 11:44:37,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:37,794 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281376382] [2020-04-18 11:44:37,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:37,810 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281376382] [2020-04-18 11:44:37,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:37,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:37,810 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:37,813 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:37,819 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 40 transitions. [2020-04-18 11:44:37,820 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:37,839 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:37,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:37,840 INFO L87 Difference]: Start difference. First operand 171 states and 330 transitions. Second operand 3 states. [2020-04-18 11:44:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:37,849 INFO L93 Difference]: Finished difference Result 181 states and 339 transitions. [2020-04-18 11:44:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 339 transitions. [2020-04-18 11:44:37,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:37,850 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1531480472] [2020-04-18 11:44:37,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:37,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:37,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1531480472] [2020-04-18 11:44:37,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:44:37,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:37,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:44:37,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:37,852 INFO L87 Difference]: Start difference. First operand 13787 states and 45295 transitions. Second operand 13 states. [2020-04-18 11:44:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:38,766 INFO L93 Difference]: Finished difference Result 31898 states and 102145 transitions. [2020-04-18 11:44:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:44:38,766 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 11:44:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:38,820 INFO L225 Difference]: With dead ends: 31898 [2020-04-18 11:44:38,821 INFO L226 Difference]: Without dead ends: 31865 [2020-04-18 11:44:38,821 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:44:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31865 states. [2020-04-18 11:44:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31865 to 13520. [2020-04-18 11:44:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13520 states. [2020-04-18 11:44:39,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13520 states to 13520 states and 44395 transitions. [2020-04-18 11:44:39,229 INFO L78 Accepts]: Start accepts. Automaton has 13520 states and 44395 transitions. Word has length 22 [2020-04-18 11:44:39,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:39,229 INFO L479 AbstractCegarLoop]: Abstraction has 13520 states and 44395 transitions. [2020-04-18 11:44:39,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:44:39,230 INFO L276 IsEmpty]: Start isEmpty. Operand 13520 states and 44395 transitions. [2020-04-18 11:44:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:39,231 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:39,231 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:39,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:39,432 INFO L427 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]=== [2020-04-18 11:44:39,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:39,433 INFO L82 PathProgramCache]: Analyzing trace with hash 321088405, now seen corresponding path program 1 times [2020-04-18 11:44:39,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:39,433 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2074175211] [2020-04-18 11:44:39,435 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:39,436 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 200 transitions. [2020-04-18 11:44:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 11:44:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:39,437 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:39,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:39,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1931259413, now seen corresponding path program 2 times [2020-04-18 11:44:39,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:39,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243589313] [2020-04-18 11:44:39,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:39,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243589313] [2020-04-18 11:44:39,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:39,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:39,449 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:39,452 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:39,460 INFO L259 McrAutomatonBuilder]: Finished intersection with 61 states and 106 transitions. [2020-04-18 11:44:39,460 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:39,470 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:39,470 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 11:44:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:39,480 INFO L93 Difference]: Finished difference Result 117 states and 225 transitions. [2020-04-18 11:44:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 225 transitions. [2020-04-18 11:44:39,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:39,481 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:39,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:39,481 INFO L82 PathProgramCache]: Analyzing trace with hash -862985667, now seen corresponding path program 3 times [2020-04-18 11:44:39,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:39,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481238289] [2020-04-18 11:44:39,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:39,515 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481238289] [2020-04-18 11:44:39,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:39,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:39,516 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:39,519 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:39,527 INFO L259 McrAutomatonBuilder]: Finished intersection with 50 states and 80 transitions. [2020-04-18 11:44:39,527 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:39,545 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:39,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:39,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:39,546 INFO L87 Difference]: Start difference. First operand 117 states and 225 transitions. Second operand 5 states. [2020-04-18 11:44:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:39,593 INFO L93 Difference]: Finished difference Result 129 states and 237 transitions. [2020-04-18 11:44:39,593 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 237 transitions. [2020-04-18 11:44:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:39,593 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 321088405, now seen corresponding path program 4 times [2020-04-18 11:44:39,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:39,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305906460] [2020-04-18 11:44:39,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:39,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305906460] [2020-04-18 11:44:39,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78550745] [2020-04-18 11:44:39,639 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 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 [2020-04-18 11:44:39,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:44:39,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:44:39,728 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:44:39,730 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:44:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:39,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:44:39,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:44:39,774 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:39,776 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:39,782 INFO L259 McrAutomatonBuilder]: Finished intersection with 39 states and 54 transitions. [2020-04-18 11:44:39,782 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:39,840 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:44:39,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:44:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:44:39,841 INFO L87 Difference]: Start difference. First operand 129 states and 237 transitions. Second operand 12 states. [2020-04-18 11:44:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:40,003 INFO L93 Difference]: Finished difference Result 131 states and 238 transitions. [2020-04-18 11:44:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 238 transitions. [2020-04-18 11:44:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:40,003 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1882464195, now seen corresponding path program 5 times [2020-04-18 11:44:40,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:40,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962698020] [2020-04-18 11:44:40,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:40,037 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962698020] [2020-04-18 11:44:40,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:40,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:40,038 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:40,040 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:40,045 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 32 transitions. [2020-04-18 11:44:40,045 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:40,060 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:40,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:40,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:40,060 INFO L87 Difference]: Start difference. First operand 131 states and 238 transitions. Second operand 3 states. [2020-04-18 11:44:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:40,065 INFO L93 Difference]: Finished difference Result 141 states and 247 transitions. [2020-04-18 11:44:40,065 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 247 transitions. [2020-04-18 11:44:40,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:40,066 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2074175211] [2020-04-18 11:44:40,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:40,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:40,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2074175211] [2020-04-18 11:44:40,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:44:40,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:40,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:44:40,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:44:40,067 INFO L87 Difference]: Start difference. First operand 13520 states and 44395 transitions. Second operand 13 states. [2020-04-18 11:44:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:40,902 INFO L93 Difference]: Finished difference Result 32253 states and 103231 transitions. [2020-04-18 11:44:40,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:44:40,902 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-04-18 11:44:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:40,962 INFO L225 Difference]: With dead ends: 32253 [2020-04-18 11:44:40,962 INFO L226 Difference]: Without dead ends: 32220 [2020-04-18 11:44:40,962 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:44:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32220 states. [2020-04-18 11:44:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32220 to 13635. [2020-04-18 11:44:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13635 states. [2020-04-18 11:44:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13635 states to 13635 states and 44805 transitions. [2020-04-18 11:44:41,506 INFO L78 Accepts]: Start accepts. Automaton has 13635 states and 44805 transitions. Word has length 22 [2020-04-18 11:44:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:41,506 INFO L479 AbstractCegarLoop]: Abstraction has 13635 states and 44805 transitions. [2020-04-18 11:44:41,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:44:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 13635 states and 44805 transitions. [2020-04-18 11:44:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:41,507 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:41,507 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:41,708 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:44:41,708 INFO L427 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]=== [2020-04-18 11:44:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1406316126, now seen corresponding path program 1 times [2020-04-18 11:44:41,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:41,710 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [227819948] [2020-04-18 11:44:41,711 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:41,713 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 60 transitions. [2020-04-18 11:44:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-04-18 11:44:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:41,715 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:41,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1081774548, now seen corresponding path program 2 times [2020-04-18 11:44:41,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:41,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270674566] [2020-04-18 11:44:41,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:44:41,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270674566] [2020-04-18 11:44:41,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:41,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:41,730 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:41,732 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:41,737 INFO L259 McrAutomatonBuilder]: Finished intersection with 41 states and 58 transitions. [2020-04-18 11:44:41,737 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:41,741 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:41,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:41,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:41,742 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2020-04-18 11:44:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:41,745 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 11:44:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 11:44:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:41,745 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:41,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1406316126, now seen corresponding path program 3 times [2020-04-18 11:44:41,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:41,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009851413] [2020-04-18 11:44:41,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:44:41,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009851413] [2020-04-18 11:44:41,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:41,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:41,782 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:41,783 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:41,787 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:44:41,787 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:41,797 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:44:41,798 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand 5 states. [2020-04-18 11:44:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:41,817 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2020-04-18 11:44:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2020-04-18 11:44:41,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:41,818 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [227819948] [2020-04-18 11:44:41,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:41,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:44:41,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [227819948] [2020-04-18 11:44:41,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-04-18 11:44:41,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:41,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:41,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:41,819 INFO L87 Difference]: Start difference. First operand 13635 states and 44805 transitions. Second operand 5 states. [2020-04-18 11:44:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:42,072 INFO L93 Difference]: Finished difference Result 23466 states and 75382 transitions. [2020-04-18 11:44:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 11:44:42,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-04-18 11:44:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:42,131 INFO L225 Difference]: With dead ends: 23466 [2020-04-18 11:44:42,131 INFO L226 Difference]: Without dead ends: 23442 [2020-04-18 11:44:42,131 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23442 states. [2020-04-18 11:44:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23442 to 14781. [2020-04-18 11:44:42,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14781 states. [2020-04-18 11:44:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14781 states to 14781 states and 48769 transitions. [2020-04-18 11:44:42,493 INFO L78 Accepts]: Start accepts. Automaton has 14781 states and 48769 transitions. Word has length 22 [2020-04-18 11:44:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:42,494 INFO L479 AbstractCegarLoop]: Abstraction has 14781 states and 48769 transitions. [2020-04-18 11:44:42,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-04-18 11:44:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 14781 states and 48769 transitions. [2020-04-18 11:44:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:42,496 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:42,496 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:42,496 INFO L427 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]=== [2020-04-18 11:44:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:42,496 INFO L82 PathProgramCache]: Analyzing trace with hash -103257068, now seen corresponding path program 1 times [2020-04-18 11:44:42,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:42,497 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2033292260] [2020-04-18 11:44:42,497 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:42,499 INFO L259 McrAutomatonBuilder]: Finished intersection with 90 states and 180 transitions. [2020-04-18 11:44:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2020-04-18 11:44:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:42,500 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:42,500 INFO L82 PathProgramCache]: Analyzing trace with hash -356719324, now seen corresponding path program 2 times [2020-04-18 11:44:42,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:42,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154366487] [2020-04-18 11:44:42,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:42,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154366487] [2020-04-18 11:44:42,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:42,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:42,520 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:42,521 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:42,527 INFO L259 McrAutomatonBuilder]: Finished intersection with 48 states and 76 transitions. [2020-04-18 11:44:42,527 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:42,532 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:42,533 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 3 states. [2020-04-18 11:44:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:42,542 INFO L93 Difference]: Finished difference Result 105 states and 197 transitions. [2020-04-18 11:44:42,542 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 197 transitions. [2020-04-18 11:44:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:42,543 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:42,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1879347916, now seen corresponding path program 3 times [2020-04-18 11:44:42,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:42,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983365660] [2020-04-18 11:44:42,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:42,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983365660] [2020-04-18 11:44:42,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:42,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:42,557 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:42,559 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:42,565 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 41 transitions. [2020-04-18 11:44:42,565 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:42,574 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:42,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:44:42,575 INFO L87 Difference]: Start difference. First operand 105 states and 197 transitions. Second operand 3 states. [2020-04-18 11:44:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:42,580 INFO L93 Difference]: Finished difference Result 114 states and 206 transitions. [2020-04-18 11:44:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 206 transitions. [2020-04-18 11:44:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:42,581 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:42,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:42,581 INFO L82 PathProgramCache]: Analyzing trace with hash 123711172, now seen corresponding path program 4 times [2020-04-18 11:44:42,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:42,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003326175] [2020-04-18 11:44:42,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:42,611 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003326175] [2020-04-18 11:44:42,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:42,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:42,611 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:42,613 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:42,617 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 11:44:42,617 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:42,630 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:42,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:42,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:44:42,630 INFO L87 Difference]: Start difference. First operand 114 states and 206 transitions. Second operand 5 states. [2020-04-18 11:44:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:42,683 INFO L93 Difference]: Finished difference Result 127 states and 218 transitions. [2020-04-18 11:44:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 218 transitions. [2020-04-18 11:44:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:42,684 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash -103257068, now seen corresponding path program 5 times [2020-04-18 11:44:42,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:42,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123637077] [2020-04-18 11:44:42,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:42,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123637077] [2020-04-18 11:44:42,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:42,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:44:42,731 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:42,732 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:42,736 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:44:42,736 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:42,751 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:42,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:42,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-04-18 11:44:42,752 INFO L87 Difference]: Start difference. First operand 127 states and 218 transitions. Second operand 7 states. [2020-04-18 11:44:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:42,864 INFO L93 Difference]: Finished difference Result 129 states and 219 transitions. [2020-04-18 11:44:42,865 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 219 transitions. [2020-04-18 11:44:42,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:42,865 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2033292260] [2020-04-18 11:44:42,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:42,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:44:42,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2033292260] [2020-04-18 11:44:42,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 11:44:42,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 11:44:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:44:42,867 INFO L87 Difference]: Start difference. First operand 14781 states and 48769 transitions. Second operand 8 states. [2020-04-18 11:44:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:43,653 INFO L93 Difference]: Finished difference Result 33669 states and 108193 transitions. [2020-04-18 11:44:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:44:43,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-04-18 11:44:43,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:43,714 INFO L225 Difference]: With dead ends: 33669 [2020-04-18 11:44:43,714 INFO L226 Difference]: Without dead ends: 33617 [2020-04-18 11:44:43,714 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2020-04-18 11:44:43,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33617 states. [2020-04-18 11:44:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33617 to 14680. [2020-04-18 11:44:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14680 states. [2020-04-18 11:44:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14680 states to 14680 states and 48297 transitions. [2020-04-18 11:44:44,279 INFO L78 Accepts]: Start accepts. Automaton has 14680 states and 48297 transitions. Word has length 22 [2020-04-18 11:44:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:44,280 INFO L479 AbstractCegarLoop]: Abstraction has 14680 states and 48297 transitions. [2020-04-18 11:44:44,280 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 11:44:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 14680 states and 48297 transitions. [2020-04-18 11:44:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:44,281 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:44,281 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:44,281 INFO L427 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]=== [2020-04-18 11:44:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash -103169493, now seen corresponding path program 1 times [2020-04-18 11:44:44,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:44,282 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [833683968] [2020-04-18 11:44:44,282 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:44,284 INFO L259 McrAutomatonBuilder]: Finished intersection with 114 states and 240 transitions. [2020-04-18 11:44:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2020-04-18 11:44:44,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:44,285 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:44,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:44,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1257013041, now seen corresponding path program 2 times [2020-04-18 11:44:44,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:44,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431520779] [2020-04-18 11:44:44,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:44,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431520779] [2020-04-18 11:44:44,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:44,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:44,299 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:44,300 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:44,309 INFO L259 McrAutomatonBuilder]: Finished intersection with 81 states and 155 transitions. [2020-04-18 11:44:44,309 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:44,313 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:44,314 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2020-04-18 11:44:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:44,326 INFO L93 Difference]: Finished difference Result 133 states and 261 transitions. [2020-04-18 11:44:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 261 transitions. [2020-04-18 11:44:44,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:44,327 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1311035153, now seen corresponding path program 3 times [2020-04-18 11:44:44,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:44,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884463399] [2020-04-18 11:44:44,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:44,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:44,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884463399] [2020-04-18 11:44:44,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:44,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:44,344 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:44,346 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:44,353 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 94 transitions. [2020-04-18 11:44:44,353 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:44,382 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:44:44,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:44:44,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:44:44,383 INFO L87 Difference]: Start difference. First operand 133 states and 261 transitions. Second operand 6 states. [2020-04-18 11:44:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:44,454 INFO L93 Difference]: Finished difference Result 139 states and 268 transitions. [2020-04-18 11:44:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 268 transitions. [2020-04-18 11:44:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:44,455 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 123713997, now seen corresponding path program 4 times [2020-04-18 11:44:44,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:44,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984084871] [2020-04-18 11:44:44,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:44,490 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984084871] [2020-04-18 11:44:44,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:44,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:44,490 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:44,492 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:44,496 INFO L259 McrAutomatonBuilder]: Finished intersection with 26 states and 28 transitions. [2020-04-18 11:44:44,496 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:44,515 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:44,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:44,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 11:44:44,515 INFO L87 Difference]: Start difference. First operand 139 states and 268 transitions. Second operand 5 states. [2020-04-18 11:44:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:44,571 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-04-18 11:44:44,571 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 280 transitions. [2020-04-18 11:44:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-04-18 11:44:44,571 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:44,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:44,572 INFO L82 PathProgramCache]: Analyzing trace with hash -103169493, now seen corresponding path program 5 times [2020-04-18 11:44:44,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:44,572 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394757760] [2020-04-18 11:44:44,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:44,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394757760] [2020-04-18 11:44:44,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:44,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:44:44,616 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:44,618 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:44,622 INFO L259 McrAutomatonBuilder]: Finished intersection with 23 states and 22 transitions. [2020-04-18 11:44:44,622 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:44,645 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:44:44,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:44:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-04-18 11:44:44,646 INFO L87 Difference]: Start difference. First operand 152 states and 280 transitions. Second operand 7 states. [2020-04-18 11:44:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:44,760 INFO L93 Difference]: Finished difference Result 154 states and 281 transitions. [2020-04-18 11:44:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 281 transitions. [2020-04-18 11:44:44,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:44,761 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [833683968] [2020-04-18 11:44:44,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:44,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:44:44,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [833683968] [2020-04-18 11:44:44,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 11:44:44,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:44,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:44:44,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 11:44:44,762 INFO L87 Difference]: Start difference. First operand 14680 states and 48297 transitions. Second operand 11 states. [2020-04-18 11:44:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:46,302 INFO L93 Difference]: Finished difference Result 46759 states and 144726 transitions. [2020-04-18 11:44:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:44:46,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-04-18 11:44:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:44:46,384 INFO L225 Difference]: With dead ends: 46759 [2020-04-18 11:44:46,384 INFO L226 Difference]: Without dead ends: 46707 [2020-04-18 11:44:46,385 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 11:44:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46707 states. [2020-04-18 11:44:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46707 to 14368. [2020-04-18 11:44:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14368 states. [2020-04-18 11:44:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14368 states to 14368 states and 47032 transitions. [2020-04-18 11:44:47,195 INFO L78 Accepts]: Start accepts. Automaton has 14368 states and 47032 transitions. Word has length 22 [2020-04-18 11:44:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:44:47,195 INFO L479 AbstractCegarLoop]: Abstraction has 14368 states and 47032 transitions. [2020-04-18 11:44:47,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 11:44:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 14368 states and 47032 transitions. [2020-04-18 11:44:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:44:47,198 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:44:47,198 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:44:47,198 INFO L427 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]=== [2020-04-18 11:44:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1988994578, now seen corresponding path program 1 times [2020-04-18 11:44:47,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:44:47,199 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [804033437] [2020-04-18 11:44:47,200 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:47,206 INFO L259 McrAutomatonBuilder]: Finished intersection with 450 states and 1296 transitions. [2020-04-18 11:44:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states. [2020-04-18 11:44:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:44:47,209 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:44:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:47,210 INFO L82 PathProgramCache]: Analyzing trace with hash -24322188, now seen corresponding path program 2 times [2020-04-18 11:44:47,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:47,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122249381] [2020-04-18 11:44:47,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:47,225 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122249381] [2020-04-18 11:44:47,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:47,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:44:47,226 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:47,228 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:47,244 INFO L259 McrAutomatonBuilder]: Finished intersection with 93 states and 174 transitions. [2020-04-18 11:44:47,244 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:47,249 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:44:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:44:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:44:47,250 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 3 states. [2020-04-18 11:44:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:47,266 INFO L93 Difference]: Finished difference Result 595 states and 1614 transitions. [2020-04-18 11:44:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1614 transitions. [2020-04-18 11:44:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:44:47,268 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:44:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1433196898, now seen corresponding path program 3 times [2020-04-18 11:44:47,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:47,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157596199] [2020-04-18 11:44:47,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:44:47,294 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157596199] [2020-04-18 11:44:47,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:47,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:44:47,295 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:47,297 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:47,317 INFO L259 McrAutomatonBuilder]: Finished intersection with 87 states and 158 transitions. [2020-04-18 11:44:47,317 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:47,335 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:44:47,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:44:47,335 INFO L87 Difference]: Start difference. First operand 595 states and 1614 transitions. Second operand 5 states. [2020-04-18 11:44:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:47,387 INFO L93 Difference]: Finished difference Result 683 states and 1812 transitions. [2020-04-18 11:44:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1812 transitions. [2020-04-18 11:44:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:44:47,388 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:44:47,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1986009932, now seen corresponding path program 4 times [2020-04-18 11:44:47,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:47,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747403268] [2020-04-18 11:44:47,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:47,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747403268] [2020-04-18 11:44:47,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:47,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:44:47,423 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:47,425 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:47,441 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 192 transitions. [2020-04-18 11:44:47,441 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:47,459 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:44:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:44:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:44:47,459 INFO L87 Difference]: Start difference. First operand 683 states and 1812 transitions. Second operand 5 states. [2020-04-18 11:44:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:47,545 INFO L93 Difference]: Finished difference Result 941 states and 2380 transitions. [2020-04-18 11:44:47,545 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 2380 transitions. [2020-04-18 11:44:47,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:44:47,547 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:44:47,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1481190788, now seen corresponding path program 5 times [2020-04-18 11:44:47,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:47,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131406860] [2020-04-18 11:44:47,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:47,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131406860] [2020-04-18 11:44:47,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549766262] [2020-04-18 11:44:47,629 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-04-18 11:44:47,780 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:44:47,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:44:47,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 11:44:47,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:44:47,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:44:47,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:44:47,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 11:44:47,938 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:47,944 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:47,977 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 11:44:47,977 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:48,351 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 19 times. [2020-04-18 11:44:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-04-18 11:44:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2020-04-18 11:44:48,352 INFO L87 Difference]: Start difference. First operand 941 states and 2380 transitions. Second operand 25 states. [2020-04-18 11:44:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:50,034 INFO L93 Difference]: Finished difference Result 1088 states and 2648 transitions. [2020-04-18 11:44:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 2648 transitions. [2020-04-18 11:44:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:44:50,036 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:44:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:44:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1787060110, now seen corresponding path program 6 times [2020-04-18 11:44:50,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:44:50,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305254672] [2020-04-18 11:44:50,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:44:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:44:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:44:50,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305254672] [2020-04-18 11:44:50,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:44:50,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:44:50,104 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:44:50,107 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:44:50,124 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 11:44:50,124 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:44:50,307 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 16 times. [2020-04-18 11:44:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:44:50,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=870, Invalid=3162, Unknown=0, NotChecked=0, Total=4032 [2020-04-18 11:44:50,308 INFO L87 Difference]: Start difference. First operand 1088 states and 2648 transitions. Second operand 17 states. [2020-04-18 11:44:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:44:51,372 INFO L93 Difference]: Finished difference Result 1206 states and 2925 transitions. [2020-04-18 11:44:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2925 transitions. [2020-04-18 11:44:51,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:44:51,374 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [804033437] [2020-04-18 11:44:51,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:44:51,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:44:51,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [804033437] [2020-04-18 11:44:51,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-04-18 11:44:51,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:44:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-04-18 11:44:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1419, Invalid=5721, Unknown=0, NotChecked=0, Total=7140 [2020-04-18 11:44:51,377 INFO L87 Difference]: Start difference. First operand 14368 states and 47032 transitions. Second operand 36 states. [2020-04-18 11:44:58,453 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-04-18 11:45:08,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:08,473 INFO L93 Difference]: Finished difference Result 63324 states and 183604 transitions. [2020-04-18 11:45:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2020-04-18 11:45:08,474 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 26 [2020-04-18 11:45:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:08,579 INFO L225 Difference]: With dead ends: 63324 [2020-04-18 11:45:08,579 INFO L226 Difference]: Without dead ends: 63182 [2020-04-18 11:45:08,587 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55959 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=16544, Invalid=109126, Unknown=0, NotChecked=0, Total=125670 [2020-04-18 11:45:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63182 states. [2020-04-18 11:45:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63182 to 14062. [2020-04-18 11:45:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14062 states. [2020-04-18 11:45:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14062 states to 14062 states and 46098 transitions. [2020-04-18 11:45:09,410 INFO L78 Accepts]: Start accepts. Automaton has 14062 states and 46098 transitions. Word has length 26 [2020-04-18 11:45:09,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:09,410 INFO L479 AbstractCegarLoop]: Abstraction has 14062 states and 46098 transitions. [2020-04-18 11:45:09,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-04-18 11:45:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14062 states and 46098 transitions. [2020-04-18 11:45:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:09,413 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:09,413 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:09,613 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:09,614 INFO L427 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]=== [2020-04-18 11:45:09,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -903766857, now seen corresponding path program 1 times [2020-04-18 11:45:09,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:09,615 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [969391137] [2020-04-18 11:45:09,616 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:09,621 INFO L259 McrAutomatonBuilder]: Finished intersection with 170 states and 372 transitions. [2020-04-18 11:45:09,622 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2020-04-18 11:45:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:09,622 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:09,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:09,623 INFO L82 PathProgramCache]: Analyzing trace with hash -749516493, now seen corresponding path program 2 times [2020-04-18 11:45:09,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:09,623 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033181784] [2020-04-18 11:45:09,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:09,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033181784] [2020-04-18 11:45:09,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:09,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:09,636 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:09,638 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:09,653 INFO L259 McrAutomatonBuilder]: Finished intersection with 117 states and 230 transitions. [2020-04-18 11:45:09,653 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:09,658 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:09,659 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2020-04-18 11:45:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:09,668 INFO L93 Difference]: Finished difference Result 205 states and 421 transitions. [2020-04-18 11:45:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 421 transitions. [2020-04-18 11:45:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:09,669 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:09,669 INFO L82 PathProgramCache]: Analyzing trace with hash 708002593, now seen corresponding path program 3 times [2020-04-18 11:45:09,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:09,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744416241] [2020-04-18 11:45:09,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:09,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744416241] [2020-04-18 11:45:09,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:09,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:09,701 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:09,704 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:09,718 INFO L259 McrAutomatonBuilder]: Finished intersection with 102 states and 188 transitions. [2020-04-18 11:45:09,718 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:09,730 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:09,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:45:09,730 INFO L87 Difference]: Start difference. First operand 205 states and 421 transitions. Second operand 5 states. [2020-04-18 11:45:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:09,778 INFO L93 Difference]: Finished difference Result 217 states and 433 transitions. [2020-04-18 11:45:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 433 transitions. [2020-04-18 11:45:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:09,779 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:09,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:09,779 INFO L82 PathProgramCache]: Analyzing trace with hash -903766857, now seen corresponding path program 4 times [2020-04-18 11:45:09,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:09,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161434656] [2020-04-18 11:45:09,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:09,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161434656] [2020-04-18 11:45:09,849 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918699827] [2020-04-18 11:45:09,849 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 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 [2020-04-18 11:45:09,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:45:09,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:09,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:45:09,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:10,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:10,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:45:10,038 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:10,043 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:10,069 INFO L259 McrAutomatonBuilder]: Finished intersection with 75 states and 122 transitions. [2020-04-18 11:45:10,069 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:10,141 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:10,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:45:10,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:45:10,142 INFO L87 Difference]: Start difference. First operand 217 states and 433 transitions. Second operand 12 states. [2020-04-18 11:45:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:10,313 INFO L93 Difference]: Finished difference Result 219 states and 434 transitions. [2020-04-18 11:45:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 434 transitions. [2020-04-18 11:45:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:10,314 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:10,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:10,314 INFO L82 PathProgramCache]: Analyzing trace with hash 170820769, now seen corresponding path program 5 times [2020-04-18 11:45:10,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:10,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827527603] [2020-04-18 11:45:10,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:10,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827527603] [2020-04-18 11:45:10,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:10,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:10,335 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:10,338 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:10,348 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 52 transitions. [2020-04-18 11:45:10,348 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:10,360 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:10,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:10,361 INFO L87 Difference]: Start difference. First operand 219 states and 434 transitions. Second operand 3 states. [2020-04-18 11:45:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:10,367 INFO L93 Difference]: Finished difference Result 229 states and 443 transitions. [2020-04-18 11:45:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 443 transitions. [2020-04-18 11:45:10,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:10,368 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [969391137] [2020-04-18 11:45:10,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:10,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:45:10,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [969391137] [2020-04-18 11:45:10,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:45:10,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:10,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:10,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:10,370 INFO L87 Difference]: Start difference. First operand 14062 states and 46098 transitions. Second operand 13 states. [2020-04-18 11:45:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:11,168 INFO L93 Difference]: Finished difference Result 30569 states and 97104 transitions. [2020-04-18 11:45:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:11,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 11:45:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:11,220 INFO L225 Difference]: With dead ends: 30569 [2020-04-18 11:45:11,220 INFO L226 Difference]: Without dead ends: 30533 [2020-04-18 11:45:11,221 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:45:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30533 states. [2020-04-18 11:45:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30533 to 14028. [2020-04-18 11:45:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14028 states. [2020-04-18 11:45:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14028 states to 14028 states and 45998 transitions. [2020-04-18 11:45:11,618 INFO L78 Accepts]: Start accepts. Automaton has 14028 states and 45998 transitions. Word has length 26 [2020-04-18 11:45:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:11,618 INFO L479 AbstractCegarLoop]: Abstraction has 14028 states and 45998 transitions. [2020-04-18 11:45:11,618 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:45:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 14028 states and 45998 transitions. [2020-04-18 11:45:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:11,621 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:11,621 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:11,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:11,822 INFO L427 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]=== [2020-04-18 11:45:11,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1881627245, now seen corresponding path program 1 times [2020-04-18 11:45:11,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:11,823 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1385025781] [2020-04-18 11:45:11,824 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:11,832 INFO L259 McrAutomatonBuilder]: Finished intersection with 410 states and 1164 transitions. [2020-04-18 11:45:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states. [2020-04-18 11:45:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:11,835 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:11,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:11,835 INFO L82 PathProgramCache]: Analyzing trace with hash -24322399, now seen corresponding path program 2 times [2020-04-18 11:45:11,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:11,836 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813368854] [2020-04-18 11:45:11,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:11,848 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813368854] [2020-04-18 11:45:11,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:11,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:11,848 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:11,850 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:11,864 INFO L259 McrAutomatonBuilder]: Finished intersection with 95 states and 178 transitions. [2020-04-18 11:45:11,864 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:11,869 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:11,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:11,869 INFO L87 Difference]: Start difference. First operand 410 states. Second operand 3 states. [2020-04-18 11:45:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:11,884 INFO L93 Difference]: Finished difference Result 535 states and 1426 transitions. [2020-04-18 11:45:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1426 transitions. [2020-04-18 11:45:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:11,885 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1433196687, now seen corresponding path program 3 times [2020-04-18 11:45:11,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:11,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961671769] [2020-04-18 11:45:11,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:45:11,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961671769] [2020-04-18 11:45:11,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:11,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:11,901 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:11,903 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:11,922 INFO L259 McrAutomatonBuilder]: Finished intersection with 89 states and 162 transitions. [2020-04-18 11:45:11,922 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:11,947 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:11,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-04-18 11:45:11,948 INFO L87 Difference]: Start difference. First operand 535 states and 1426 transitions. Second operand 5 states. [2020-04-18 11:45:11,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:11,991 INFO L93 Difference]: Finished difference Result 591 states and 1544 transitions. [2020-04-18 11:45:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1544 transitions. [2020-04-18 11:45:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:11,992 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:11,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash 105117355, now seen corresponding path program 4 times [2020-04-18 11:45:11,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:11,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174165125] [2020-04-18 11:45:11,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:12,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174165125] [2020-04-18 11:45:12,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:12,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:12,024 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:12,027 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:12,043 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 11:45:12,043 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:12,060 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:12,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:12,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-04-18 11:45:12,061 INFO L87 Difference]: Start difference. First operand 591 states and 1544 transitions. Second operand 5 states. [2020-04-18 11:45:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:12,135 INFO L93 Difference]: Finished difference Result 789 states and 1948 transitions. [2020-04-18 11:45:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1948 transitions. [2020-04-18 11:45:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:12,137 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2108595485, now seen corresponding path program 5 times [2020-04-18 11:45:12,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:12,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930377522] [2020-04-18 11:45:12,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:12,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930377522] [2020-04-18 11:45:12,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102585199] [2020-04-18 11:45:12,180 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-04-18 11:45:12,272 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:45:12,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:12,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 11:45:12,274 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:12,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:12,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 11:45:12,344 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:12,346 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:12,357 INFO L259 McrAutomatonBuilder]: Finished intersection with 62 states and 96 transitions. [2020-04-18 11:45:12,358 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:12,459 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:12,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:12,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:45:12,459 INFO L87 Difference]: Start difference. First operand 789 states and 1948 transitions. Second operand 13 states. [2020-04-18 11:45:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:13,187 INFO L93 Difference]: Finished difference Result 920 states and 2170 transitions. [2020-04-18 11:45:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2170 transitions. [2020-04-18 11:45:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:13,188 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:45:13,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:13,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1881627245, now seen corresponding path program 6 times [2020-04-18 11:45:13,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:13,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173355666] [2020-04-18 11:45:13,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:13,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173355666] [2020-04-18 11:45:13,246 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035724639] [2020-04-18 11:45:13,247 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2020-04-18 11:45:13,336 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2020-04-18 11:45:13,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:13,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 11:45:13,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:13,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:13,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 11:45:13,441 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:13,443 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:13,455 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 11:45:13,455 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:13,585 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:45:13,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1107, Unknown=0, NotChecked=0, Total=1406 [2020-04-18 11:45:13,586 INFO L87 Difference]: Start difference. First operand 920 states and 2170 transitions. Second operand 17 states. [2020-04-18 11:45:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:14,991 INFO L93 Difference]: Finished difference Result 996 states and 2288 transitions. [2020-04-18 11:45:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 2288 transitions. [2020-04-18 11:45:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:14,993 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:45:14,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash 359047781, now seen corresponding path program 7 times [2020-04-18 11:45:14,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:14,993 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275554534] [2020-04-18 11:45:14,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:15,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275554534] [2020-04-18 11:45:15,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:15,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:45:15,040 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:15,043 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:15,050 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 11:45:15,050 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:15,219 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:15,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=4043, Unknown=0, NotChecked=0, Total=4970 [2020-04-18 11:45:15,220 INFO L87 Difference]: Start difference. First operand 996 states and 2288 transitions. Second operand 9 states. [2020-04-18 11:45:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:16,721 INFO L93 Difference]: Finished difference Result 1842 states and 4190 transitions. [2020-04-18 11:45:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 4190 transitions. [2020-04-18 11:45:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:16,724 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 11:45:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash 358942811, now seen corresponding path program 8 times [2020-04-18 11:45:16,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:16,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275607483] [2020-04-18 11:45:16,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:16,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275607483] [2020-04-18 11:45:16,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:16,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:45:16,779 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:16,781 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:16,788 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:16,788 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:16,788 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1428, Invalid=8274, Unknown=0, NotChecked=0, Total=9702 [2020-04-18 11:45:16,790 INFO L87 Difference]: Start difference. First operand 1842 states and 4190 transitions. Second operand 9 states. [2020-04-18 11:45:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:17,415 INFO L93 Difference]: Finished difference Result 1950 states and 4390 transitions. [2020-04-18 11:45:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 4390 transitions. [2020-04-18 11:45:17,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:17,418 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1385025781] [2020-04-18 11:45:17,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:17,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:45:17,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1385025781] [2020-04-18 11:45:17,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-04-18 11:45:17,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:17,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-04-18 11:45:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=11343, Unknown=0, NotChecked=0, Total=13110 [2020-04-18 11:45:17,420 INFO L87 Difference]: Start difference. First operand 14028 states and 45998 transitions. Second operand 28 states. [2020-04-18 11:45:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:25,048 INFO L93 Difference]: Finished difference Result 54961 states and 169015 transitions. [2020-04-18 11:45:25,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2020-04-18 11:45:25,049 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 26 [2020-04-18 11:45:25,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:25,145 INFO L225 Difference]: With dead ends: 54961 [2020-04-18 11:45:25,145 INFO L226 Difference]: Without dead ends: 54844 [2020-04-18 11:45:25,148 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20448 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6250, Invalid=44600, Unknown=0, NotChecked=0, Total=50850 [2020-04-18 11:45:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54844 states. [2020-04-18 11:45:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54844 to 13418. [2020-04-18 11:45:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13418 states. [2020-04-18 11:45:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13418 states to 13418 states and 43847 transitions. [2020-04-18 11:45:25,844 INFO L78 Accepts]: Start accepts. Automaton has 13418 states and 43847 transitions. Word has length 26 [2020-04-18 11:45:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:25,844 INFO L479 AbstractCegarLoop]: Abstraction has 13418 states and 43847 transitions. [2020-04-18 11:45:25,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-04-18 11:45:25,844 INFO L276 IsEmpty]: Start isEmpty. Operand 13418 states and 43847 transitions. [2020-04-18 11:45:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:25,847 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:25,847 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:26,248 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:26,248 INFO L427 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]=== [2020-04-18 11:45:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:26,249 INFO L82 PathProgramCache]: Analyzing trace with hash 75485767, now seen corresponding path program 1 times [2020-04-18 11:45:26,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:26,250 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [798168678] [2020-04-18 11:45:26,251 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:26,255 INFO L259 McrAutomatonBuilder]: Finished intersection with 138 states and 292 transitions. [2020-04-18 11:45:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2020-04-18 11:45:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:26,256 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:26,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:26,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1083187619, now seen corresponding path program 2 times [2020-04-18 11:45:26,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:26,256 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024832403] [2020-04-18 11:45:26,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:26,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024832403] [2020-04-18 11:45:26,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:26,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:26,267 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:26,268 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:26,281 INFO L259 McrAutomatonBuilder]: Finished intersection with 93 states and 174 transitions. [2020-04-18 11:45:26,281 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:26,285 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:26,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:26,286 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2020-04-18 11:45:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:26,295 INFO L93 Difference]: Finished difference Result 165 states and 329 transitions. [2020-04-18 11:45:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 329 transitions. [2020-04-18 11:45:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:26,295 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2021850677, now seen corresponding path program 3 times [2020-04-18 11:45:26,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:26,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491167110] [2020-04-18 11:45:26,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:26,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491167110] [2020-04-18 11:45:26,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:26,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:26,337 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:26,339 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:26,353 INFO L259 McrAutomatonBuilder]: Finished intersection with 78 states and 136 transitions. [2020-04-18 11:45:26,354 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:26,365 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:26,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:45:26,365 INFO L87 Difference]: Start difference. First operand 165 states and 329 transitions. Second operand 5 states. [2020-04-18 11:45:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:26,411 INFO L93 Difference]: Finished difference Result 177 states and 341 transitions. [2020-04-18 11:45:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 341 transitions. [2020-04-18 11:45:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:26,412 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:26,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:26,412 INFO L82 PathProgramCache]: Analyzing trace with hash 75485767, now seen corresponding path program 4 times [2020-04-18 11:45:26,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:26,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135553861] [2020-04-18 11:45:26,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:26,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135553861] [2020-04-18 11:45:26,459 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964546962] [2020-04-18 11:45:26,459 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 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 [2020-04-18 11:45:26,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:45:26,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:26,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:45:26,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:26,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:26,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:26,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:45:26,607 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:26,608 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:26,619 INFO L259 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-04-18 11:45:26,619 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:26,684 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:26,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:45:26,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:45:26,685 INFO L87 Difference]: Start difference. First operand 177 states and 341 transitions. Second operand 12 states. [2020-04-18 11:45:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:26,840 INFO L93 Difference]: Finished difference Result 179 states and 342 transitions. [2020-04-18 11:45:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 342 transitions. [2020-04-18 11:45:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:26,841 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:26,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1567135947, now seen corresponding path program 5 times [2020-04-18 11:45:26,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:26,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400048820] [2020-04-18 11:45:26,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:26,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400048820] [2020-04-18 11:45:26,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:26,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:26,856 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:26,858 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:26,865 INFO L259 McrAutomatonBuilder]: Finished intersection with 36 states and 44 transitions. [2020-04-18 11:45:26,865 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:26,875 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:26,876 INFO L87 Difference]: Start difference. First operand 179 states and 342 transitions. Second operand 3 states. [2020-04-18 11:45:26,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:26,882 INFO L93 Difference]: Finished difference Result 189 states and 351 transitions. [2020-04-18 11:45:26,882 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 351 transitions. [2020-04-18 11:45:26,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:26,882 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [798168678] [2020-04-18 11:45:26,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:26,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:45:26,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [798168678] [2020-04-18 11:45:26,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:45:26,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:26,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:26,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:26,883 INFO L87 Difference]: Start difference. First operand 13418 states and 43847 transitions. Second operand 13 states. [2020-04-18 11:45:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:27,764 INFO L93 Difference]: Finished difference Result 31002 states and 98548 transitions. [2020-04-18 11:45:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:27,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 11:45:27,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:27,816 INFO L225 Difference]: With dead ends: 31002 [2020-04-18 11:45:27,816 INFO L226 Difference]: Without dead ends: 30966 [2020-04-18 11:45:27,817 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:45:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30966 states. [2020-04-18 11:45:28,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30966 to 13888. [2020-04-18 11:45:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13888 states. [2020-04-18 11:45:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13888 states to 13888 states and 45598 transitions. [2020-04-18 11:45:28,222 INFO L78 Accepts]: Start accepts. Automaton has 13888 states and 45598 transitions. Word has length 26 [2020-04-18 11:45:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:28,222 INFO L479 AbstractCegarLoop]: Abstraction has 13888 states and 45598 transitions. [2020-04-18 11:45:28,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:45:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 13888 states and 45598 transitions. [2020-04-18 11:45:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:28,225 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:28,225 INFO L425 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:28,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:28,426 INFO L427 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]=== [2020-04-18 11:45:28,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1433999852, now seen corresponding path program 1 times [2020-04-18 11:45:28,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:28,427 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [561531097] [2020-04-18 11:45:28,428 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:28,435 INFO L259 McrAutomatonBuilder]: Finished intersection with 402 states and 1144 transitions. [2020-04-18 11:45:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states. [2020-04-18 11:45:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:28,437 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1551680160, now seen corresponding path program 2 times [2020-04-18 11:45:28,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:28,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713167426] [2020-04-18 11:45:28,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:28,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713167426] [2020-04-18 11:45:28,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:28,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:28,454 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:28,456 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:28,474 INFO L259 McrAutomatonBuilder]: Finished intersection with 109 states and 228 transitions. [2020-04-18 11:45:28,475 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:28,479 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:28,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:28,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:28,480 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 3 states. [2020-04-18 11:45:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:28,499 INFO L93 Difference]: Finished difference Result 523 states and 1398 transitions. [2020-04-18 11:45:28,499 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 1398 transitions. [2020-04-18 11:45:28,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:28,500 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:28,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1696621918, now seen corresponding path program 3 times [2020-04-18 11:45:28,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:28,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006818663] [2020-04-18 11:45:28,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 11:45:28,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006818663] [2020-04-18 11:45:28,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:28,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:28,522 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:28,523 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:28,538 INFO L259 McrAutomatonBuilder]: Finished intersection with 82 states and 148 transitions. [2020-04-18 11:45:28,538 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:28,565 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:45:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:45:28,566 INFO L87 Difference]: Start difference. First operand 523 states and 1398 transitions. Second operand 6 states. [2020-04-18 11:45:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:28,668 INFO L93 Difference]: Finished difference Result 579 states and 1516 transitions. [2020-04-18 11:45:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1516 transitions. [2020-04-18 11:45:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:28,669 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1670234206, now seen corresponding path program 4 times [2020-04-18 11:45:28,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:28,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553996252] [2020-04-18 11:45:28,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:28,821 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-04-18 11:45:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:28,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553996252] [2020-04-18 11:45:28,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:28,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:28,833 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:28,835 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:28,845 INFO L259 McrAutomatonBuilder]: Finished intersection with 54 states and 84 transitions. [2020-04-18 11:45:28,845 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:28,863 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:28,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:28,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-04-18 11:45:28,864 INFO L87 Difference]: Start difference. First operand 579 states and 1516 transitions. Second operand 5 states. [2020-04-18 11:45:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:28,951 INFO L93 Difference]: Finished difference Result 777 states and 1920 transitions. [2020-04-18 11:45:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1920 transitions. [2020-04-18 11:45:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:28,953 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:28,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:28,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1207116362, now seen corresponding path program 5 times [2020-04-18 11:45:28,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:28,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990677481] [2020-04-18 11:45:28,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:28,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990677481] [2020-04-18 11:45:28,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254476133] [2020-04-18 11:45:28,995 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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 [2020-04-18 11:45:29,088 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2020-04-18 11:45:29,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:29,089 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2020-04-18 11:45:29,090 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-04-18 11:45:29,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:29,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-04-18 11:45:29,171 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:29,173 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:29,182 INFO L259 McrAutomatonBuilder]: Finished intersection with 46 states and 64 transitions. [2020-04-18 11:45:29,182 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:29,276 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:29,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:29,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:29,277 INFO L87 Difference]: Start difference. First operand 777 states and 1920 transitions. Second operand 13 states. [2020-04-18 11:45:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:29,877 INFO L93 Difference]: Finished difference Result 908 states and 2142 transitions. [2020-04-18 11:45:29,878 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 2142 transitions. [2020-04-18 11:45:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:29,879 INFO L105 Mcr]: ---- MCR iteration 4 ---- [2020-04-18 11:45:29,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:29,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1433999852, now seen corresponding path program 6 times [2020-04-18 11:45:29,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:29,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084250885] [2020-04-18 11:45:29,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:29,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084250885] [2020-04-18 11:45:29,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807188195] [2020-04-18 11:45:29,933 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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 [2020-04-18 11:45:30,025 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-04-18 11:45:30,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:30,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2020-04-18 11:45:30,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-04-18 11:45:30,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:30,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2020-04-18 11:45:30,108 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:30,110 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:30,119 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 58 transitions. [2020-04-18 11:45:30,119 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:30,240 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:30,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-04-18 11:45:30,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1238, Unknown=0, NotChecked=0, Total=1560 [2020-04-18 11:45:30,241 INFO L87 Difference]: Start difference. First operand 908 states and 2142 transitions. Second operand 17 states. [2020-04-18 11:45:31,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:31,647 INFO L93 Difference]: Finished difference Result 984 states and 2260 transitions. [2020-04-18 11:45:31,648 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 2260 transitions. [2020-04-18 11:45:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:31,649 INFO L105 Mcr]: ---- MCR iteration 5 ---- [2020-04-18 11:45:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:31,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1096351706, now seen corresponding path program 7 times [2020-04-18 11:45:31,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:31,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839831954] [2020-04-18 11:45:31,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:31,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839831954] [2020-04-18 11:45:31,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:31,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-04-18 11:45:31,714 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:31,716 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:31,723 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 11:45:31,723 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:31,854 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=4261, Unknown=0, NotChecked=0, Total=5256 [2020-04-18 11:45:31,855 INFO L87 Difference]: Start difference. First operand 984 states and 2260 transitions. Second operand 9 states. [2020-04-18 11:45:32,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:32,926 INFO L93 Difference]: Finished difference Result 1493 states and 3396 transitions. [2020-04-18 11:45:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 3396 transitions. [2020-04-18 11:45:32,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:32,928 INFO L105 Mcr]: ---- MCR iteration 6 ---- [2020-04-18 11:45:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:32,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1096216166, now seen corresponding path program 8 times [2020-04-18 11:45:32,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:32,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108381454] [2020-04-18 11:45:32,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-04-18 11:45:32,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108381454] [2020-04-18 11:45:32,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:32,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-04-18 11:45:32,986 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:32,988 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:32,993 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:32,994 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:32,994 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-04-18 11:45:32,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1419, Invalid=7893, Unknown=0, NotChecked=0, Total=9312 [2020-04-18 11:45:32,995 INFO L87 Difference]: Start difference. First operand 1493 states and 3396 transitions. Second operand 9 states. [2020-04-18 11:45:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:33,648 INFO L93 Difference]: Finished difference Result 1589 states and 3582 transitions. [2020-04-18 11:45:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 3582 transitions. [2020-04-18 11:45:33,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:33,651 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [561531097] [2020-04-18 11:45:33,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:33,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 11:45:33,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [561531097] [2020-04-18 11:45:33,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-04-18 11:45:33,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-04-18 11:45:33,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1824, Invalid=11286, Unknown=0, NotChecked=0, Total=13110 [2020-04-18 11:45:33,653 INFO L87 Difference]: Start difference. First operand 13888 states and 45598 transitions. Second operand 29 states. [2020-04-18 11:45:41,721 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2020-04-18 11:45:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:43,687 INFO L93 Difference]: Finished difference Result 63978 states and 195074 transitions. [2020-04-18 11:45:43,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2020-04-18 11:45:43,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 26 [2020-04-18 11:45:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:43,800 INFO L225 Difference]: With dead ends: 63978 [2020-04-18 11:45:43,801 INFO L226 Difference]: Without dead ends: 63837 [2020-04-18 11:45:43,803 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31172 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=8415, Invalid=65841, Unknown=0, NotChecked=0, Total=74256 [2020-04-18 11:45:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63837 states. [2020-04-18 11:45:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63837 to 12973. [2020-04-18 11:45:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12973 states. [2020-04-18 11:45:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12973 states to 12973 states and 42382 transitions. [2020-04-18 11:45:44,430 INFO L78 Accepts]: Start accepts. Automaton has 12973 states and 42382 transitions. Word has length 26 [2020-04-18 11:45:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:44,430 INFO L479 AbstractCegarLoop]: Abstraction has 12973 states and 42382 transitions. [2020-04-18 11:45:44,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-04-18 11:45:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 12973 states and 42382 transitions. [2020-04-18 11:45:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:44,433 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:44,433 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:44,836 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:44,837 INFO L427 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]=== [2020-04-18 11:45:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1843074133, now seen corresponding path program 1 times [2020-04-18 11:45:44,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:44,838 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [976815572] [2020-04-18 11:45:44,840 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:44,842 INFO L259 McrAutomatonBuilder]: Finished intersection with 106 states and 212 transitions. [2020-04-18 11:45:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2020-04-18 11:45:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:44,843 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:44,843 INFO L82 PathProgramCache]: Analyzing trace with hash -522361387, now seen corresponding path program 2 times [2020-04-18 11:45:44,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:44,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841330184] [2020-04-18 11:45:44,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:44,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841330184] [2020-04-18 11:45:44,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:44,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:44,872 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:44,875 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:44,886 INFO L259 McrAutomatonBuilder]: Finished intersection with 69 states and 118 transitions. [2020-04-18 11:45:44,887 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:44,892 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:44,892 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 3 states. [2020-04-18 11:45:44,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:44,901 INFO L93 Difference]: Finished difference Result 125 states and 237 transitions. [2020-04-18 11:45:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 237 transitions. [2020-04-18 11:45:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:44,901 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1137219879, now seen corresponding path program 3 times [2020-04-18 11:45:44,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:44,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157631926] [2020-04-18 11:45:44,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:44,929 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157631926] [2020-04-18 11:45:44,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:44,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:44,929 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:44,931 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:44,938 INFO L259 McrAutomatonBuilder]: Finished intersection with 54 states and 84 transitions. [2020-04-18 11:45:44,938 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:44,948 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 11:45:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-04-18 11:45:44,949 INFO L87 Difference]: Start difference. First operand 125 states and 237 transitions. Second operand 5 states. [2020-04-18 11:45:44,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:44,998 INFO L93 Difference]: Finished difference Result 137 states and 249 transitions. [2020-04-18 11:45:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 249 transitions. [2020-04-18 11:45:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:44,999 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:44,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1843074133, now seen corresponding path program 4 times [2020-04-18 11:45:44,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:45,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664493271] [2020-04-18 11:45:45,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:45,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664493271] [2020-04-18 11:45:45,042 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322198556] [2020-04-18 11:45:45,042 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 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 [2020-04-18 11:45:45,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-04-18 11:45:45,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 11:45:45,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2020-04-18 11:45:45,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 11:45:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:45,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 11:45:45,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2020-04-18 11:45:45,189 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:45,191 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:45,199 INFO L259 McrAutomatonBuilder]: Finished intersection with 43 states and 58 transitions. [2020-04-18 11:45:45,199 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:45,267 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-04-18 11:45:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-04-18 11:45:45,268 INFO L87 Difference]: Start difference. First operand 137 states and 249 transitions. Second operand 12 states. [2020-04-18 11:45:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:45,424 INFO L93 Difference]: Finished difference Result 139 states and 250 transitions. [2020-04-18 11:45:45,424 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 250 transitions. [2020-04-18 11:45:45,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:45,425 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:45,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:45,425 INFO L82 PathProgramCache]: Analyzing trace with hash -745756711, now seen corresponding path program 5 times [2020-04-18 11:45:45,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:45,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262121271] [2020-04-18 11:45:45,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:45,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262121271] [2020-04-18 11:45:45,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:45,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:45,438 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:45,440 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:45,446 INFO L259 McrAutomatonBuilder]: Finished intersection with 32 states and 36 transitions. [2020-04-18 11:45:45,446 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:45,455 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:45,455 INFO L87 Difference]: Start difference. First operand 139 states and 250 transitions. Second operand 3 states. [2020-04-18 11:45:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:45,461 INFO L93 Difference]: Finished difference Result 149 states and 259 transitions. [2020-04-18 11:45:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 259 transitions. [2020-04-18 11:45:45,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:45,462 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [976815572] [2020-04-18 11:45:45,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:45,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 11:45:45,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [976815572] [2020-04-18 11:45:45,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:45:45,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:45,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-04-18 11:45:45,463 INFO L87 Difference]: Start difference. First operand 12973 states and 42382 transitions. Second operand 13 states. [2020-04-18 11:45:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:46,321 INFO L93 Difference]: Finished difference Result 32044 states and 103297 transitions. [2020-04-18 11:45:46,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:46,321 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 11:45:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:46,375 INFO L225 Difference]: With dead ends: 32044 [2020-04-18 11:45:46,375 INFO L226 Difference]: Without dead ends: 32018 [2020-04-18 11:45:46,375 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2020-04-18 11:45:46,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32018 states. [2020-04-18 11:45:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32018 to 12978. [2020-04-18 11:45:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12978 states. [2020-04-18 11:45:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12978 states to 12978 states and 42356 transitions. [2020-04-18 11:45:46,775 INFO L78 Accepts]: Start accepts. Automaton has 12978 states and 42356 transitions. Word has length 26 [2020-04-18 11:45:46,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:46,775 INFO L479 AbstractCegarLoop]: Abstraction has 12978 states and 42356 transitions. [2020-04-18 11:45:46,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:45:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12978 states and 42356 transitions. [2020-04-18 11:45:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:46,778 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:46,778 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:46,978 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 11:45:46,979 INFO L427 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]=== [2020-04-18 11:45:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1288861438, now seen corresponding path program 1 times [2020-04-18 11:45:46,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:46,980 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [852852681] [2020-04-18 11:45:46,981 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:46,984 INFO L259 McrAutomatonBuilder]: Finished intersection with 122 states and 252 transitions. [2020-04-18 11:45:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2020-04-18 11:45:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:46,985 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:46,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:46,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1408441618, now seen corresponding path program 2 times [2020-04-18 11:45:46,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:46,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555033121] [2020-04-18 11:45:46,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:46,995 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555033121] [2020-04-18 11:45:46,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:46,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:46,995 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:46,997 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:47,005 INFO L259 McrAutomatonBuilder]: Finished intersection with 64 states and 108 transitions. [2020-04-18 11:45:47,006 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:47,010 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:47,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:47,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:47,010 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2020-04-18 11:45:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:47,021 INFO L93 Difference]: Finished difference Result 141 states and 273 transitions. [2020-04-18 11:45:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 273 transitions. [2020-04-18 11:45:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:47,022 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1568530114, now seen corresponding path program 3 times [2020-04-18 11:45:47,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:47,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567829239] [2020-04-18 11:45:47,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-04-18 11:45:47,052 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567829239] [2020-04-18 11:45:47,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:47,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:47,053 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:47,055 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:47,064 INFO L259 McrAutomatonBuilder]: Finished intersection with 40 states and 53 transitions. [2020-04-18 11:45:47,065 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:47,069 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:47,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-04-18 11:45:47,070 INFO L87 Difference]: Start difference. First operand 141 states and 273 transitions. Second operand 3 states. [2020-04-18 11:45:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:47,075 INFO L93 Difference]: Finished difference Result 150 states and 282 transitions. [2020-04-18 11:45:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 282 transitions. [2020-04-18 11:45:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:47,075 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:47,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1288756468, now seen corresponding path program 4 times [2020-04-18 11:45:47,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:47,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894863519] [2020-04-18 11:45:47,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:47,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894863519] [2020-04-18 11:45:47,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:47,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:47,118 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:47,120 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:47,127 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 11:45:47,127 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:47,164 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:47,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:45:47,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-04-18 11:45:47,165 INFO L87 Difference]: Start difference. First operand 150 states and 282 transitions. Second operand 7 states. [2020-04-18 11:45:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:47,395 INFO L93 Difference]: Finished difference Result 177 states and 325 transitions. [2020-04-18 11:45:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 325 transitions. [2020-04-18 11:45:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:47,396 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1288861438, now seen corresponding path program 5 times [2020-04-18 11:45:47,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:47,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327102151] [2020-04-18 11:45:47,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:47,440 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327102151] [2020-04-18 11:45:47,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:47,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:45:47,440 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:47,442 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:47,446 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:47,447 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:47,469 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:47,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:45:47,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2020-04-18 11:45:47,470 INFO L87 Difference]: Start difference. First operand 177 states and 325 transitions. Second operand 7 states. [2020-04-18 11:45:47,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:47,587 INFO L93 Difference]: Finished difference Result 186 states and 335 transitions. [2020-04-18 11:45:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 335 transitions. [2020-04-18 11:45:47,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:47,588 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [852852681] [2020-04-18 11:45:47,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:47,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:45:47,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [852852681] [2020-04-18 11:45:47,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-04-18 11:45:47,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-04-18 11:45:47,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2020-04-18 11:45:47,590 INFO L87 Difference]: Start difference. First operand 12978 states and 42356 transitions. Second operand 10 states. [2020-04-18 11:45:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:48,410 INFO L93 Difference]: Finished difference Result 29955 states and 94830 transitions. [2020-04-18 11:45:48,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-04-18 11:45:48,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-04-18 11:45:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:48,462 INFO L225 Difference]: With dead ends: 29955 [2020-04-18 11:45:48,463 INFO L226 Difference]: Without dead ends: 29913 [2020-04-18 11:45:48,463 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=298, Invalid=1034, Unknown=0, NotChecked=0, Total=1332 [2020-04-18 11:45:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29913 states. [2020-04-18 11:45:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29913 to 13401. [2020-04-18 11:45:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13401 states. [2020-04-18 11:45:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13401 states to 13401 states and 43864 transitions. [2020-04-18 11:45:48,856 INFO L78 Accepts]: Start accepts. Automaton has 13401 states and 43864 transitions. Word has length 26 [2020-04-18 11:45:48,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:48,856 INFO L479 AbstractCegarLoop]: Abstraction has 13401 states and 43864 transitions. [2020-04-18 11:45:48,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-04-18 11:45:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 13401 states and 43864 transitions. [2020-04-18 11:45:48,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:48,859 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:48,859 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:48,860 INFO L427 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]=== [2020-04-18 11:45:48,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1288773863, now seen corresponding path program 1 times [2020-04-18 11:45:48,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:48,860 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [418022404] [2020-04-18 11:45:48,861 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:48,865 INFO L259 McrAutomatonBuilder]: Finished intersection with 146 states and 312 transitions. [2020-04-18 11:45:48,866 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2020-04-18 11:45:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:48,866 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1737100349, now seen corresponding path program 2 times [2020-04-18 11:45:48,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:48,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654189839] [2020-04-18 11:45:48,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:48,879 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654189839] [2020-04-18 11:45:48,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:48,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:48,879 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:48,882 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:48,895 INFO L259 McrAutomatonBuilder]: Finished intersection with 109 states and 215 transitions. [2020-04-18 11:45:48,895 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:48,899 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:48,900 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 3 states. [2020-04-18 11:45:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:48,908 INFO L93 Difference]: Finished difference Result 169 states and 337 transitions. [2020-04-18 11:45:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 337 transitions. [2020-04-18 11:45:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:48,909 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:48,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1592158591, now seen corresponding path program 3 times [2020-04-18 11:45:48,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:48,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243167911] [2020-04-18 11:45:48,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:48,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243167911] [2020-04-18 11:45:48,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:48,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:48,924 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:48,927 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:48,939 INFO L259 McrAutomatonBuilder]: Finished intersection with 79 states and 130 transitions. [2020-04-18 11:45:48,939 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:48,968 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 11:45:48,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:45:48,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:45:48,968 INFO L87 Difference]: Start difference. First operand 169 states and 337 transitions. Second operand 6 states. [2020-04-18 11:45:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:49,036 INFO L93 Difference]: Finished difference Result 175 states and 344 transitions. [2020-04-18 11:45:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 344 transitions. [2020-04-18 11:45:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:49,036 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1288638323, now seen corresponding path program 4 times [2020-04-18 11:45:49,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:49,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799267545] [2020-04-18 11:45:49,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:49,071 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799267545] [2020-04-18 11:45:49,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:49,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-04-18 11:45:49,071 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:49,074 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:49,080 INFO L259 McrAutomatonBuilder]: Finished intersection with 30 states and 32 transitions. [2020-04-18 11:45:49,080 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:49,125 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 11:45:49,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:45:49,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:45:49,126 INFO L87 Difference]: Start difference. First operand 175 states and 344 transitions. Second operand 7 states. [2020-04-18 11:45:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:49,361 INFO L93 Difference]: Finished difference Result 202 states and 387 transitions. [2020-04-18 11:45:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 387 transitions. [2020-04-18 11:45:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:49,362 INFO L105 Mcr]: ---- MCR iteration 3 ---- [2020-04-18 11:45:49,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:49,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1288773863, now seen corresponding path program 5 times [2020-04-18 11:45:49,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:49,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074862073] [2020-04-18 11:45:49,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:49,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074862073] [2020-04-18 11:45:49,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:49,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:45:49,406 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:49,408 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:49,413 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:49,413 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:49,435 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:49,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:45:49,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2020-04-18 11:45:49,436 INFO L87 Difference]: Start difference. First operand 202 states and 387 transitions. Second operand 7 states. [2020-04-18 11:45:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:49,558 INFO L93 Difference]: Finished difference Result 211 states and 397 transitions. [2020-04-18 11:45:49,558 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 397 transitions. [2020-04-18 11:45:49,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:49,559 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [418022404] [2020-04-18 11:45:49,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:49,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:45:49,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [418022404] [2020-04-18 11:45:49,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-04-18 11:45:49,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:49,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 11:45:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2020-04-18 11:45:49,560 INFO L87 Difference]: Start difference. First operand 13401 states and 43864 transitions. Second operand 13 states. [2020-04-18 11:45:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:51,252 INFO L93 Difference]: Finished difference Result 42747 states and 130428 transitions. [2020-04-18 11:45:51,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:45:51,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2020-04-18 11:45:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:51,323 INFO L225 Difference]: With dead ends: 42747 [2020-04-18 11:45:51,324 INFO L226 Difference]: Without dead ends: 42705 [2020-04-18 11:45:51,324 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=769, Invalid=3137, Unknown=0, NotChecked=0, Total=3906 [2020-04-18 11:45:51,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42705 states. [2020-04-18 11:45:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42705 to 13528. [2020-04-18 11:45:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13528 states. [2020-04-18 11:45:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13528 states to 13528 states and 44268 transitions. [2020-04-18 11:45:51,806 INFO L78 Accepts]: Start accepts. Automaton has 13528 states and 44268 transitions. Word has length 26 [2020-04-18 11:45:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:51,807 INFO L479 AbstractCegarLoop]: Abstraction has 13528 states and 44268 transitions. [2020-04-18 11:45:51,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-04-18 11:45:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 13528 states and 44268 transitions. [2020-04-18 11:45:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:51,810 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:51,810 INFO L425 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:51,810 INFO L427 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]=== [2020-04-18 11:45:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:51,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1288707709, now seen corresponding path program 1 times [2020-04-18 11:45:51,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:51,811 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [782148685] [2020-04-18 11:45:51,812 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:51,815 INFO L259 McrAutomatonBuilder]: Finished intersection with 98 states and 192 transitions. [2020-04-18 11:45:51,815 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-04-18 11:45:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:51,816 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:51,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:51,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1544841135, now seen corresponding path program 2 times [2020-04-18 11:45:51,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:51,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073924119] [2020-04-18 11:45:51,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:51,844 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073924119] [2020-04-18 11:45:51,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:51,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 11:45:51,845 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:51,847 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:51,858 INFO L259 McrAutomatonBuilder]: Finished intersection with 69 states and 119 transitions. [2020-04-18 11:45:51,858 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:51,863 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 1 times. [2020-04-18 11:45:51,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 11:45:51,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 11:45:51,864 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2020-04-18 11:45:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:51,871 INFO L93 Difference]: Finished difference Result 113 states and 209 transitions. [2020-04-18 11:45:51,871 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 209 transitions. [2020-04-18 11:45:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:51,871 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 11:45:51,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:51,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2135267669, now seen corresponding path program 3 times [2020-04-18 11:45:51,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:51,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456982158] [2020-04-18 11:45:51,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-04-18 11:45:51,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456982158] [2020-04-18 11:45:51,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:51,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 11:45:51,889 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:51,891 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:51,900 INFO L259 McrAutomatonBuilder]: Finished intersection with 47 states and 66 transitions. [2020-04-18 11:45:51,900 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:51,923 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 11:45:51,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 11:45:51,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-04-18 11:45:51,923 INFO L87 Difference]: Start difference. First operand 113 states and 209 transitions. Second operand 6 states. [2020-04-18 11:45:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:51,994 INFO L93 Difference]: Finished difference Result 119 states and 216 transitions. [2020-04-18 11:45:51,995 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 216 transitions. [2020-04-18 11:45:51,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:51,995 INFO L105 Mcr]: ---- MCR iteration 2 ---- [2020-04-18 11:45:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:51,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1288707709, now seen corresponding path program 4 times [2020-04-18 11:45:51,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:51,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728830427] [2020-04-18 11:45:51,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 11:45:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-04-18 11:45:52,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728830427] [2020-04-18 11:45:52,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 11:45:52,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-04-18 11:45:52,034 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 11:45:52,035 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:52,041 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:52,041 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 11:45:52,076 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 11:45:52,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 11:45:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-04-18 11:45:52,076 INFO L87 Difference]: Start difference. First operand 119 states and 216 transitions. Second operand 7 states. [2020-04-18 11:45:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:52,201 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2020-04-18 11:45:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 225 transitions. [2020-04-18 11:45:52,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 11:45:52,201 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [782148685] [2020-04-18 11:45:52,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 11:45:52,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 11:45:52,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [782148685] [2020-04-18 11:45:52,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-04-18 11:45:52,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 11:45:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-04-18 11:45:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2020-04-18 11:45:52,203 INFO L87 Difference]: Start difference. First operand 13528 states and 44268 transitions. Second operand 11 states. [2020-04-18 11:45:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 11:45:53,748 INFO L93 Difference]: Finished difference Result 47550 states and 148131 transitions. [2020-04-18 11:45:53,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2020-04-18 11:45:53,753 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2020-04-18 11:45:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 11:45:53,840 INFO L225 Difference]: With dead ends: 47550 [2020-04-18 11:45:53,840 INFO L226 Difference]: Without dead ends: 47530 [2020-04-18 11:45:53,841 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=623, Invalid=2133, Unknown=0, NotChecked=0, Total=2756 [2020-04-18 11:45:54,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47530 states. [2020-04-18 11:45:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47530 to 13332. [2020-04-18 11:45:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13332 states. [2020-04-18 11:45:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13332 states to 13332 states and 43406 transitions. [2020-04-18 11:45:54,503 INFO L78 Accepts]: Start accepts. Automaton has 13332 states and 43406 transitions. Word has length 26 [2020-04-18 11:45:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 11:45:54,504 INFO L479 AbstractCegarLoop]: Abstraction has 13332 states and 43406 transitions. [2020-04-18 11:45:54,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-04-18 11:45:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13332 states and 43406 transitions. [2020-04-18 11:45:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:54,506 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 11:45:54,507 INFO L425 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 11:45:54,507 INFO L427 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]=== [2020-04-18 11:45:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1151627457, now seen corresponding path program 1 times [2020-04-18 11:45:54,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 11:45:54,507 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [515709663] [2020-04-18 11:45:54,508 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 11:45:54,509 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 11:45:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-04-18 11:45:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 11:45:54,509 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 11:45:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 11:45:54,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1151627457, now seen corresponding path program 2 times [2020-04-18 11:45:54,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 11:45:54,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496955461] [2020-04-18 11:45:54,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 11:45:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:45:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-04-18 11:45:54,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-04-18 11:45:54,530 INFO L174 FreeRefinementEngine]: Strategy MCR found a feasible trace [2020-04-18 11:45:54,530 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-04-18 11:45:54,530 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-04-18 11:45:54,530 WARN L363 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2020-04-18 11:45:54,531 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2020-04-18 11:45:54,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,554 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,554 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,554 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,554 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,554 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,554 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,554 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,562 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,563 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,564 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,565 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,566 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,567 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,568 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,568 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,568 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,568 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,568 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,568 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,568 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,570 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,572 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,573 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,574 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,575 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,576 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,576 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,576 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,576 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,576 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,576 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,577 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,577 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,577 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,577 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,577 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,577 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,578 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,578 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,579 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,579 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,579 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,580 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,582 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,582 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,582 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,582 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,583 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,583 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,583 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,583 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,584 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,584 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,584 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,584 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,584 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,584 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,585 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,585 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,585 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,585 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,586 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,586 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,587 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,587 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,587 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,587 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,588 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,588 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,588 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,588 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,588 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,588 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,589 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,589 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,589 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,590 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,590 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,590 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,591 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,591 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,592 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,592 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,592 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,592 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,593 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,593 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,593 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,594 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,594 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,594 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,595 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,595 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,596 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,596 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,596 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,596 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,596 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,596 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,597 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,597 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,598 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,598 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,598 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,598 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,599 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,599 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,599 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,599 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 11:45:54,600 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-04-18 11:45:54,600 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 11:45:54,601 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 11:45:54,601 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 11:45:54,601 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 11:45:54,601 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 11:45:54,601 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 11:45:54,601 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 11:45:54,601 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 11:45:54,603 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 221 transitions, 562 flow [2020-04-18 11:45:54,603 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 227 places, 221 transitions, 562 flow [2020-04-18 11:45:54,638 INFO L129 PetriNetUnfolder]: 21/256 cut-off events. [2020-04-18 11:45:54,638 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-04-18 11:45:54,641 INFO L80 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 256 events. 21/256 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 641 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 291. Up to 14 conditions per place. [2020-04-18 11:45:54,652 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 227 places, 221 transitions, 562 flow [2020-04-18 11:45:54,691 INFO L129 PetriNetUnfolder]: 21/256 cut-off events. [2020-04-18 11:45:54,691 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2020-04-18 11:45:54,696 INFO L80 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 256 events. 21/256 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 641 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 291. Up to 14 conditions per place. [2020-04-18 11:45:54,712 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16092 [2020-04-18 11:45:54,713 INFO L170 etLargeBlockEncoding]: Semantic Check. Received shutdown request... [2020-04-18 11:45:54,913 WARN L209 SmtUtils]: Removed 1 from assertion stack [2020-04-18 11:45:54,913 WARN L544 AbstractCegarLoop]: Verification canceled [2020-04-18 11:45:54,918 WARN L228 ceAbstractionStarter]: Timeout [2020-04-18 11:45:54,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.04 11:45:54 BasicIcfg [2020-04-18 11:45:54,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-04-18 11:45:54,921 INFO L168 Benchmark]: Toolchain (without parser) took 216259.64 ms. Allocated memory was 137.9 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 100.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 798.2 MB. Max. memory is 7.1 GB. [2020-04-18 11:45:54,922 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-04-18 11:45:54,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.88 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 98.5 MB in the beginning and 160.2 MB in the end (delta: -61.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2020-04-18 11:45:54,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.55 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-04-18 11:45:54,923 INFO L168 Benchmark]: Boogie Preprocessor took 36.04 ms. Allocated memory is still 202.9 MB. Free memory was 158.1 MB in the beginning and 156.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-04-18 11:45:54,924 INFO L168 Benchmark]: RCFGBuilder took 507.10 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 132.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-04-18 11:45:54,924 INFO L168 Benchmark]: TraceAbstraction took 214871.19 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 132.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 765.3 MB. Max. memory is 7.1 GB. [2020-04-18 11:45:54,927 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.88 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 98.5 MB in the beginning and 160.2 MB in the end (delta: -61.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.55 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.04 ms. Allocated memory is still 202.9 MB. Free memory was 158.1 MB in the beginning and 156.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 507.10 ms. Allocated memory is still 202.9 MB. Free memory was 156.0 MB in the beginning and 132.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 214871.19 ms. Allocated memory was 202.9 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 132.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 765.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 77 ProgramPointsBefore, 18 ProgramPointsAfterwards, 76 TransitionsBefore, 12 TransitionsAfterwards, 1242 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 13 ConcurrentYvCompositions, 5 ChoiceCompositions, 716 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 5 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1089 CheckedPairsTotal, 77 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 107 ProgramPointsBefore, 36 ProgramPointsAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 2844 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 11 ConcurrentYvCompositions, 6 ChoiceCompositions, 1586 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 3583 CheckedPairsTotal, 94 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 137 ProgramPointsBefore, 49 ProgramPointsAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 5130 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 15 ConcurrentYvCompositions, 8 ChoiceCompositions, 2814 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.3s, 0 MoverChecksTotal, 7545 CheckedPairsTotal, 120 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 167 ProgramPointsBefore, 59 ProgramPointsAfterwards, 163 TransitionsBefore, 48 TransitionsAfterwards, 8100 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 23 ConcurrentYvCompositions, 7 ChoiceCompositions, 4306 VarBasedMoverChecksPositive, 105 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 10326 CheckedPairsTotal, 154 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 197 ProgramPointsBefore, 73 ProgramPointsAfterwards, 192 TransitionsBefore, 57 TransitionsAfterwards, 11754 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 27 ConcurrentYvCompositions, 11 ChoiceCompositions, 6349 VarBasedMoverChecksPositive, 111 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 73 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 17154 CheckedPairsTotal, 177 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 678]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 678). Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNetLargeBlockEncoding was applying PetriNetLargeBlockEncoding to Petri net that has 227 places, 221 transitions, 562 flow and 16092 co-enabled transitions pairs.,while SimplifyDDAWithTimeout was simplifying term of DAG size 8 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 71 locations, 1 error locations. Started 6 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 214.4s, OverallIterations: 46, TraceHistogramMax: 6, AutomataDifference: 89.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 47.3s, HoareTripleCheckerStatistics: 1960 SDtfs, 18687 SDslu, 11385 SDs, 0 SdLazy, 22333 SolverSat, 5387 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5520 GetRequests, 3831 SyntacticMatches, 5 SemanticMatches, 1684 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117898 ImplicationChecksByTransitivity, 39.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127498occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.3s AutomataMinimizationTime, 41 MinimizatonAttempts, 656784 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown