/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.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:17:12,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:17:12,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:17:12,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:17:12,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:17:12,460 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:17:12,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:17:12,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:17:12,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:17:12,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:17:12,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:17:12,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:17:12,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:17:12,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:17:12,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:17:12,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:17:12,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:17:12,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:17:12,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:17:12,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:17:12,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:17:12,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:17:12,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:17:12,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:17:12,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:17:12,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:17:12,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:17:12,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:17:12,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:17:12,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:17:12,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:17:12,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:17:12,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:17:12,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:17:12,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:17:12,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:17:12,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:17:12,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:17:12,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:17:12,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:17:12,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:17:12,501 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.epf [2019-12-27 04:17:12,525 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:17:12,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:17:12,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:17:12,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:17:12,527 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:17:12,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:17:12,528 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:17:12,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:17:12,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:17:12,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:17:12,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:17:12,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:17:12,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:17:12,529 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:17:12,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:17:12,529 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:17:12,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:17:12,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:17:12,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:17:12,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:17:12,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:17:12,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:17:12,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:17:12,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:17:12,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:17:12,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:17:12,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:17:12,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:17:12,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:17:12,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:17:12,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:17:12,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:17:12,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:17:12,807 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:17:12,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-27 04:17:12,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eef87b71/d516f0a5f4274a019365c096f9420905/FLAG9ffecd1ae [2019-12-27 04:17:13,377 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:17:13,378 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013_variant-1.i [2019-12-27 04:17:13,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eef87b71/d516f0a5f4274a019365c096f9420905/FLAG9ffecd1ae [2019-12-27 04:17:13,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eef87b71/d516f0a5f4274a019365c096f9420905 [2019-12-27 04:17:13,706 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:17:13,708 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:17:13,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:17:13,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:17:13,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:17:13,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:17:13" (1/1) ... [2019-12-27 04:17:13,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5131fd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:13, skipping insertion in model container [2019-12-27 04:17:13,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:17:13" (1/1) ... [2019-12-27 04:17:13,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:17:13,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:17:14,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:17:14,287 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:17:14,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:17:14,438 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:17:14,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14 WrapperNode [2019-12-27 04:17:14,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:17:14,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:17:14,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:17:14,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:17:14,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:17:14,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:17:14,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:17:14,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:17:14,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... [2019-12-27 04:17:14,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:17:14,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:17:14,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:17:14,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:17:14,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:17:14,587 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 04:17:14,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 04:17:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 04:17:14,588 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 04:17:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:17:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:17:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:17:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:17:14,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:17:14,592 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:17:14,924 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:17:14,924 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 04:17:14,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:17:14 BoogieIcfgContainer [2019-12-27 04:17:14,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:17:14,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:17:14,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:17:14,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:17:14,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:17:13" (1/3) ... [2019-12-27 04:17:14,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1df8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:17:14, skipping insertion in model container [2019-12-27 04:17:14,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:17:14" (2/3) ... [2019-12-27 04:17:14,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f1df8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:17:14, skipping insertion in model container [2019-12-27 04:17:14,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:17:14" (3/3) ... [2019-12-27 04:17:14,935 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013_variant-1.i [2019-12-27 04:17:14,944 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:17:14,944 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:17:14,951 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 04:17:14,952 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:17:14,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,982 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,993 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,993 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,993 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,994 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:14,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:15,001 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:15,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:15,001 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:15,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:15,002 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:15,002 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:15,023 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 04:17:15,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:17:15,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:17:15,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:17:15,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:17:15,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:17:15,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:17:15,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:17:15,044 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:17:15,058 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 56 transitions [2019-12-27 04:17:15,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-27 04:17:15,112 INFO L132 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-27 04:17:15,112 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:17:15,119 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 0/60 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 04:17:15,123 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 60 places, 56 transitions [2019-12-27 04:17:15,148 INFO L132 PetriNetUnfolder]: 3/66 cut-off events. [2019-12-27 04:17:15,148 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:17:15,149 INFO L76 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 66 events. 3/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs. 0/60 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 04:17:15,152 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-27 04:17:15,153 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:17:16,544 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-12-27 04:17:16,796 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-12-27 04:17:16,877 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-27 04:17:16,878 INFO L214 etLargeBlockEncoding]: Total number of compositions: 47 [2019-12-27 04:17:16,882 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 04:17:16,892 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 04:17:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 04:17:16,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:17:16,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:16,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:17:16,903 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 219913, now seen corresponding path program 1 times [2019-12-27 04:17:16,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:16,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623430553] [2019-12-27 04:17:16,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:17,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623430553] [2019-12-27 04:17:17,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:17,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:17:17,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485784488] [2019-12-27 04:17:17,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:17:17,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:17,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:17:17,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:17,131 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 04:17:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:17,172 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 04:17:17,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:17:17,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:17:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:17,185 INFO L225 Difference]: With dead ends: 35 [2019-12-27 04:17:17,185 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 04:17:17,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 04:17:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 04:17:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 04:17:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 04:17:17,238 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 04:17:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:17,238 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 04:17:17,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:17:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 04:17:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:17:17,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:17,239 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:17,240 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1212750904, now seen corresponding path program 1 times [2019-12-27 04:17:17,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:17,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976850214] [2019-12-27 04:17:17,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:17,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976850214] [2019-12-27 04:17:17,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:17,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:17:17,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499523939] [2019-12-27 04:17:17,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:17:17,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:17:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:17:17,362 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 04:17:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:17,388 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 04:17:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:17:17,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 04:17:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:17,390 INFO L225 Difference]: With dead ends: 26 [2019-12-27 04:17:17,391 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 04:17:17,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:17:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 04:17:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 04:17:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 04:17:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 04:17:17,396 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 04:17:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:17,397 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 04:17:17,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:17:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 04:17:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:17:17,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:17,397 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:17,398 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1059432955, now seen corresponding path program 1 times [2019-12-27 04:17:17,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:17,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225215890] [2019-12-27 04:17:17,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:17:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:17:17,483 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:17:17,483 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:17:17,484 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:17:17,484 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 04:17:17,492 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,492 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,493 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,494 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,494 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,494 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,494 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,494 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,494 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,495 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,495 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,495 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,495 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,495 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,496 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,496 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,496 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,496 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,497 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,497 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,497 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,497 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,497 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,498 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,498 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,498 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,498 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,499 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,499 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,499 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,500 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,500 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,500 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,500 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,500 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,501 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,501 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,502 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,503 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,503 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,503 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,504 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,504 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,505 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,505 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,506 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,506 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,506 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,507 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,507 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,508 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,508 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,508 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:17,509 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 04:17:17,510 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:17:17,510 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:17:17,510 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:17:17,510 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:17:17,510 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:17:17,510 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:17:17,511 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:17:17,511 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:17:17,513 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 74 transitions [2019-12-27 04:17:17,513 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-27 04:17:17,535 INFO L132 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-27 04:17:17,535 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 04:17:17,537 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 0/80 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-27 04:17:17,540 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 81 places, 74 transitions [2019-12-27 04:17:17,558 INFO L132 PetriNetUnfolder]: 4/88 cut-off events. [2019-12-27 04:17:17,559 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 04:17:17,560 INFO L76 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 88 events. 4/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs. 0/80 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2019-12-27 04:17:17,563 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-27 04:17:17,563 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:17:19,075 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-27 04:17:19,144 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1223 [2019-12-27 04:17:19,144 INFO L214 etLargeBlockEncoding]: Total number of compositions: 61 [2019-12-27 04:17:19,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 04:17:19,157 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 04:17:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 04:17:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:17:19,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:19,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:17:19,158 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:19,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash 374327, now seen corresponding path program 1 times [2019-12-27 04:17:19,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:19,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738920667] [2019-12-27 04:17:19,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:19,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:19,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738920667] [2019-12-27 04:17:19,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:19,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:17:19,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271729201] [2019-12-27 04:17:19,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:17:19,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:17:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:19,202 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 04:17:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:19,234 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 04:17:19,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:17:19,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:17:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:19,239 INFO L225 Difference]: With dead ends: 185 [2019-12-27 04:17:19,239 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 04:17:19,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:19,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 04:17:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 04:17:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 04:17:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 04:17:19,265 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 04:17:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:19,265 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 04:17:19,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:17:19,265 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 04:17:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:17:19,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:19,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:19,267 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:19,267 INFO L82 PathProgramCache]: Analyzing trace with hash -857862729, now seen corresponding path program 1 times [2019-12-27 04:17:19,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:19,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904503808] [2019-12-27 04:17:19,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:19,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904503808] [2019-12-27 04:17:19,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:19,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:19,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838205008] [2019-12-27 04:17:19,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:19,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:19,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:19,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:19,324 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 04:17:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:19,416 INFO L93 Difference]: Finished difference Result 224 states and 491 transitions. [2019-12-27 04:17:19,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:19,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:17:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:19,423 INFO L225 Difference]: With dead ends: 224 [2019-12-27 04:17:19,423 INFO L226 Difference]: Without dead ends: 221 [2019-12-27 04:17:19,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:19,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-27 04:17:19,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2019-12-27 04:17:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 04:17:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 04:17:19,444 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 04:17:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:19,444 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 04:17:19,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 04:17:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:17:19,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:19,446 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:19,446 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:19,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:19,447 INFO L82 PathProgramCache]: Analyzing trace with hash -924776041, now seen corresponding path program 1 times [2019-12-27 04:17:19,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:19,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478468634] [2019-12-27 04:17:19,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:17:19,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478468634] [2019-12-27 04:17:19,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:19,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:19,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172841574] [2019-12-27 04:17:19,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:19,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:19,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:19,528 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 04:17:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:19,622 INFO L93 Difference]: Finished difference Result 213 states and 458 transitions. [2019-12-27 04:17:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:19,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:17:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:19,624 INFO L225 Difference]: With dead ends: 213 [2019-12-27 04:17:19,625 INFO L226 Difference]: Without dead ends: 209 [2019-12-27 04:17:19,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-27 04:17:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 153. [2019-12-27 04:17:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 04:17:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 04:17:19,639 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 04:17:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:19,640 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 04:17:19,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 04:17:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:17:19,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:19,641 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:19,642 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:19,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:19,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1393798314, now seen corresponding path program 1 times [2019-12-27 04:17:19,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:19,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519590130] [2019-12-27 04:17:19,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:17:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:17:19,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:17:19,675 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:17:19,675 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:17:19,676 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 04:17:19,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,685 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,685 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,686 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,686 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,687 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,687 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,687 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,688 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,688 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,689 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,689 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,690 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,690 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,690 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,690 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,691 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,691 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,691 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,691 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,691 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,691 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,691 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,692 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,692 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,692 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,693 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,693 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,694 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,694 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,695 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,696 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,696 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:19,717 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:17:19,717 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:17:19,717 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:17:19,717 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:17:19,717 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:17:19,717 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:17:19,718 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:17:19,718 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:17:19,718 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:17:19,720 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 92 transitions [2019-12-27 04:17:19,720 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-27 04:17:19,741 INFO L132 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-27 04:17:19,741 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 04:17:19,743 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-27 04:17:19,747 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 102 places, 92 transitions [2019-12-27 04:17:19,766 INFO L132 PetriNetUnfolder]: 5/110 cut-off events. [2019-12-27 04:17:19,766 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 04:17:19,768 INFO L76 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 110 events. 5/110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 188 event pairs. 0/100 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2019-12-27 04:17:19,773 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-27 04:17:19,774 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:17:21,181 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-12-27 04:17:21,447 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-27 04:17:21,572 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1840 [2019-12-27 04:17:21,573 INFO L214 etLargeBlockEncoding]: Total number of compositions: 80 [2019-12-27 04:17:21,573 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 04:17:21,595 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 04:17:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 04:17:21,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:17:21,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:21,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:17:21,596 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 564387, now seen corresponding path program 1 times [2019-12-27 04:17:21,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:21,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695635291] [2019-12-27 04:17:21,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:21,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695635291] [2019-12-27 04:17:21,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:21,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:17:21,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103578684] [2019-12-27 04:17:21,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:17:21,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:17:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:21,628 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 04:17:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:21,662 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 04:17:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:17:21,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:17:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:21,671 INFO L225 Difference]: With dead ends: 600 [2019-12-27 04:17:21,671 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 04:17:21,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 04:17:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 04:17:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 04:17:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 04:17:21,711 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 04:17:21,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:21,711 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 04:17:21,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:17:21,711 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 04:17:21,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:17:21,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:21,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:21,712 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2099227938, now seen corresponding path program 1 times [2019-12-27 04:17:21,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:21,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862559458] [2019-12-27 04:17:21,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:21,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862559458] [2019-12-27 04:17:21,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:21,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:21,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496393956] [2019-12-27 04:17:21,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:21,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:21,779 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 04:17:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:21,895 INFO L93 Difference]: Finished difference Result 918 states and 2567 transitions. [2019-12-27 04:17:21,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:21,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:17:21,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:21,902 INFO L225 Difference]: With dead ends: 918 [2019-12-27 04:17:21,902 INFO L226 Difference]: Without dead ends: 915 [2019-12-27 04:17:21,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:21,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-27 04:17:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 576. [2019-12-27 04:17:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 04:17:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 04:17:21,930 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 04:17:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:21,930 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 04:17:21,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:21,930 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 04:17:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:17:21,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:21,932 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:21,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1126341274, now seen corresponding path program 1 times [2019-12-27 04:17:21,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:21,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622687891] [2019-12-27 04:17:21,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:21,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:17:21,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622687891] [2019-12-27 04:17:21,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:21,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:21,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492423203] [2019-12-27 04:17:21,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:21,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:21,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:21,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:21,981 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 04:17:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:22,078 INFO L93 Difference]: Finished difference Result 952 states and 2666 transitions. [2019-12-27 04:17:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:22,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:17:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:22,085 INFO L225 Difference]: With dead ends: 952 [2019-12-27 04:17:22,085 INFO L226 Difference]: Without dead ends: 948 [2019-12-27 04:17:22,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-27 04:17:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 605. [2019-12-27 04:17:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 04:17:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 04:17:22,120 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 04:17:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:22,121 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 04:17:22,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 04:17:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:22,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:22,126 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:22,126 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:22,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:22,126 INFO L82 PathProgramCache]: Analyzing trace with hash -821622243, now seen corresponding path program 1 times [2019-12-27 04:17:22,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:22,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11923045] [2019-12-27 04:17:22,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:22,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11923045] [2019-12-27 04:17:22,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578365683] [2019-12-27 04:17:22,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:22,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:22,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:22,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:22,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:22,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116729649] [2019-12-27 04:17:22,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:22,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:22,509 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 18 states. [2019-12-27 04:17:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:23,489 INFO L93 Difference]: Finished difference Result 1315 states and 3284 transitions. [2019-12-27 04:17:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:17:23,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:23,502 INFO L225 Difference]: With dead ends: 1315 [2019-12-27 04:17:23,502 INFO L226 Difference]: Without dead ends: 1310 [2019-12-27 04:17:23,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 04:17:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2019-12-27 04:17:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 591. [2019-12-27 04:17:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-12-27 04:17:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1849 transitions. [2019-12-27 04:17:23,530 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1849 transitions. Word has length 15 [2019-12-27 04:17:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:23,530 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 1849 transitions. [2019-12-27 04:17:23,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1849 transitions. [2019-12-27 04:17:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:23,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:23,531 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:23,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:23,737 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:23,737 INFO L82 PathProgramCache]: Analyzing trace with hash 82199709, now seen corresponding path program 2 times [2019-12-27 04:17:23,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:23,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907139976] [2019-12-27 04:17:23,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:23,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907139976] [2019-12-27 04:17:23,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2315183] [2019-12-27 04:17:23,852 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:23,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:17:23,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:23,923 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:23,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:24,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:24,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:24,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673222946] [2019-12-27 04:17:24,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:24,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:24,030 INFO L87 Difference]: Start difference. First operand 591 states and 1849 transitions. Second operand 18 states. [2019-12-27 04:17:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:24,910 INFO L93 Difference]: Finished difference Result 1803 states and 4638 transitions. [2019-12-27 04:17:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:17:24,913 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:24,924 INFO L225 Difference]: With dead ends: 1803 [2019-12-27 04:17:24,924 INFO L226 Difference]: Without dead ends: 1798 [2019-12-27 04:17:24,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:17:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2019-12-27 04:17:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 540. [2019-12-27 04:17:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-12-27 04:17:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 1700 transitions. [2019-12-27 04:17:24,954 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 1700 transitions. Word has length 15 [2019-12-27 04:17:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:24,955 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 1700 transitions. [2019-12-27 04:17:24,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 1700 transitions. [2019-12-27 04:17:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:17:24,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:24,956 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:25,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:25,160 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1885947986, now seen corresponding path program 1 times [2019-12-27 04:17:25,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:25,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490240379] [2019-12-27 04:17:25,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:17:25,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490240379] [2019-12-27 04:17:25,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:25,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:25,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322234660] [2019-12-27 04:17:25,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:25,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:25,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:25,220 INFO L87 Difference]: Start difference. First operand 540 states and 1700 transitions. Second operand 5 states. [2019-12-27 04:17:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:25,325 INFO L93 Difference]: Finished difference Result 864 states and 2410 transitions. [2019-12-27 04:17:25,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:25,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 04:17:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:25,332 INFO L225 Difference]: With dead ends: 864 [2019-12-27 04:17:25,332 INFO L226 Difference]: Without dead ends: 856 [2019-12-27 04:17:25,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-12-27 04:17:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 549. [2019-12-27 04:17:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 04:17:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1686 transitions. [2019-12-27 04:17:25,353 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1686 transitions. Word has length 17 [2019-12-27 04:17:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:25,353 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1686 transitions. [2019-12-27 04:17:25,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1686 transitions. [2019-12-27 04:17:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:17:25,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:25,354 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:25,355 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:17:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1661426381, now seen corresponding path program 1 times [2019-12-27 04:17:25,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:25,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802151062] [2019-12-27 04:17:25,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:17:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:17:25,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:17:25,385 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:17:25,385 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:17:25,385 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 04:17:25,400 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,401 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,401 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,401 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,401 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,402 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,402 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,402 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,402 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,402 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,403 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,403 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,404 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,404 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,404 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,404 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,404 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,405 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,405 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,405 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,405 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,405 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,406 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,422 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,422 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,423 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,423 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,423 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,423 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,423 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,423 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,424 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,426 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,432 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,433 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,433 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,434 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,437 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,437 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,438 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,438 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,439 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,439 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,439 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,439 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,440 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,441 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,441 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,441 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,442 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,442 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,443 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,443 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,443 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,443 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,444 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,446 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,446 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,446 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,446 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,447 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,450 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,450 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,452 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,452 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,452 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,452 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,453 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,453 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,454 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,454 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,454 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,456 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,457 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,457 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,458 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,459 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,459 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,459 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,459 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,460 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:17:25,465 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 04:17:25,466 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:17:25,466 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:17:25,466 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:17:25,466 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:17:25,466 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:17:25,466 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:17:25,466 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:17:25,466 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:17:25,468 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 110 transitions [2019-12-27 04:17:25,468 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-27 04:17:25,513 INFO L132 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-27 04:17:25,514 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 04:17:25,519 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 0/120 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-27 04:17:25,525 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 123 places, 110 transitions [2019-12-27 04:17:25,556 INFO L132 PetriNetUnfolder]: 6/132 cut-off events. [2019-12-27 04:17:25,557 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 04:17:25,559 INFO L76 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 132 events. 6/132 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 235 event pairs. 0/120 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2019-12-27 04:17:25,564 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-27 04:17:25,565 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:17:27,077 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 04:17:27,478 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2220 [2019-12-27 04:17:27,478 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 04:17:27,478 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 04:17:27,589 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 04:17:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 04:17:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:17:27,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:27,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:17:27,590 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash 792177, now seen corresponding path program 1 times [2019-12-27 04:17:27,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:27,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797838890] [2019-12-27 04:17:27,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:27,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797838890] [2019-12-27 04:17:27,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:27,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:17:27,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892114943] [2019-12-27 04:17:27,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:17:27,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:27,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:17:27,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:27,613 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 04:17:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:27,657 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 04:17:27,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:17:27,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:17:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:27,672 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 04:17:27,672 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 04:17:27,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:17:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 04:17:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 04:17:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 04:17:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 04:17:27,730 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 04:17:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:27,730 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 04:17:27,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:17:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 04:17:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:17:27,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:27,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:27,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash -982045597, now seen corresponding path program 1 times [2019-12-27 04:17:27,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:27,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861041929] [2019-12-27 04:17:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:27,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:27,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861041929] [2019-12-27 04:17:27,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:27,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:27,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196662635] [2019-12-27 04:17:27,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:27,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:27,768 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 04:17:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:27,870 INFO L93 Difference]: Finished difference Result 3302 states and 11435 transitions. [2019-12-27 04:17:27,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:27,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:17:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:27,894 INFO L225 Difference]: With dead ends: 3302 [2019-12-27 04:17:27,894 INFO L226 Difference]: Without dead ends: 3299 [2019-12-27 04:17:27,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2019-12-27 04:17:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 1914. [2019-12-27 04:17:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 04:17:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 04:17:27,976 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 04:17:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:27,977 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 04:17:27,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 04:17:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:17:27,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:27,978 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:27,978 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1476250518, now seen corresponding path program 1 times [2019-12-27 04:17:27,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:27,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508002902] [2019-12-27 04:17:27,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:17:28,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508002902] [2019-12-27 04:17:28,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:28,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:28,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578317776] [2019-12-27 04:17:28,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:28,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:28,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:28,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:28,020 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 04:17:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:28,162 INFO L93 Difference]: Finished difference Result 3604 states and 12619 transitions. [2019-12-27 04:17:28,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:28,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:17:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:28,188 INFO L225 Difference]: With dead ends: 3604 [2019-12-27 04:17:28,188 INFO L226 Difference]: Without dead ends: 3600 [2019-12-27 04:17:28,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2019-12-27 04:17:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 2147. [2019-12-27 04:17:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 04:17:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 04:17:28,264 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 04:17:28,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:28,265 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 04:17:28,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:28,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 04:17:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:28,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:28,266 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:28,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:28,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:28,267 INFO L82 PathProgramCache]: Analyzing trace with hash 65367165, now seen corresponding path program 1 times [2019-12-27 04:17:28,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:28,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631584005] [2019-12-27 04:17:28,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:28,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631584005] [2019-12-27 04:17:28,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803607832] [2019-12-27 04:17:28,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:28,420 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:28,421 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:28,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:28,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:28,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662584989] [2019-12-27 04:17:28,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:28,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:28,521 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 18 states. [2019-12-27 04:17:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:29,317 INFO L93 Difference]: Finished difference Result 6596 states and 21956 transitions. [2019-12-27 04:17:29,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 04:17:29,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:29,341 INFO L225 Difference]: With dead ends: 6596 [2019-12-27 04:17:29,341 INFO L226 Difference]: Without dead ends: 6592 [2019-12-27 04:17:29,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:17:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2019-12-27 04:17:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 2291. [2019-12-27 04:17:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-27 04:17:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 9027 transitions. [2019-12-27 04:17:29,496 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 9027 transitions. Word has length 15 [2019-12-27 04:17:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:29,497 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 9027 transitions. [2019-12-27 04:17:29,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 9027 transitions. [2019-12-27 04:17:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:29,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:29,498 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:29,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:29,703 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1209341565, now seen corresponding path program 2 times [2019-12-27 04:17:29,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:29,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114880310] [2019-12-27 04:17:29,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:29,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114880310] [2019-12-27 04:17:29,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990926610] [2019-12-27 04:17:29,787 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:29,873 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:17:29,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:29,874 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:29,876 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:30,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:30,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:30,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342836253] [2019-12-27 04:17:30,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:30,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:30,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:30,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:30,014 INFO L87 Difference]: Start difference. First operand 2291 states and 9027 transitions. Second operand 18 states. [2019-12-27 04:17:30,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:30,905 INFO L93 Difference]: Finished difference Result 7121 states and 23244 transitions. [2019-12-27 04:17:30,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 04:17:30,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:30,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:30,929 INFO L225 Difference]: With dead ends: 7121 [2019-12-27 04:17:30,929 INFO L226 Difference]: Without dead ends: 7117 [2019-12-27 04:17:30,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1142, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:17:30,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2019-12-27 04:17:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 2292. [2019-12-27 04:17:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2292 states. [2019-12-27 04:17:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2292 states to 2292 states and 9029 transitions. [2019-12-27 04:17:31,110 INFO L78 Accepts]: Start accepts. Automaton has 2292 states and 9029 transitions. Word has length 15 [2019-12-27 04:17:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:31,110 INFO L462 AbstractCegarLoop]: Abstraction has 2292 states and 9029 transitions. [2019-12-27 04:17:31,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2292 states and 9029 transitions. [2019-12-27 04:17:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:31,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:31,111 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:31,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:31,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1337558845, now seen corresponding path program 3 times [2019-12-27 04:17:31,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:31,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23708303] [2019-12-27 04:17:31,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:31,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23708303] [2019-12-27 04:17:31,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537447063] [2019-12-27 04:17:31,421 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:31,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:17:31,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:31,487 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:31,487 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:31,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:31,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:31,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744692200] [2019-12-27 04:17:31,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:31,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:31,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:31,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:31,581 INFO L87 Difference]: Start difference. First operand 2292 states and 9029 transitions. Second operand 18 states. [2019-12-27 04:17:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:32,397 INFO L93 Difference]: Finished difference Result 8074 states and 26184 transitions. [2019-12-27 04:17:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:17:32,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:32,424 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 04:17:32,424 INFO L226 Difference]: Without dead ends: 8069 [2019-12-27 04:17:32,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:17:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8069 states. [2019-12-27 04:17:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8069 to 2253. [2019-12-27 04:17:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-27 04:17:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8861 transitions. [2019-12-27 04:17:32,542 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 8861 transitions. Word has length 15 [2019-12-27 04:17:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:32,543 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 8861 transitions. [2019-12-27 04:17:32,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 8861 transitions. [2019-12-27 04:17:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:32,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:32,544 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:32,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:32,749 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash 46933139, now seen corresponding path program 4 times [2019-12-27 04:17:32,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:32,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993493238] [2019-12-27 04:17:32,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:32,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993493238] [2019-12-27 04:17:32,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652199643] [2019-12-27 04:17:32,840 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 [2019-12-27 04:17:32,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:17:32,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:32,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:32,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:33,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:33,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:33,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997055897] [2019-12-27 04:17:33,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:33,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:33,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:33,088 INFO L87 Difference]: Start difference. First operand 2253 states and 8861 transitions. Second operand 18 states. [2019-12-27 04:17:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:34,671 INFO L93 Difference]: Finished difference Result 12415 states and 40135 transitions. [2019-12-27 04:17:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 04:17:34,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:34,702 INFO L225 Difference]: With dead ends: 12415 [2019-12-27 04:17:34,702 INFO L226 Difference]: Without dead ends: 12411 [2019-12-27 04:17:34,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=722, Invalid=2700, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 04:17:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12411 states. [2019-12-27 04:17:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12411 to 2148. [2019-12-27 04:17:34,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2019-12-27 04:17:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 8359 transitions. [2019-12-27 04:17:34,945 INFO L78 Accepts]: Start accepts. Automaton has 2148 states and 8359 transitions. Word has length 15 [2019-12-27 04:17:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:34,945 INFO L462 AbstractCegarLoop]: Abstraction has 2148 states and 8359 transitions. [2019-12-27 04:17:34,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2148 states and 8359 transitions. [2019-12-27 04:17:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:34,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:34,946 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:35,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:35,150 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:35,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1190907539, now seen corresponding path program 5 times [2019-12-27 04:17:35,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:35,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814771062] [2019-12-27 04:17:35,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:35,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814771062] [2019-12-27 04:17:35,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74875952] [2019-12-27 04:17:35,217 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:35,292 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:17:35,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:35,293 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:35,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:35,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:35,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:35,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338625657] [2019-12-27 04:17:35,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:35,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:35,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:35,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:35,411 INFO L87 Difference]: Start difference. First operand 2148 states and 8359 transitions. Second operand 18 states. [2019-12-27 04:17:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:36,346 INFO L93 Difference]: Finished difference Result 6358 states and 20204 transitions. [2019-12-27 04:17:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:17:36,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:36,356 INFO L225 Difference]: With dead ends: 6358 [2019-12-27 04:17:36,356 INFO L226 Difference]: Without dead ends: 6354 [2019-12-27 04:17:36,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=369, Invalid=1353, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:17:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6354 states. [2019-12-27 04:17:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6354 to 2147. [2019-12-27 04:17:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 04:17:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8356 transitions. [2019-12-27 04:17:36,417 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8356 transitions. Word has length 15 [2019-12-27 04:17:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:36,417 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8356 transitions. [2019-12-27 04:17:36,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8356 transitions. [2019-12-27 04:17:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:17:36,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:36,418 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:36,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:36,660 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash -526841521, now seen corresponding path program 6 times [2019-12-27 04:17:36,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:36,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079504179] [2019-12-27 04:17:36,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:36,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079504179] [2019-12-27 04:17:36,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007917709] [2019-12-27 04:17:36,766 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:36,840 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-27 04:17:36,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:36,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:36,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:36,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:36,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:17:36,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410862431] [2019-12-27 04:17:36,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:17:36,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:36,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:17:36,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:17:36,951 INFO L87 Difference]: Start difference. First operand 2147 states and 8356 transitions. Second operand 18 states. [2019-12-27 04:17:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:38,080 INFO L93 Difference]: Finished difference Result 6157 states and 19308 transitions. [2019-12-27 04:17:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:17:38,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:17:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:38,098 INFO L225 Difference]: With dead ends: 6157 [2019-12-27 04:17:38,099 INFO L226 Difference]: Without dead ends: 6153 [2019-12-27 04:17:38,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 04:17:38,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6153 states. [2019-12-27 04:17:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6153 to 1998. [2019-12-27 04:17:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 04:17:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 04:17:38,193 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 04:17:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:38,193 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 04:17:38,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:17:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 04:17:38,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:17:38,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:38,195 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:38,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:38,399 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash -773481600, now seen corresponding path program 1 times [2019-12-27 04:17:38,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:38,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408025880] [2019-12-27 04:17:38,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:17:38,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408025880] [2019-12-27 04:17:38,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:17:38,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:17:38,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819373104] [2019-12-27 04:17:38,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:17:38,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:17:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:17:38,482 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 04:17:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:38,609 INFO L93 Difference]: Finished difference Result 3692 states and 13037 transitions. [2019-12-27 04:17:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:17:38,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 04:17:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:38,621 INFO L225 Difference]: With dead ends: 3692 [2019-12-27 04:17:38,621 INFO L226 Difference]: Without dead ends: 3684 [2019-12-27 04:17:38,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:17:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2019-12-27 04:17:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 2245. [2019-12-27 04:17:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 04:17:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 04:17:38,684 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 04:17:38,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:38,685 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 04:17:38,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:17:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 04:17:38,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:38,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:38,687 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:38,687 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:38,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:38,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2045174229, now seen corresponding path program 1 times [2019-12-27 04:17:38,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:38,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22271401] [2019-12-27 04:17:38,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:38,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22271401] [2019-12-27 04:17:38,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617815158] [2019-12-27 04:17:38,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:38,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:38,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:39,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:39,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:39,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742081629] [2019-12-27 04:17:39,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:39,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:39,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:39,050 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 20 states. [2019-12-27 04:17:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:40,227 INFO L93 Difference]: Finished difference Result 9631 states and 33006 transitions. [2019-12-27 04:17:40,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 04:17:40,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:40,253 INFO L225 Difference]: With dead ends: 9631 [2019-12-27 04:17:40,253 INFO L226 Difference]: Without dead ends: 9625 [2019-12-27 04:17:40,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 04:17:40,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2019-12-27 04:17:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 2467. [2019-12-27 04:17:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2467 states. [2019-12-27 04:17:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 9739 transitions. [2019-12-27 04:17:40,388 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 9739 transitions. Word has length 19 [2019-12-27 04:17:40,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:40,390 INFO L462 AbstractCegarLoop]: Abstraction has 2467 states and 9739 transitions. [2019-12-27 04:17:40,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 9739 transitions. [2019-12-27 04:17:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:40,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:40,401 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:40,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:40,614 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash -902093559, now seen corresponding path program 2 times [2019-12-27 04:17:40,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:40,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477710138] [2019-12-27 04:17:40,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:40,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477710138] [2019-12-27 04:17:40,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116090519] [2019-12-27 04:17:40,702 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:40,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:17:40,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:40,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:40,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:40,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:40,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:40,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076141861] [2019-12-27 04:17:40,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:40,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:40,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:40,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:40,905 INFO L87 Difference]: Start difference. First operand 2467 states and 9739 transitions. Second operand 20 states. [2019-12-27 04:17:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:42,060 INFO L93 Difference]: Finished difference Result 6850 states and 23581 transitions. [2019-12-27 04:17:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:17:42,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:42,079 INFO L225 Difference]: With dead ends: 6850 [2019-12-27 04:17:42,079 INFO L226 Difference]: Without dead ends: 6842 [2019-12-27 04:17:42,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=441, Invalid=1539, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 04:17:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2019-12-27 04:17:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 2518. [2019-12-27 04:17:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-12-27 04:17:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 9974 transitions. [2019-12-27 04:17:42,175 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 9974 transitions. Word has length 19 [2019-12-27 04:17:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:42,175 INFO L462 AbstractCegarLoop]: Abstraction has 2518 states and 9974 transitions. [2019-12-27 04:17:42,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 9974 transitions. [2019-12-27 04:17:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:42,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:42,177 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:42,382 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:42,382 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:42,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1675124677, now seen corresponding path program 3 times [2019-12-27 04:17:42,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:42,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242047730] [2019-12-27 04:17:42,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:42,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242047730] [2019-12-27 04:17:42,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908955962] [2019-12-27 04:17:42,474 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:42,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:17:42,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:42,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:42,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:42,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:42,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:42,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816489098] [2019-12-27 04:17:42,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:42,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:42,684 INFO L87 Difference]: Start difference. First operand 2518 states and 9974 transitions. Second operand 20 states. [2019-12-27 04:17:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:44,222 INFO L93 Difference]: Finished difference Result 7202 states and 24414 transitions. [2019-12-27 04:17:44,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:17:44,222 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:44,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:44,236 INFO L225 Difference]: With dead ends: 7202 [2019-12-27 04:17:44,236 INFO L226 Difference]: Without dead ends: 7192 [2019-12-27 04:17:44,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=505, Invalid=1751, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 04:17:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2019-12-27 04:17:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 2526. [2019-12-27 04:17:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2526 states. [2019-12-27 04:17:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2526 states to 2526 states and 9994 transitions. [2019-12-27 04:17:44,335 INFO L78 Accepts]: Start accepts. Automaton has 2526 states and 9994 transitions. Word has length 19 [2019-12-27 04:17:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:44,335 INFO L462 AbstractCegarLoop]: Abstraction has 2526 states and 9994 transitions. [2019-12-27 04:17:44,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2526 states and 9994 transitions. [2019-12-27 04:17:44,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:44,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:44,337 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:44,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:44,541 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:44,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:44,541 INFO L82 PathProgramCache]: Analyzing trace with hash -287060421, now seen corresponding path program 1 times [2019-12-27 04:17:44,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:44,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328709621] [2019-12-27 04:17:44,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:44,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328709621] [2019-12-27 04:17:44,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487368543] [2019-12-27 04:17:44,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:44,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:44,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:44,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:44,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:44,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990790650] [2019-12-27 04:17:44,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:44,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:44,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:44,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:44,822 INFO L87 Difference]: Start difference. First operand 2526 states and 9994 transitions. Second operand 20 states. [2019-12-27 04:17:45,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:45,546 INFO L93 Difference]: Finished difference Result 6238 states and 22108 transitions. [2019-12-27 04:17:45,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:17:45,546 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:45,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:45,556 INFO L225 Difference]: With dead ends: 6238 [2019-12-27 04:17:45,556 INFO L226 Difference]: Without dead ends: 6229 [2019-12-27 04:17:45,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 04:17:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6229 states. [2019-12-27 04:17:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6229 to 2774. [2019-12-27 04:17:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-12-27 04:17:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 11179 transitions. [2019-12-27 04:17:45,643 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 11179 transitions. Word has length 19 [2019-12-27 04:17:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:45,643 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 11179 transitions. [2019-12-27 04:17:45,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 11179 transitions. [2019-12-27 04:17:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:45,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:45,645 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:45,846 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:45,846 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash -286456665, now seen corresponding path program 4 times [2019-12-27 04:17:45,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:45,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722839914] [2019-12-27 04:17:45,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:45,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722839914] [2019-12-27 04:17:45,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248575749] [2019-12-27 04:17:45,943 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:46,004 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:17:46,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:46,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:46,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:46,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:46,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:46,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576336511] [2019-12-27 04:17:46,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:46,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:46,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:46,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:46,123 INFO L87 Difference]: Start difference. First operand 2774 states and 11179 transitions. Second operand 20 states. [2019-12-27 04:17:47,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:47,048 INFO L93 Difference]: Finished difference Result 9226 states and 32233 transitions. [2019-12-27 04:17:47,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 04:17:47,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:47,063 INFO L225 Difference]: With dead ends: 9226 [2019-12-27 04:17:47,063 INFO L226 Difference]: Without dead ends: 9217 [2019-12-27 04:17:47,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1319, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:17:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2019-12-27 04:17:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 2779. [2019-12-27 04:17:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2779 states. [2019-12-27 04:17:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 11190 transitions. [2019-12-27 04:17:47,141 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 11190 transitions. Word has length 19 [2019-12-27 04:17:47,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:47,141 INFO L462 AbstractCegarLoop]: Abstraction has 2779 states and 11190 transitions. [2019-12-27 04:17:47,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 11190 transitions. [2019-12-27 04:17:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:47,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:47,142 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:47,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:47,343 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash -286465221, now seen corresponding path program 2 times [2019-12-27 04:17:47,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:47,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389424947] [2019-12-27 04:17:47,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:47,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389424947] [2019-12-27 04:17:47,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560813420] [2019-12-27 04:17:47,433 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:47,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:17:47,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:47,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:47,510 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 04:17:47,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:47,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 04:17:47,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351657635] [2019-12-27 04:17:47,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:17:47,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:47,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:17:47,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:17:47,609 INFO L87 Difference]: Start difference. First operand 2779 states and 11190 transitions. Second operand 19 states. [2019-12-27 04:17:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:48,426 INFO L93 Difference]: Finished difference Result 5581 states and 19502 transitions. [2019-12-27 04:17:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:17:48,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-27 04:17:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:48,439 INFO L225 Difference]: With dead ends: 5581 [2019-12-27 04:17:48,439 INFO L226 Difference]: Without dead ends: 5572 [2019-12-27 04:17:48,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:17:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-12-27 04:17:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 2800. [2019-12-27 04:17:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2800 states. [2019-12-27 04:17:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 11271 transitions. [2019-12-27 04:17:48,497 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 11271 transitions. Word has length 19 [2019-12-27 04:17:48,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:48,497 INFO L462 AbstractCegarLoop]: Abstraction has 2800 states and 11271 transitions. [2019-12-27 04:17:48,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:17:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 11271 transitions. [2019-12-27 04:17:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:48,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:48,499 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:48,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:48,700 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash 244420411, now seen corresponding path program 3 times [2019-12-27 04:17:48,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:48,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074091922] [2019-12-27 04:17:48,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:48,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074091922] [2019-12-27 04:17:48,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202806932] [2019-12-27 04:17:48,789 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:48,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:17:48,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:48,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:48,866 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:49,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:49,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:49,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183014123] [2019-12-27 04:17:49,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:49,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:49,062 INFO L87 Difference]: Start difference. First operand 2800 states and 11271 transitions. Second operand 20 states. [2019-12-27 04:17:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:50,028 INFO L93 Difference]: Finished difference Result 6966 states and 24484 transitions. [2019-12-27 04:17:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:17:50,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:50,050 INFO L225 Difference]: With dead ends: 6966 [2019-12-27 04:17:50,050 INFO L226 Difference]: Without dead ends: 6957 [2019-12-27 04:17:50,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=1206, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:17:50,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2019-12-27 04:17:50,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 2951. [2019-12-27 04:17:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2019-12-27 04:17:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 12035 transitions. [2019-12-27 04:17:50,180 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 12035 transitions. Word has length 19 [2019-12-27 04:17:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:50,180 INFO L462 AbstractCegarLoop]: Abstraction has 2951 states and 12035 transitions. [2019-12-27 04:17:50,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 12035 transitions. [2019-12-27 04:17:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:50,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:50,184 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:50,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:50,388 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1118161091, now seen corresponding path program 4 times [2019-12-27 04:17:50,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:50,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952245179] [2019-12-27 04:17:50,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:50,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952245179] [2019-12-27 04:17:50,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28471524] [2019-12-27 04:17:50,465 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:50,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:17:50,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:50,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:50,532 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:50,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:50,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:50,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403665290] [2019-12-27 04:17:50,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:50,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:50,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:50,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:50,681 INFO L87 Difference]: Start difference. First operand 2951 states and 12035 transitions. Second operand 20 states. [2019-12-27 04:17:51,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:51,679 INFO L93 Difference]: Finished difference Result 6602 states and 22963 transitions. [2019-12-27 04:17:51,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:17:51,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:51,690 INFO L225 Difference]: With dead ends: 6602 [2019-12-27 04:17:51,691 INFO L226 Difference]: Without dead ends: 6593 [2019-12-27 04:17:51,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1469, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 04:17:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6593 states. [2019-12-27 04:17:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6593 to 2829. [2019-12-27 04:17:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2019-12-27 04:17:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 11387 transitions. [2019-12-27 04:17:51,865 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 11387 transitions. Word has length 19 [2019-12-27 04:17:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:51,865 INFO L462 AbstractCegarLoop]: Abstraction has 2829 states and 11387 transitions. [2019-12-27 04:17:51,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 11387 transitions. [2019-12-27 04:17:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:51,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:51,867 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:52,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:52,067 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1977035621, now seen corresponding path program 5 times [2019-12-27 04:17:52,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:52,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452201986] [2019-12-27 04:17:52,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:52,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452201986] [2019-12-27 04:17:52,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515837859] [2019-12-27 04:17:52,143 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:52,208 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:17:52,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:52,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:17:52,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:52,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:52,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 04:17:52,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519049319] [2019-12-27 04:17:52,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:17:52,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:17:52,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:17:52,324 INFO L87 Difference]: Start difference. First operand 2829 states and 11387 transitions. Second operand 19 states. [2019-12-27 04:17:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:53,789 INFO L93 Difference]: Finished difference Result 7580 states and 25385 transitions. [2019-12-27 04:17:53,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:17:53,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-27 04:17:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:53,801 INFO L225 Difference]: With dead ends: 7580 [2019-12-27 04:17:53,801 INFO L226 Difference]: Without dead ends: 7556 [2019-12-27 04:17:53,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=549, Invalid=1901, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 04:17:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7556 states. [2019-12-27 04:17:53,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7556 to 2498. [2019-12-27 04:17:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2019-12-27 04:17:53,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 9874 transitions. [2019-12-27 04:17:53,862 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 9874 transitions. Word has length 19 [2019-12-27 04:17:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:53,862 INFO L462 AbstractCegarLoop]: Abstraction has 2498 states and 9874 transitions. [2019-12-27 04:17:53,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:17:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 9874 transitions. [2019-12-27 04:17:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:53,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:53,864 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:54,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:54,068 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:54,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1004938431, now seen corresponding path program 5 times [2019-12-27 04:17:54,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:54,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64432730] [2019-12-27 04:17:54,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:54,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64432730] [2019-12-27 04:17:54,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794942836] [2019-12-27 04:17:54,163 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:54,226 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:17:54,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:54,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:54,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:54,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:54,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:54,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969797442] [2019-12-27 04:17:54,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:54,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:54,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:54,373 INFO L87 Difference]: Start difference. First operand 2498 states and 9874 transitions. Second operand 20 states. [2019-12-27 04:17:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:56,104 INFO L93 Difference]: Finished difference Result 11643 states and 40400 transitions. [2019-12-27 04:17:56,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 04:17:56,105 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:56,126 INFO L225 Difference]: With dead ends: 11643 [2019-12-27 04:17:56,127 INFO L226 Difference]: Without dead ends: 11634 [2019-12-27 04:17:56,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=768, Invalid=2892, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 04:17:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11634 states. [2019-12-27 04:17:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11634 to 2444. [2019-12-27 04:17:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-12-27 04:17:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 9584 transitions. [2019-12-27 04:17:56,222 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 9584 transitions. Word has length 19 [2019-12-27 04:17:56,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:56,222 INFO L462 AbstractCegarLoop]: Abstraction has 2444 states and 9584 transitions. [2019-12-27 04:17:56,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 9584 transitions. [2019-12-27 04:17:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:56,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:56,224 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:56,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:56,424 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:56,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash 138142239, now seen corresponding path program 6 times [2019-12-27 04:17:56,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:56,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286096932] [2019-12-27 04:17:56,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:56,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286096932] [2019-12-27 04:17:56,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737004404] [2019-12-27 04:17:56,531 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:56,609 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 04:17:56,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:17:56,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:56,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:56,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:56,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:56,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485391266] [2019-12-27 04:17:56,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:56,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:56,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:56,756 INFO L87 Difference]: Start difference. First operand 2444 states and 9584 transitions. Second operand 20 states. [2019-12-27 04:17:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:17:58,013 INFO L93 Difference]: Finished difference Result 6283 states and 21343 transitions. [2019-12-27 04:17:58,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:17:58,013 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:17:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:17:58,023 INFO L225 Difference]: With dead ends: 6283 [2019-12-27 04:17:58,023 INFO L226 Difference]: Without dead ends: 6274 [2019-12-27 04:17:58,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=445, Invalid=1625, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 04:17:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2019-12-27 04:17:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 2441. [2019-12-27 04:17:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2441 states. [2019-12-27 04:17:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 9573 transitions. [2019-12-27 04:17:58,080 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 9573 transitions. Word has length 19 [2019-12-27 04:17:58,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:17:58,081 INFO L462 AbstractCegarLoop]: Abstraction has 2441 states and 9573 transitions. [2019-12-27 04:17:58,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:17:58,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 9573 transitions. [2019-12-27 04:17:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:17:58,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:17:58,082 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:17:58,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:58,282 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:17:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:17:58,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1579606821, now seen corresponding path program 7 times [2019-12-27 04:17:58,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:17:58,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948157923] [2019-12-27 04:17:58,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:17:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:58,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948157923] [2019-12-27 04:17:58,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56412104] [2019-12-27 04:17:58,433 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:17:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:17:58,500 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:17:58,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:17:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:17:58,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:17:58,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:17:58,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321753654] [2019-12-27 04:17:58,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:17:58,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:17:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:17:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:17:58,627 INFO L87 Difference]: Start difference. First operand 2441 states and 9573 transitions. Second operand 20 states. [2019-12-27 04:18:00,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:00,091 INFO L93 Difference]: Finished difference Result 6551 states and 21720 transitions. [2019-12-27 04:18:00,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 04:18:00,092 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:18:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:00,102 INFO L225 Difference]: With dead ends: 6551 [2019-12-27 04:18:00,103 INFO L226 Difference]: Without dead ends: 6540 [2019-12-27 04:18:00,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 04:18:00,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6540 states. [2019-12-27 04:18:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6540 to 2413. [2019-12-27 04:18:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2019-12-27 04:18:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 9460 transitions. [2019-12-27 04:18:00,166 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 9460 transitions. Word has length 19 [2019-12-27 04:18:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:00,166 INFO L462 AbstractCegarLoop]: Abstraction has 2413 states and 9460 transitions. [2019-12-27 04:18:00,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:18:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 9460 transitions. [2019-12-27 04:18:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:18:00,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:00,167 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:00,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:00,368 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash -87468871, now seen corresponding path program 8 times [2019-12-27 04:18:00,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:00,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497286615] [2019-12-27 04:18:00,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:00,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497286615] [2019-12-27 04:18:00,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382304859] [2019-12-27 04:18:00,461 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:00,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:18:00,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:00,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:18:00,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 04:18:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 04:18:00,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623552550] [2019-12-27 04:18:00,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:18:00,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:18:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:18:00,744 INFO L87 Difference]: Start difference. First operand 2413 states and 9460 transitions. Second operand 19 states. [2019-12-27 04:18:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:02,435 INFO L93 Difference]: Finished difference Result 6388 states and 21017 transitions. [2019-12-27 04:18:02,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 04:18:02,435 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-27 04:18:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:02,446 INFO L225 Difference]: With dead ends: 6388 [2019-12-27 04:18:02,446 INFO L226 Difference]: Without dead ends: 6382 [2019-12-27 04:18:02,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=1947, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 04:18:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6382 states. [2019-12-27 04:18:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6382 to 2259. [2019-12-27 04:18:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2259 states. [2019-12-27 04:18:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 8835 transitions. [2019-12-27 04:18:02,503 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 8835 transitions. Word has length 19 [2019-12-27 04:18:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:02,503 INFO L462 AbstractCegarLoop]: Abstraction has 2259 states and 8835 transitions. [2019-12-27 04:18:02,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:18:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 8835 transitions. [2019-12-27 04:18:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:02,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:02,504 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:02,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:02,705 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:02,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1682002470, now seen corresponding path program 1 times [2019-12-27 04:18:02,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:02,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550365650] [2019-12-27 04:18:02,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:02,800 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:02,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550365650] [2019-12-27 04:18:02,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932746769] [2019-12-27 04:18:02,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:02,867 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:02,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:03,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:03,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:03,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432244057] [2019-12-27 04:18:03,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:03,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:03,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:03,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:03,012 INFO L87 Difference]: Start difference. First operand 2259 states and 8835 transitions. Second operand 24 states. [2019-12-27 04:18:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:06,799 INFO L93 Difference]: Finished difference Result 17049 states and 52657 transitions. [2019-12-27 04:18:06,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-27 04:18:06,799 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:06,827 INFO L225 Difference]: With dead ends: 17049 [2019-12-27 04:18:06,827 INFO L226 Difference]: Without dead ends: 17045 [2019-12-27 04:18:06,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4372 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2727, Invalid=10383, Unknown=0, NotChecked=0, Total=13110 [2019-12-27 04:18:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17045 states. [2019-12-27 04:18:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17045 to 2311. [2019-12-27 04:18:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2311 states. [2019-12-27 04:18:06,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2311 states to 2311 states and 9078 transitions. [2019-12-27 04:18:06,955 INFO L78 Accepts]: Start accepts. Automaton has 2311 states and 9078 transitions. Word has length 21 [2019-12-27 04:18:06,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:06,955 INFO L462 AbstractCegarLoop]: Abstraction has 2311 states and 9078 transitions. [2019-12-27 04:18:06,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:06,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 9078 transitions. [2019-12-27 04:18:06,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:06,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:06,957 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:07,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:07,160 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1682597670, now seen corresponding path program 2 times [2019-12-27 04:18:07,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:07,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058819090] [2019-12-27 04:18:07,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:07,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058819090] [2019-12-27 04:18:07,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444323241] [2019-12-27 04:18:07,267 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:07,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:18:07,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:07,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:07,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:07,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:07,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:07,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173017383] [2019-12-27 04:18:07,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:07,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:07,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:07,484 INFO L87 Difference]: Start difference. First operand 2311 states and 9078 transitions. Second operand 24 states. [2019-12-27 04:18:10,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:10,931 INFO L93 Difference]: Finished difference Result 16849 states and 52108 transitions. [2019-12-27 04:18:10,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-27 04:18:10,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:10,958 INFO L225 Difference]: With dead ends: 16849 [2019-12-27 04:18:10,959 INFO L226 Difference]: Without dead ends: 16843 [2019-12-27 04:18:10,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4352 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2727, Invalid=10383, Unknown=0, NotChecked=0, Total=13110 [2019-12-27 04:18:10,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16843 states. [2019-12-27 04:18:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16843 to 2309. [2019-12-27 04:18:11,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2309 states. [2019-12-27 04:18:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 9072 transitions. [2019-12-27 04:18:11,078 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 9072 transitions. Word has length 21 [2019-12-27 04:18:11,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:11,078 INFO L462 AbstractCegarLoop]: Abstraction has 2309 states and 9072 transitions. [2019-12-27 04:18:11,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:11,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 9072 transitions. [2019-12-27 04:18:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:11,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:11,079 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:11,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:11,280 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash 670898564, now seen corresponding path program 3 times [2019-12-27 04:18:11,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:11,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489275110] [2019-12-27 04:18:11,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:11,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489275110] [2019-12-27 04:18:11,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77514686] [2019-12-27 04:18:11,417 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:11,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:18:11,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:11,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:11,516 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:11,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:11,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:11,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669564181] [2019-12-27 04:18:11,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:11,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:11,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:11,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:11,735 INFO L87 Difference]: Start difference. First operand 2309 states and 9072 transitions. Second operand 24 states. [2019-12-27 04:18:15,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:15,304 INFO L93 Difference]: Finished difference Result 15997 states and 49097 transitions. [2019-12-27 04:18:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-27 04:18:15,305 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:15,339 INFO L225 Difference]: With dead ends: 15997 [2019-12-27 04:18:15,339 INFO L226 Difference]: Without dead ends: 15983 [2019-12-27 04:18:15,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5491 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2630, Invalid=12622, Unknown=0, NotChecked=0, Total=15252 [2019-12-27 04:18:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15983 states. [2019-12-27 04:18:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15983 to 2348. [2019-12-27 04:18:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-12-27 04:18:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 9252 transitions. [2019-12-27 04:18:15,457 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 9252 transitions. Word has length 21 [2019-12-27 04:18:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:15,458 INFO L462 AbstractCegarLoop]: Abstraction has 2348 states and 9252 transitions. [2019-12-27 04:18:15,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 9252 transitions. [2019-12-27 04:18:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:15,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:15,460 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:15,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:15,663 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:15,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 671493764, now seen corresponding path program 4 times [2019-12-27 04:18:15,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:15,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754542325] [2019-12-27 04:18:15,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:15,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754542325] [2019-12-27 04:18:15,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961584529] [2019-12-27 04:18:15,760 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:15,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:18:15,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:15,839 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:15,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:16,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:16,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:16,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907899487] [2019-12-27 04:18:16,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:16,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:16,005 INFO L87 Difference]: Start difference. First operand 2348 states and 9252 transitions. Second operand 24 states. [2019-12-27 04:18:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:19,392 INFO L93 Difference]: Finished difference Result 14430 states and 45115 transitions. [2019-12-27 04:18:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-27 04:18:19,392 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:19,417 INFO L225 Difference]: With dead ends: 14430 [2019-12-27 04:18:19,417 INFO L226 Difference]: Without dead ends: 14422 [2019-12-27 04:18:19,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3725 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2076, Invalid=9054, Unknown=0, NotChecked=0, Total=11130 [2019-12-27 04:18:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14422 states. [2019-12-27 04:18:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14422 to 2323. [2019-12-27 04:18:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2323 states. [2019-12-27 04:18:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 9145 transitions. [2019-12-27 04:18:19,525 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 9145 transitions. Word has length 21 [2019-12-27 04:18:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:19,525 INFO L462 AbstractCegarLoop]: Abstraction has 2323 states and 9145 transitions. [2019-12-27 04:18:19,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 9145 transitions. [2019-12-27 04:18:19,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:19,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:19,526 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:19,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:19,727 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:19,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1202379396, now seen corresponding path program 5 times [2019-12-27 04:18:19,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:19,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784758988] [2019-12-27 04:18:19,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:19,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784758988] [2019-12-27 04:18:19,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509518720] [2019-12-27 04:18:19,878 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:19,945 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:18:19,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:19,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:19,947 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:20,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:20,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:20,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851947260] [2019-12-27 04:18:20,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:20,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:20,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:20,098 INFO L87 Difference]: Start difference. First operand 2323 states and 9145 transitions. Second operand 24 states. [2019-12-27 04:18:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:25,258 INFO L93 Difference]: Finished difference Result 20287 states and 61616 transitions. [2019-12-27 04:18:25,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-12-27 04:18:25,258 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:25,289 INFO L225 Difference]: With dead ends: 20287 [2019-12-27 04:18:25,289 INFO L226 Difference]: Without dead ends: 20271 [2019-12-27 04:18:25,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10500 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4366, Invalid=22694, Unknown=0, NotChecked=0, Total=27060 [2019-12-27 04:18:25,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20271 states. [2019-12-27 04:18:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20271 to 2422. [2019-12-27 04:18:25,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2019-12-27 04:18:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 9627 transitions. [2019-12-27 04:18:25,434 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 9627 transitions. Word has length 21 [2019-12-27 04:18:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:25,435 INFO L462 AbstractCegarLoop]: Abstraction has 2422 states and 9627 transitions. [2019-12-27 04:18:25,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 9627 transitions. [2019-12-27 04:18:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:25,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:25,436 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:25,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:25,639 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:25,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:25,640 INFO L82 PathProgramCache]: Analyzing trace with hash -818506432, now seen corresponding path program 6 times [2019-12-27 04:18:25,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:25,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709714162] [2019-12-27 04:18:25,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:25,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709714162] [2019-12-27 04:18:25,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627980818] [2019-12-27 04:18:25,728 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:25,793 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 04:18:25,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:25,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:25,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:25,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:25,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:25,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126041599] [2019-12-27 04:18:25,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:25,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:25,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:25,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:25,938 INFO L87 Difference]: Start difference. First operand 2422 states and 9627 transitions. Second operand 24 states. [2019-12-27 04:18:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:30,394 INFO L93 Difference]: Finished difference Result 16146 states and 49018 transitions. [2019-12-27 04:18:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2019-12-27 04:18:30,395 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:30,421 INFO L225 Difference]: With dead ends: 16146 [2019-12-27 04:18:30,421 INFO L226 Difference]: Without dead ends: 16137 [2019-12-27 04:18:30,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8079 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3329, Invalid=17263, Unknown=0, NotChecked=0, Total=20592 [2019-12-27 04:18:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2019-12-27 04:18:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 2429. [2019-12-27 04:18:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-12-27 04:18:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 9652 transitions. [2019-12-27 04:18:30,535 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 9652 transitions. Word has length 21 [2019-12-27 04:18:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:30,535 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 9652 transitions. [2019-12-27 04:18:30,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 9652 transitions. [2019-12-27 04:18:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:30,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:30,537 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:30,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:30,738 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:30,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:30,738 INFO L82 PathProgramCache]: Analyzing trace with hash -817911232, now seen corresponding path program 7 times [2019-12-27 04:18:30,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:30,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749741790] [2019-12-27 04:18:30,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:30,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749741790] [2019-12-27 04:18:30,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407900601] [2019-12-27 04:18:30,819 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:30,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:30,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:31,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:31,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:31,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241717344] [2019-12-27 04:18:31,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:31,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:31,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:31,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:31,073 INFO L87 Difference]: Start difference. First operand 2429 states and 9652 transitions. Second operand 24 states. [2019-12-27 04:18:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:34,928 INFO L93 Difference]: Finished difference Result 15056 states and 46587 transitions. [2019-12-27 04:18:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-27 04:18:34,928 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:34,956 INFO L225 Difference]: With dead ends: 15056 [2019-12-27 04:18:34,956 INFO L226 Difference]: Without dead ends: 15046 [2019-12-27 04:18:34,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5695 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2679, Invalid=12573, Unknown=0, NotChecked=0, Total=15252 [2019-12-27 04:18:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15046 states. [2019-12-27 04:18:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15046 to 2411. [2019-12-27 04:18:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-27 04:18:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 9575 transitions. [2019-12-27 04:18:35,069 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 9575 transitions. Word has length 21 [2019-12-27 04:18:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:35,069 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 9575 transitions. [2019-12-27 04:18:35,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 9575 transitions. [2019-12-27 04:18:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:35,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:35,071 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:35,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:35,274 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1450662060, now seen corresponding path program 8 times [2019-12-27 04:18:35,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:35,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572625890] [2019-12-27 04:18:35,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:35,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572625890] [2019-12-27 04:18:35,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590731124] [2019-12-27 04:18:35,365 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:35,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:18:35,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:35,427 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:35,428 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:35,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:35,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:35,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733586469] [2019-12-27 04:18:35,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:35,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:35,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:35,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:35,596 INFO L87 Difference]: Start difference. First operand 2411 states and 9575 transitions. Second operand 24 states. [2019-12-27 04:18:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:42,023 INFO L93 Difference]: Finished difference Result 18846 states and 56797 transitions. [2019-12-27 04:18:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-12-27 04:18:42,023 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:42,055 INFO L225 Difference]: With dead ends: 18846 [2019-12-27 04:18:42,055 INFO L226 Difference]: Without dead ends: 18831 [2019-12-27 04:18:42,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13427 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5009, Invalid=28297, Unknown=0, NotChecked=0, Total=33306 [2019-12-27 04:18:42,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18831 states. [2019-12-27 04:18:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18831 to 2327. [2019-12-27 04:18:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2019-12-27 04:18:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 9155 transitions. [2019-12-27 04:18:42,185 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 9155 transitions. Word has length 21 [2019-12-27 04:18:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:42,185 INFO L462 AbstractCegarLoop]: Abstraction has 2327 states and 9155 transitions. [2019-12-27 04:18:42,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 9155 transitions. [2019-12-27 04:18:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:42,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:42,187 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:42,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:42,390 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:42,391 INFO L82 PathProgramCache]: Analyzing trace with hash 586715080, now seen corresponding path program 9 times [2019-12-27 04:18:42,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:42,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210025251] [2019-12-27 04:18:42,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:42,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210025251] [2019-12-27 04:18:42,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318016280] [2019-12-27 04:18:42,476 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:42,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:18:42,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:42,553 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:42,554 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:42,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:42,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 04:18:42,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612079912] [2019-12-27 04:18:42,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:18:42,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:42,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:18:42,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:18:42,778 INFO L87 Difference]: Start difference. First operand 2327 states and 9155 transitions. Second operand 23 states. [2019-12-27 04:18:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:46,764 INFO L93 Difference]: Finished difference Result 11985 states and 35942 transitions. [2019-12-27 04:18:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-27 04:18:46,765 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-27 04:18:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:46,782 INFO L225 Difference]: With dead ends: 11985 [2019-12-27 04:18:46,783 INFO L226 Difference]: Without dead ends: 11976 [2019-12-27 04:18:46,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6318 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2715, Invalid=14055, Unknown=0, NotChecked=0, Total=16770 [2019-12-27 04:18:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11976 states. [2019-12-27 04:18:46,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11976 to 2332. [2019-12-27 04:18:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-27 04:18:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 9185 transitions. [2019-12-27 04:18:46,871 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 9185 transitions. Word has length 21 [2019-12-27 04:18:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:46,871 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 9185 transitions. [2019-12-27 04:18:46,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:18:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 9185 transitions. [2019-12-27 04:18:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:46,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:46,873 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:47,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:47,074 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1445589610, now seen corresponding path program 10 times [2019-12-27 04:18:47,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:47,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33787093] [2019-12-27 04:18:47,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:47,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33787093] [2019-12-27 04:18:47,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207375442] [2019-12-27 04:18:47,153 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:47,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:18:47,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:47,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:47,224 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:47,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:47,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 04:18:47,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417589494] [2019-12-27 04:18:47,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:18:47,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:47,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:18:47,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:18:47,367 INFO L87 Difference]: Start difference. First operand 2332 states and 9185 transitions. Second operand 23 states. [2019-12-27 04:18:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:51,399 INFO L93 Difference]: Finished difference Result 12278 states and 36913 transitions. [2019-12-27 04:18:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-27 04:18:51,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-27 04:18:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:51,417 INFO L225 Difference]: With dead ends: 12278 [2019-12-27 04:18:51,417 INFO L226 Difference]: Without dead ends: 12273 [2019-12-27 04:18:51,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6146 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2633, Invalid=13369, Unknown=0, NotChecked=0, Total=16002 [2019-12-27 04:18:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12273 states. [2019-12-27 04:18:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12273 to 2332. [2019-12-27 04:18:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-27 04:18:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 9185 transitions. [2019-12-27 04:18:51,505 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 9185 transitions. Word has length 21 [2019-12-27 04:18:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:51,505 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 9185 transitions. [2019-12-27 04:18:51,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:18:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 9185 transitions. [2019-12-27 04:18:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:51,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:51,506 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:51,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:51,707 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:51,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1343161106, now seen corresponding path program 1 times [2019-12-27 04:18:51,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:51,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712868671] [2019-12-27 04:18:51,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:18:51,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712868671] [2019-12-27 04:18:51,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:18:51,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:18:51,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713018223] [2019-12-27 04:18:51,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:18:51,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:18:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:18:51,746 INFO L87 Difference]: Start difference. First operand 2332 states and 9185 transitions. Second operand 5 states. [2019-12-27 04:18:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:51,853 INFO L93 Difference]: Finished difference Result 3954 states and 14252 transitions. [2019-12-27 04:18:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:18:51,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 04:18:51,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:51,860 INFO L225 Difference]: With dead ends: 3954 [2019-12-27 04:18:51,860 INFO L226 Difference]: Without dead ends: 3938 [2019-12-27 04:18:51,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:18:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2019-12-27 04:18:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 2601. [2019-12-27 04:18:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2601 states. [2019-12-27 04:18:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 10077 transitions. [2019-12-27 04:18:51,903 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 10077 transitions. Word has length 21 [2019-12-27 04:18:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:51,904 INFO L462 AbstractCegarLoop]: Abstraction has 2601 states and 10077 transitions. [2019-12-27 04:18:51,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:18:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 10077 transitions. [2019-12-27 04:18:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:51,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:51,905 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:51,905 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -979520350, now seen corresponding path program 11 times [2019-12-27 04:18:51,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:51,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146050992] [2019-12-27 04:18:51,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:51,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146050992] [2019-12-27 04:18:51,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994387206] [2019-12-27 04:18:51,994 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:52,060 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:18:52,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:52,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:52,061 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:52,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:52,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:52,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873778881] [2019-12-27 04:18:52,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:52,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:52,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:52,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:52,192 INFO L87 Difference]: Start difference. First operand 2601 states and 10077 transitions. Second operand 24 states. [2019-12-27 04:18:54,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:54,623 INFO L93 Difference]: Finished difference Result 15951 states and 51064 transitions. [2019-12-27 04:18:54,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-27 04:18:54,624 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:54,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:54,650 INFO L225 Difference]: With dead ends: 15951 [2019-12-27 04:18:54,650 INFO L226 Difference]: Without dead ends: 15936 [2019-12-27 04:18:54,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2589 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1410, Invalid=6246, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 04:18:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15936 states. [2019-12-27 04:18:54,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15936 to 2560. [2019-12-27 04:18:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2019-12-27 04:18:54,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 9859 transitions. [2019-12-27 04:18:54,768 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 9859 transitions. Word has length 21 [2019-12-27 04:18:54,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:54,769 INFO L462 AbstractCegarLoop]: Abstraction has 2560 states and 9859 transitions. [2019-12-27 04:18:54,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 9859 transitions. [2019-12-27 04:18:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:54,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:54,770 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:54,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:54,971 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:54,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:54,971 INFO L82 PathProgramCache]: Analyzing trace with hash -987138910, now seen corresponding path program 12 times [2019-12-27 04:18:54,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:54,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743866583] [2019-12-27 04:18:54,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:55,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743866583] [2019-12-27 04:18:55,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70810958] [2019-12-27 04:18:55,069 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:55,145 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 04:18:55,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:18:55,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:55,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:55,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:55,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:55,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459657248] [2019-12-27 04:18:55,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:55,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:55,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:55,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:55,299 INFO L87 Difference]: Start difference. First operand 2560 states and 9859 transitions. Second operand 24 states. [2019-12-27 04:18:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:18:57,597 INFO L93 Difference]: Finished difference Result 13295 states and 42191 transitions. [2019-12-27 04:18:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-27 04:18:57,597 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:18:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:18:57,620 INFO L225 Difference]: With dead ends: 13295 [2019-12-27 04:18:57,620 INFO L226 Difference]: Without dead ends: 13286 [2019-12-27 04:18:57,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1182, Invalid=4980, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 04:18:57,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13286 states. [2019-12-27 04:18:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13286 to 2558. [2019-12-27 04:18:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2019-12-27 04:18:57,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 9852 transitions. [2019-12-27 04:18:57,727 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 9852 transitions. Word has length 21 [2019-12-27 04:18:57,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:18:57,727 INFO L462 AbstractCegarLoop]: Abstraction has 2558 states and 9852 transitions. [2019-12-27 04:18:57,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:18:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 9852 transitions. [2019-12-27 04:18:57,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:18:57,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:18:57,728 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:18:57,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:57,929 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:18:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:18:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash -406937950, now seen corresponding path program 13 times [2019-12-27 04:18:57,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:18:57,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672922504] [2019-12-27 04:18:57,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:18:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:58,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672922504] [2019-12-27 04:18:58,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906878655] [2019-12-27 04:18:58,022 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:18:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:18:58,088 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:18:58,088 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:18:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:18:58,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:18:58,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:18:58,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409198510] [2019-12-27 04:18:58,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:18:58,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:18:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:18:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:18:58,228 INFO L87 Difference]: Start difference. First operand 2558 states and 9852 transitions. Second operand 24 states. [2019-12-27 04:19:01,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:01,460 INFO L93 Difference]: Finished difference Result 19063 states and 59545 transitions. [2019-12-27 04:19:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-27 04:19:01,460 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:01,499 INFO L225 Difference]: With dead ends: 19063 [2019-12-27 04:19:01,500 INFO L226 Difference]: Without dead ends: 19056 [2019-12-27 04:19:01,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2116, Invalid=9656, Unknown=0, NotChecked=0, Total=11772 [2019-12-27 04:19:01,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19056 states. [2019-12-27 04:19:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19056 to 2518. [2019-12-27 04:19:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2518 states. [2019-12-27 04:19:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 9680 transitions. [2019-12-27 04:19:01,648 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 9680 transitions. Word has length 21 [2019-12-27 04:19:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:01,648 INFO L462 AbstractCegarLoop]: Abstraction has 2518 states and 9680 transitions. [2019-12-27 04:19:01,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 9680 transitions. [2019-12-27 04:19:01,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:01,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:01,649 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:01,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:01,850 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash -415151710, now seen corresponding path program 14 times [2019-12-27 04:19:01,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:01,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968327466] [2019-12-27 04:19:01,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:01,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968327466] [2019-12-27 04:19:01,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169477373] [2019-12-27 04:19:01,938 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:02,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:19:02,004 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:02,005 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:02,005 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:02,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:02,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:02,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767238217] [2019-12-27 04:19:02,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:02,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:02,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:02,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:02,138 INFO L87 Difference]: Start difference. First operand 2518 states and 9680 transitions. Second operand 24 states. [2019-12-27 04:19:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:05,247 INFO L93 Difference]: Finished difference Result 16308 states and 49886 transitions. [2019-12-27 04:19:05,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-27 04:19:05,247 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:05,271 INFO L225 Difference]: With dead ends: 16308 [2019-12-27 04:19:05,271 INFO L226 Difference]: Without dead ends: 16298 [2019-12-27 04:19:05,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4358 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2157, Invalid=10053, Unknown=0, NotChecked=0, Total=12210 [2019-12-27 04:19:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16298 states. [2019-12-27 04:19:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16298 to 2475. [2019-12-27 04:19:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-12-27 04:19:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 9501 transitions. [2019-12-27 04:19:05,382 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 9501 transitions. Word has length 21 [2019-12-27 04:19:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:05,383 INFO L462 AbstractCegarLoop]: Abstraction has 2475 states and 9501 transitions. [2019-12-27 04:19:05,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 9501 transitions. [2019-12-27 04:19:05,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:05,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:05,384 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:05,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:05,585 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:05,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:05,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1659307204, now seen corresponding path program 15 times [2019-12-27 04:19:05,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:05,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630294178] [2019-12-27 04:19:05,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:05,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630294178] [2019-12-27 04:19:05,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861226586] [2019-12-27 04:19:05,709 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:05,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:19:05,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:05,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:05,773 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:05,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:05,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:05,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544612577] [2019-12-27 04:19:05,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:05,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:05,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:05,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:05,921 INFO L87 Difference]: Start difference. First operand 2475 states and 9501 transitions. Second operand 24 states. [2019-12-27 04:19:09,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:09,668 INFO L93 Difference]: Finished difference Result 18693 states and 58623 transitions. [2019-12-27 04:19:09,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-12-27 04:19:09,669 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:09,704 INFO L225 Difference]: With dead ends: 18693 [2019-12-27 04:19:09,705 INFO L226 Difference]: Without dead ends: 18683 [2019-12-27 04:19:09,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5324 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2478, Invalid=12284, Unknown=0, NotChecked=0, Total=14762 [2019-12-27 04:19:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18683 states. [2019-12-27 04:19:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18683 to 2531. [2019-12-27 04:19:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2531 states. [2019-12-27 04:19:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 9759 transitions. [2019-12-27 04:19:09,840 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 9759 transitions. Word has length 21 [2019-12-27 04:19:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:09,840 INFO L462 AbstractCegarLoop]: Abstraction has 2531 states and 9759 transitions. [2019-12-27 04:19:09,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 9759 transitions. [2019-12-27 04:19:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:09,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:09,841 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:10,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:10,042 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:10,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:10,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1492579422, now seen corresponding path program 16 times [2019-12-27 04:19:10,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:10,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395396899] [2019-12-27 04:19:10,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:10,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395396899] [2019-12-27 04:19:10,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181085424] [2019-12-27 04:19:10,133 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:10,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:19:10,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:10,200 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:10,201 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:10,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:10,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:10,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008665501] [2019-12-27 04:19:10,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:10,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:10,364 INFO L87 Difference]: Start difference. First operand 2531 states and 9759 transitions. Second operand 24 states. [2019-12-27 04:19:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:15,185 INFO L93 Difference]: Finished difference Result 21288 states and 66116 transitions. [2019-12-27 04:19:15,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-12-27 04:19:15,186 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:15,224 INFO L225 Difference]: With dead ends: 21288 [2019-12-27 04:19:15,224 INFO L226 Difference]: Without dead ends: 21284 [2019-12-27 04:19:15,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8454 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3579, Invalid=18473, Unknown=0, NotChecked=0, Total=22052 [2019-12-27 04:19:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21284 states. [2019-12-27 04:19:15,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21284 to 2548. [2019-12-27 04:19:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2019-12-27 04:19:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 9832 transitions. [2019-12-27 04:19:15,388 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 9832 transitions. Word has length 21 [2019-12-27 04:19:15,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:15,388 INFO L462 AbstractCegarLoop]: Abstraction has 2548 states and 9832 transitions. [2019-12-27 04:19:15,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:15,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 9832 transitions. [2019-12-27 04:19:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:15,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:15,389 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:15,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:15,590 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1335167582, now seen corresponding path program 17 times [2019-12-27 04:19:15,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:15,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781993068] [2019-12-27 04:19:15,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:15,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781993068] [2019-12-27 04:19:15,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446587297] [2019-12-27 04:19:15,698 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:15,765 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:19:15,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:15,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:15,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:15,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:15,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:15,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284470006] [2019-12-27 04:19:15,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:15,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:15,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:15,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:15,924 INFO L87 Difference]: Start difference. First operand 2548 states and 9832 transitions. Second operand 24 states. [2019-12-27 04:19:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:18,857 INFO L93 Difference]: Finished difference Result 14142 states and 44431 transitions. [2019-12-27 04:19:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-27 04:19:18,857 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:18,885 INFO L225 Difference]: With dead ends: 14142 [2019-12-27 04:19:18,885 INFO L226 Difference]: Without dead ends: 14130 [2019-12-27 04:19:18,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3087 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1681, Invalid=7439, Unknown=0, NotChecked=0, Total=9120 [2019-12-27 04:19:18,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14130 states. [2019-12-27 04:19:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14130 to 2503. [2019-12-27 04:19:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2503 states. [2019-12-27 04:19:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 9642 transitions. [2019-12-27 04:19:18,994 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 9642 transitions. Word has length 21 [2019-12-27 04:19:18,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:18,995 INFO L462 AbstractCegarLoop]: Abstraction has 2503 states and 9642 transitions. [2019-12-27 04:19:18,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 9642 transitions. [2019-12-27 04:19:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:18,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:18,997 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:19,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:19,200 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -489489332, now seen corresponding path program 18 times [2019-12-27 04:19:19,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:19,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157165512] [2019-12-27 04:19:19,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:19,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157165512] [2019-12-27 04:19:19,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77808650] [2019-12-27 04:19:19,317 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:19,380 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 04:19:19,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:19,380 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:19,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:19,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:19,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:19,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140884671] [2019-12-27 04:19:19,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:19,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:19,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:19,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:19,522 INFO L87 Difference]: Start difference. First operand 2503 states and 9642 transitions. Second operand 24 states. [2019-12-27 04:19:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:24,251 INFO L93 Difference]: Finished difference Result 17125 states and 52678 transitions. [2019-12-27 04:19:24,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-12-27 04:19:24,251 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:24,290 INFO L225 Difference]: With dead ends: 17125 [2019-12-27 04:19:24,291 INFO L226 Difference]: Without dead ends: 17115 [2019-12-27 04:19:24,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6084 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2900, Invalid=14130, Unknown=0, NotChecked=0, Total=17030 [2019-12-27 04:19:24,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17115 states. [2019-12-27 04:19:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17115 to 2513. [2019-12-27 04:19:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-27 04:19:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 9683 transitions. [2019-12-27 04:19:24,414 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 9683 transitions. Word has length 21 [2019-12-27 04:19:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:24,414 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 9683 transitions. [2019-12-27 04:19:24,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 9683 transitions. [2019-12-27 04:19:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:24,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:24,415 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:24,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:24,616 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash 653591338, now seen corresponding path program 19 times [2019-12-27 04:19:24,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:24,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389282010] [2019-12-27 04:19:24,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:24,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389282010] [2019-12-27 04:19:24,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131993673] [2019-12-27 04:19:24,705 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:24,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:24,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:24,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:24,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:24,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109463241] [2019-12-27 04:19:24,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:24,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:24,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:24,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:24,918 INFO L87 Difference]: Start difference. First operand 2513 states and 9683 transitions. Second operand 24 states. [2019-12-27 04:19:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:30,259 INFO L93 Difference]: Finished difference Result 20020 states and 60843 transitions. [2019-12-27 04:19:30,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2019-12-27 04:19:30,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:30,291 INFO L225 Difference]: With dead ends: 20020 [2019-12-27 04:19:30,291 INFO L226 Difference]: Without dead ends: 20012 [2019-12-27 04:19:30,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10655 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4446, Invalid=22944, Unknown=0, NotChecked=0, Total=27390 [2019-12-27 04:19:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20012 states. [2019-12-27 04:19:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20012 to 2553. [2019-12-27 04:19:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 04:19:30,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 9855 transitions. [2019-12-27 04:19:30,431 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 9855 transitions. Word has length 21 [2019-12-27 04:19:30,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:30,432 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 9855 transitions. [2019-12-27 04:19:30,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 9855 transitions. [2019-12-27 04:19:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:30,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:30,433 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:30,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:30,634 INFO L410 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:30,634 INFO L82 PathProgramCache]: Analyzing trace with hash 811003178, now seen corresponding path program 20 times [2019-12-27 04:19:30,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:30,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543582339] [2019-12-27 04:19:30,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:30,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:30,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543582339] [2019-12-27 04:19:30,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633779389] [2019-12-27 04:19:30,726 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:30,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:19:30,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:30,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:30,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:30,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:30,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:30,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99116202] [2019-12-27 04:19:30,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:30,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:30,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:30,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:30,933 INFO L87 Difference]: Start difference. First operand 2553 states and 9855 transitions. Second operand 24 states. [2019-12-27 04:19:34,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:34,172 INFO L93 Difference]: Finished difference Result 12600 states and 38777 transitions. [2019-12-27 04:19:34,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-27 04:19:34,172 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:34,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:34,191 INFO L225 Difference]: With dead ends: 12600 [2019-12-27 04:19:34,191 INFO L226 Difference]: Without dead ends: 12588 [2019-12-27 04:19:34,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3793 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2039, Invalid=9091, Unknown=0, NotChecked=0, Total=11130 [2019-12-27 04:19:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12588 states. [2019-12-27 04:19:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12588 to 2459. [2019-12-27 04:19:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-12-27 04:19:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 9444 transitions. [2019-12-27 04:19:34,290 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 9444 transitions. Word has length 21 [2019-12-27 04:19:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:34,290 INFO L462 AbstractCegarLoop]: Abstraction has 2459 states and 9444 transitions. [2019-12-27 04:19:34,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 9444 transitions. [2019-12-27 04:19:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:34,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:34,292 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:34,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:34,496 INFO L410 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash 255213166, now seen corresponding path program 21 times [2019-12-27 04:19:34,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:34,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301984966] [2019-12-27 04:19:34,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:34,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301984966] [2019-12-27 04:19:34,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062485478] [2019-12-27 04:19:34,594 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:34,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:19:34,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:34,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:34,667 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:34,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:34,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:34,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528878496] [2019-12-27 04:19:34,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:34,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:34,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:34,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:34,820 INFO L87 Difference]: Start difference. First operand 2459 states and 9444 transitions. Second operand 24 states. [2019-12-27 04:19:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:41,262 INFO L93 Difference]: Finished difference Result 18582 states and 55698 transitions. [2019-12-27 04:19:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2019-12-27 04:19:41,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:41,290 INFO L225 Difference]: With dead ends: 18582 [2019-12-27 04:19:41,291 INFO L226 Difference]: Without dead ends: 18575 [2019-12-27 04:19:41,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14530 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5259, Invalid=30273, Unknown=0, NotChecked=0, Total=35532 [2019-12-27 04:19:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18575 states. [2019-12-27 04:19:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18575 to 2434. [2019-12-27 04:19:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2019-12-27 04:19:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9333 transitions. [2019-12-27 04:19:41,419 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9333 transitions. Word has length 21 [2019-12-27 04:19:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:41,420 INFO L462 AbstractCegarLoop]: Abstraction has 2434 states and 9333 transitions. [2019-12-27 04:19:41,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9333 transitions. [2019-12-27 04:19:41,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:41,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:41,421 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:41,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:41,623 INFO L410 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:41,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:41,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1555705676, now seen corresponding path program 22 times [2019-12-27 04:19:41,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:41,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784187224] [2019-12-27 04:19:41,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:41,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784187224] [2019-12-27 04:19:41,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679808117] [2019-12-27 04:19:41,732 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:41,792 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:19:41,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:41,794 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:41,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:41,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:41,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:41,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131254028] [2019-12-27 04:19:41,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:41,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:41,938 INFO L87 Difference]: Start difference. First operand 2434 states and 9333 transitions. Second operand 24 states. [2019-12-27 04:19:46,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:46,054 INFO L93 Difference]: Finished difference Result 13277 states and 40283 transitions. [2019-12-27 04:19:46,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-12-27 04:19:46,055 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:46,073 INFO L225 Difference]: With dead ends: 13277 [2019-12-27 04:19:46,074 INFO L226 Difference]: Without dead ends: 13267 [2019-12-27 04:19:46,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5850 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2692, Invalid=12808, Unknown=0, NotChecked=0, Total=15500 [2019-12-27 04:19:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13267 states. [2019-12-27 04:19:46,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13267 to 2361. [2019-12-27 04:19:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2361 states. [2019-12-27 04:19:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2361 states to 2361 states and 9038 transitions. [2019-12-27 04:19:46,166 INFO L78 Accepts]: Start accepts. Automaton has 2361 states and 9038 transitions. Word has length 21 [2019-12-27 04:19:46,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:46,166 INFO L462 AbstractCegarLoop]: Abstraction has 2361 states and 9038 transitions. [2019-12-27 04:19:46,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2361 states and 9038 transitions. [2019-12-27 04:19:46,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:46,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:46,168 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:46,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:46,368 INFO L410 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:46,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:46,369 INFO L82 PathProgramCache]: Analyzing trace with hash 236779140, now seen corresponding path program 23 times [2019-12-27 04:19:46,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:46,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079064004] [2019-12-27 04:19:46,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:46,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079064004] [2019-12-27 04:19:46,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734497274] [2019-12-27 04:19:46,477 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:46,577 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:19:46,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:46,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:46,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:46,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:46,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:46,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593329117] [2019-12-27 04:19:46,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:46,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:46,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:46,829 INFO L87 Difference]: Start difference. First operand 2361 states and 9038 transitions. Second operand 24 states. [2019-12-27 04:19:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:53,285 INFO L93 Difference]: Finished difference Result 23694 states and 71543 transitions. [2019-12-27 04:19:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-12-27 04:19:53,285 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:19:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:53,327 INFO L225 Difference]: With dead ends: 23694 [2019-12-27 04:19:53,328 INFO L226 Difference]: Without dead ends: 23685 [2019-12-27 04:19:53,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16133 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6860, Invalid=32146, Unknown=0, NotChecked=0, Total=39006 [2019-12-27 04:19:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23685 states. [2019-12-27 04:19:53,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23685 to 2337. [2019-12-27 04:19:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-12-27 04:19:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 8931 transitions. [2019-12-27 04:19:53,496 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 8931 transitions. Word has length 21 [2019-12-27 04:19:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:53,496 INFO L462 AbstractCegarLoop]: Abstraction has 2337 states and 8931 transitions. [2019-12-27 04:19:53,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:19:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 8931 transitions. [2019-12-27 04:19:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:53,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:53,498 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:53,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:53,698 INFO L410 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash -337889250, now seen corresponding path program 24 times [2019-12-27 04:19:53,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:53,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65459132] [2019-12-27 04:19:53,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:53,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65459132] [2019-12-27 04:19:53,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159353539] [2019-12-27 04:19:53,776 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:53,840 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 04:19:53,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:19:53,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:53,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:54,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:54,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 04:19:54,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422221967] [2019-12-27 04:19:54,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:19:54,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:19:54,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:19:54,004 INFO L87 Difference]: Start difference. First operand 2337 states and 8931 transitions. Second operand 23 states. [2019-12-27 04:19:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:19:57,980 INFO L93 Difference]: Finished difference Result 11571 states and 34108 transitions. [2019-12-27 04:19:57,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-27 04:19:57,981 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-27 04:19:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:19:57,998 INFO L225 Difference]: With dead ends: 11571 [2019-12-27 04:19:57,998 INFO L226 Difference]: Without dead ends: 11566 [2019-12-27 04:19:57,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6899 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2919, Invalid=14903, Unknown=0, NotChecked=0, Total=17822 [2019-12-27 04:19:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11566 states. [2019-12-27 04:19:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11566 to 2335. [2019-12-27 04:19:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-27 04:19:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 8925 transitions. [2019-12-27 04:19:58,083 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 8925 transitions. Word has length 21 [2019-12-27 04:19:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:19:58,084 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 8925 transitions. [2019-12-27 04:19:58,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:19:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 8925 transitions. [2019-12-27 04:19:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:19:58,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:19:58,085 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:19:58,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:58,286 INFO L410 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:19:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:19:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash 621224380, now seen corresponding path program 25 times [2019-12-27 04:19:58,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:19:58,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211258494] [2019-12-27 04:19:58,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:19:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:58,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211258494] [2019-12-27 04:19:58,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478076737] [2019-12-27 04:19:58,379 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:19:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:19:58,449 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:19:58,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:19:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:19:58,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:19:58,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:19:58,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347307707] [2019-12-27 04:19:58,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:19:58,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:19:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:19:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:19:58,601 INFO L87 Difference]: Start difference. First operand 2335 states and 8925 transitions. Second operand 24 states. [2019-12-27 04:20:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:04,144 INFO L93 Difference]: Finished difference Result 24068 states and 75584 transitions. [2019-12-27 04:20:04,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2019-12-27 04:20:04,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:04,198 INFO L225 Difference]: With dead ends: 24068 [2019-12-27 04:20:04,198 INFO L226 Difference]: Without dead ends: 24061 [2019-12-27 04:20:04,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10912 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5105, Invalid=23287, Unknown=0, NotChecked=0, Total=28392 [2019-12-27 04:20:04,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24061 states. [2019-12-27 04:20:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24061 to 2331. [2019-12-27 04:20:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2331 states. [2019-12-27 04:20:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2331 states to 2331 states and 8915 transitions. [2019-12-27 04:20:04,368 INFO L78 Accepts]: Start accepts. Automaton has 2331 states and 8915 transitions. Word has length 21 [2019-12-27 04:20:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:04,368 INFO L462 AbstractCegarLoop]: Abstraction has 2331 states and 8915 transitions. [2019-12-27 04:20:04,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2331 states and 8915 transitions. [2019-12-27 04:20:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:04,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:04,370 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:04,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:04,573 INFO L410 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 621819580, now seen corresponding path program 26 times [2019-12-27 04:20:04,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:04,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85604224] [2019-12-27 04:20:04,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85604224] [2019-12-27 04:20:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459786093] [2019-12-27 04:20:04,680 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:04,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:20:04,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:04,740 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:04,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:04,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:04,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:04,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986139015] [2019-12-27 04:20:04,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:04,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:04,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:04,908 INFO L87 Difference]: Start difference. First operand 2331 states and 8915 transitions. Second operand 24 states. [2019-12-27 04:20:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:10,284 INFO L93 Difference]: Finished difference Result 22747 states and 71581 transitions. [2019-12-27 04:20:10,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-12-27 04:20:10,285 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:10,768 INFO L225 Difference]: With dead ends: 22747 [2019-12-27 04:20:10,769 INFO L226 Difference]: Without dead ends: 22738 [2019-12-27 04:20:10,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9659 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4688, Invalid=21072, Unknown=0, NotChecked=0, Total=25760 [2019-12-27 04:20:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22738 states. [2019-12-27 04:20:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22738 to 2248. [2019-12-27 04:20:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2248 states. [2019-12-27 04:20:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2248 states to 2248 states and 8554 transitions. [2019-12-27 04:20:10,906 INFO L78 Accepts]: Start accepts. Automaton has 2248 states and 8554 transitions. Word has length 21 [2019-12-27 04:20:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:10,906 INFO L462 AbstractCegarLoop]: Abstraction has 2248 states and 8554 transitions. [2019-12-27 04:20:10,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2248 states and 8554 transitions. [2019-12-27 04:20:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:10,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:10,908 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:11,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:11,109 INFO L410 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:11,109 INFO L82 PathProgramCache]: Analyzing trace with hash -389879526, now seen corresponding path program 27 times [2019-12-27 04:20:11,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:11,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254616316] [2019-12-27 04:20:11,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:11,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254616316] [2019-12-27 04:20:11,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618321845] [2019-12-27 04:20:11,223 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:11,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:20:11,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:11,291 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:11,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:11,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:11,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:11,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663782286] [2019-12-27 04:20:11,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:11,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:11,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:11,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:11,444 INFO L87 Difference]: Start difference. First operand 2248 states and 8554 transitions. Second operand 24 states. [2019-12-27 04:20:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:15,171 INFO L93 Difference]: Finished difference Result 14023 states and 42219 transitions. [2019-12-27 04:20:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-27 04:20:15,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:15,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:15,194 INFO L225 Difference]: With dead ends: 14023 [2019-12-27 04:20:15,194 INFO L226 Difference]: Without dead ends: 14017 [2019-12-27 04:20:15,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5584 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2666, Invalid=13084, Unknown=0, NotChecked=0, Total=15750 [2019-12-27 04:20:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14017 states. [2019-12-27 04:20:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14017 to 2267. [2019-12-27 04:20:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 04:20:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8634 transitions. [2019-12-27 04:20:15,302 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8634 transitions. Word has length 21 [2019-12-27 04:20:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:15,302 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8634 transitions. [2019-12-27 04:20:15,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8634 transitions. [2019-12-27 04:20:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:15,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:15,303 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:15,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:15,504 INFO L410 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:15,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -389284326, now seen corresponding path program 28 times [2019-12-27 04:20:15,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:15,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562761837] [2019-12-27 04:20:15,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:15,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562761837] [2019-12-27 04:20:15,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147813950] [2019-12-27 04:20:15,599 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:15,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:20:15,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:15,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:15,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:15,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:15,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:15,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622411505] [2019-12-27 04:20:15,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:15,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:15,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:15,835 INFO L87 Difference]: Start difference. First operand 2267 states and 8634 transitions. Second operand 24 states. [2019-12-27 04:20:19,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:19,069 INFO L93 Difference]: Finished difference Result 12677 states and 38921 transitions. [2019-12-27 04:20:19,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-27 04:20:19,069 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:19,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:19,088 INFO L225 Difference]: With dead ends: 12677 [2019-12-27 04:20:19,088 INFO L226 Difference]: Without dead ends: 12670 [2019-12-27 04:20:19,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2101, Invalid=9455, Unknown=0, NotChecked=0, Total=11556 [2019-12-27 04:20:19,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12670 states. [2019-12-27 04:20:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12670 to 2249. [2019-12-27 04:20:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2019-12-27 04:20:19,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 8557 transitions. [2019-12-27 04:20:19,177 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 8557 transitions. Word has length 21 [2019-12-27 04:20:19,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:19,177 INFO L462 AbstractCegarLoop]: Abstraction has 2249 states and 8557 transitions. [2019-12-27 04:20:19,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:19,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 8557 transitions. [2019-12-27 04:20:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:19,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:19,178 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:19,378 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:19,379 INFO L410 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:19,379 INFO L82 PathProgramCache]: Analyzing trace with hash 141601306, now seen corresponding path program 29 times [2019-12-27 04:20:19,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:19,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310839100] [2019-12-27 04:20:19,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:19,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310839100] [2019-12-27 04:20:19,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219948550] [2019-12-27 04:20:19,478 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:19,541 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:20:19,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:19,543 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:19,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:19,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:19,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:19,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552728027] [2019-12-27 04:20:19,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:19,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:19,688 INFO L87 Difference]: Start difference. First operand 2249 states and 8557 transitions. Second operand 24 states. [2019-12-27 04:20:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:25,311 INFO L93 Difference]: Finished difference Result 17894 states and 53668 transitions. [2019-12-27 04:20:25,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-12-27 04:20:25,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:25,339 INFO L225 Difference]: With dead ends: 17894 [2019-12-27 04:20:25,340 INFO L226 Difference]: Without dead ends: 17883 [2019-12-27 04:20:25,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10760 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4487, Invalid=23569, Unknown=0, NotChecked=0, Total=28056 [2019-12-27 04:20:25,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17883 states. [2019-12-27 04:20:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17883 to 2288. [2019-12-27 04:20:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2288 states. [2019-12-27 04:20:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 8718 transitions. [2019-12-27 04:20:25,464 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 8718 transitions. Word has length 21 [2019-12-27 04:20:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:25,464 INFO L462 AbstractCegarLoop]: Abstraction has 2288 states and 8718 transitions. [2019-12-27 04:20:25,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 8718 transitions. [2019-12-27 04:20:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:25,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:25,466 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:25,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:25,668 INFO L410 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1879284522, now seen corresponding path program 30 times [2019-12-27 04:20:25,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:25,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206069476] [2019-12-27 04:20:25,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:25,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206069476] [2019-12-27 04:20:25,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201824044] [2019-12-27 04:20:25,799 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:25,864 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 04:20:25,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:25,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:25,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:26,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:26,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:26,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297146926] [2019-12-27 04:20:26,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:26,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:26,012 INFO L87 Difference]: Start difference. First operand 2288 states and 8718 transitions. Second operand 24 states. [2019-12-27 04:20:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:31,003 INFO L93 Difference]: Finished difference Result 14223 states and 42268 transitions. [2019-12-27 04:20:31,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2019-12-27 04:20:31,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:31,023 INFO L225 Difference]: With dead ends: 14223 [2019-12-27 04:20:31,023 INFO L226 Difference]: Without dead ends: 14214 [2019-12-27 04:20:31,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8336 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3428, Invalid=18034, Unknown=0, NotChecked=0, Total=21462 [2019-12-27 04:20:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2019-12-27 04:20:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 2295. [2019-12-27 04:20:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2019-12-27 04:20:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 8743 transitions. [2019-12-27 04:20:31,120 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 8743 transitions. Word has length 21 [2019-12-27 04:20:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:31,121 INFO L462 AbstractCegarLoop]: Abstraction has 2295 states and 8743 transitions. [2019-12-27 04:20:31,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 8743 transitions. [2019-12-27 04:20:31,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:31,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:31,122 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:31,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:31,323 INFO L410 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:31,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1878689322, now seen corresponding path program 31 times [2019-12-27 04:20:31,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:31,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939551399] [2019-12-27 04:20:31,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:31,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939551399] [2019-12-27 04:20:31,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21549893] [2019-12-27 04:20:31,410 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:31,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:31,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:31,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:31,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:31,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74210159] [2019-12-27 04:20:31,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:31,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:31,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:31,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:31,647 INFO L87 Difference]: Start difference. First operand 2295 states and 8743 transitions. Second operand 24 states. [2019-12-27 04:20:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:35,721 INFO L93 Difference]: Finished difference Result 13463 states and 40671 transitions. [2019-12-27 04:20:35,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-12-27 04:20:35,721 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:35,742 INFO L225 Difference]: With dead ends: 13463 [2019-12-27 04:20:35,742 INFO L226 Difference]: Without dead ends: 13453 [2019-12-27 04:20:35,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5880 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2757, Invalid=13245, Unknown=0, NotChecked=0, Total=16002 [2019-12-27 04:20:35,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13453 states. [2019-12-27 04:20:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13453 to 2277. [2019-12-27 04:20:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2277 states. [2019-12-27 04:20:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 8666 transitions. [2019-12-27 04:20:35,839 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 8666 transitions. Word has length 21 [2019-12-27 04:20:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:35,839 INFO L462 AbstractCegarLoop]: Abstraction has 2277 states and 8666 transitions. [2019-12-27 04:20:35,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 8666 transitions. [2019-12-27 04:20:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:35,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:35,841 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:36,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:36,041 INFO L410 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:36,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:36,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1783527146, now seen corresponding path program 32 times [2019-12-27 04:20:36,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:36,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333602921] [2019-12-27 04:20:36,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:36,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333602921] [2019-12-27 04:20:36,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218332344] [2019-12-27 04:20:36,123 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:36,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:20:36,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:36,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:36,190 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:36,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:36,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:36,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348187975] [2019-12-27 04:20:36,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:36,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:36,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:36,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:36,344 INFO L87 Difference]: Start difference. First operand 2277 states and 8666 transitions. Second operand 24 states. [2019-12-27 04:20:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:43,013 INFO L93 Difference]: Finished difference Result 16514 states and 48887 transitions. [2019-12-27 04:20:43,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2019-12-27 04:20:43,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:43,041 INFO L225 Difference]: With dead ends: 16514 [2019-12-27 04:20:43,041 INFO L226 Difference]: Without dead ends: 16507 [2019-12-27 04:20:43,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13770 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5147, Invalid=29263, Unknown=0, NotChecked=0, Total=34410 [2019-12-27 04:20:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16507 states. [2019-12-27 04:20:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16507 to 2251. [2019-12-27 04:20:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2019-12-27 04:20:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 8560 transitions. [2019-12-27 04:20:43,219 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 8560 transitions. Word has length 21 [2019-12-27 04:20:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:43,220 INFO L462 AbstractCegarLoop]: Abstraction has 2251 states and 8560 transitions. [2019-12-27 04:20:43,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 8560 transitions. [2019-12-27 04:20:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:43,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:43,221 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:43,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:43,422 INFO L410 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash -474063010, now seen corresponding path program 33 times [2019-12-27 04:20:43,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:43,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027266819] [2019-12-27 04:20:43,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:43,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027266819] [2019-12-27 04:20:43,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592587001] [2019-12-27 04:20:43,510 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:43,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:20:43,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:43,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:43,594 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:43,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:43,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 04:20:43,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457371980] [2019-12-27 04:20:43,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:20:43,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:43,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:20:43,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:20:43,768 INFO L87 Difference]: Start difference. First operand 2251 states and 8560 transitions. Second operand 23 states. [2019-12-27 04:20:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:47,956 INFO L93 Difference]: Finished difference Result 10482 states and 30730 transitions. [2019-12-27 04:20:47,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-12-27 04:20:47,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-27 04:20:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:47,970 INFO L225 Difference]: With dead ends: 10482 [2019-12-27 04:20:47,970 INFO L226 Difference]: Without dead ends: 10477 [2019-12-27 04:20:47,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6783 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2908, Invalid=15182, Unknown=0, NotChecked=0, Total=18090 [2019-12-27 04:20:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2019-12-27 04:20:48,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 2253. [2019-12-27 04:20:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2253 states. [2019-12-27 04:20:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2253 states to 2253 states and 8566 transitions. [2019-12-27 04:20:48,041 INFO L78 Accepts]: Start accepts. Automaton has 2253 states and 8566 transitions. Word has length 21 [2019-12-27 04:20:48,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:48,041 INFO L462 AbstractCegarLoop]: Abstraction has 2253 states and 8566 transitions. [2019-12-27 04:20:48,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:20:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2253 states and 8566 transitions. [2019-12-27 04:20:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:48,043 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:48,043 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:48,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:48,243 INFO L410 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash 384811520, now seen corresponding path program 34 times [2019-12-27 04:20:48,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:48,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882284123] [2019-12-27 04:20:48,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:48,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882284123] [2019-12-27 04:20:48,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745468028] [2019-12-27 04:20:48,333 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:48,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:20:48,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:48,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:48,400 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:48,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:48,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 04:20:48,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097019565] [2019-12-27 04:20:48,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:20:48,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:20:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:20:48,544 INFO L87 Difference]: Start difference. First operand 2253 states and 8566 transitions. Second operand 23 states. [2019-12-27 04:20:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:52,652 INFO L93 Difference]: Finished difference Result 10560 states and 31108 transitions. [2019-12-27 04:20:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-12-27 04:20:52,652 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-27 04:20:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:52,666 INFO L225 Difference]: With dead ends: 10560 [2019-12-27 04:20:52,666 INFO L226 Difference]: Without dead ends: 10554 [2019-12-27 04:20:52,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6240 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2677, Invalid=13835, Unknown=0, NotChecked=0, Total=16512 [2019-12-27 04:20:52,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2019-12-27 04:20:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 2232. [2019-12-27 04:20:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2232 states. [2019-12-27 04:20:52,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 8512 transitions. [2019-12-27 04:20:52,743 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 8512 transitions. Word has length 21 [2019-12-27 04:20:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:52,743 INFO L462 AbstractCegarLoop]: Abstraction has 2232 states and 8512 transitions. [2019-12-27 04:20:52,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:20:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 8512 transitions. [2019-12-27 04:20:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:20:52,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:52,745 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:52,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:52,945 INFO L410 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:52,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:52,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1841771060, now seen corresponding path program 35 times [2019-12-27 04:20:52,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:52,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820404834] [2019-12-27 04:20:52,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:20:53,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:53,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820404834] [2019-12-27 04:20:53,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565534658] [2019-12-27 04:20:53,030 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:53,095 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 04:20:53,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:20:53,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:20:53,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:20:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:20:53,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:20:53,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:20:53,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454106561] [2019-12-27 04:20:53,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:20:53,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:20:53,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:20:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:20:53,252 INFO L87 Difference]: Start difference. First operand 2232 states and 8512 transitions. Second operand 24 states. [2019-12-27 04:20:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:20:57,434 INFO L93 Difference]: Finished difference Result 12790 states and 38778 transitions. [2019-12-27 04:20:57,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-27 04:20:57,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:20:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:20:57,453 INFO L225 Difference]: With dead ends: 12790 [2019-12-27 04:20:57,454 INFO L226 Difference]: Without dead ends: 12780 [2019-12-27 04:20:57,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6264 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2803, Invalid=13967, Unknown=0, NotChecked=0, Total=16770 [2019-12-27 04:20:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12780 states. [2019-12-27 04:20:57,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12780 to 2115. [2019-12-27 04:20:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-12-27 04:20:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 8089 transitions. [2019-12-27 04:20:57,548 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 8089 transitions. Word has length 21 [2019-12-27 04:20:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:20:57,548 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 8089 transitions. [2019-12-27 04:20:57,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:20:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 8089 transitions. [2019-12-27 04:20:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:20:57,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:20:57,549 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:20:57,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:20:57,750 INFO L410 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:20:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:20:57,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1316541292, now seen corresponding path program 1 times [2019-12-27 04:20:57,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:20:57,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838835155] [2019-12-27 04:20:57,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:20:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:20:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:20:57,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:20:57,769 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:20:57,769 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:20:57,769 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 04:20:57,785 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,785 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,785 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,786 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,786 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,786 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,786 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,786 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,786 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,786 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,787 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,788 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,789 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,790 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,791 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,791 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,791 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,791 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,791 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,793 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,793 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,794 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,794 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,795 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,795 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,795 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,796 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,796 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,797 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,797 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,798 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,798 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,798 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,799 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,800 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,801 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,801 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,801 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,801 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,802 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,803 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,803 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,803 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,803 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,803 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,804 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,805 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,805 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,805 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,805 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,806 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,806 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,806 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,807 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,807 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,808 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,808 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,808 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,808 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,809 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,809 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,809 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,809 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,810 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,810 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,810 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,810 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,811 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,811 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,811 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,811 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,811 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,811 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,812 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,812 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,812 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,812 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,812 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,812 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,813 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,813 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,813 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,814 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,814 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:20:57,814 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 04:20:57,815 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:20:57,815 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:20:57,815 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:20:57,815 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:20:57,815 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:20:57,815 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:20:57,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:20:57,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:20:57,818 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 128 transitions [2019-12-27 04:20:57,818 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-27 04:20:57,838 INFO L132 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-27 04:20:57,838 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 04:20:57,841 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-27 04:20:57,848 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 144 places, 128 transitions [2019-12-27 04:20:57,868 INFO L132 PetriNetUnfolder]: 7/154 cut-off events. [2019-12-27 04:20:57,868 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 04:20:57,871 INFO L76 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 154 events. 7/154 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 281 event pairs. 0/140 useless extension candidates. Maximal degree in co-relation 181. Up to 12 conditions per place. [2019-12-27 04:20:57,878 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-27 04:20:57,878 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:20:59,944 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-27 04:21:00,040 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3419 [2019-12-27 04:21:00,040 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 04:21:00,040 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 04:21:00,373 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 04:21:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 04:21:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:21:00,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:00,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:21:00,373 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:00,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1051879, now seen corresponding path program 1 times [2019-12-27 04:21:00,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:00,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66683678] [2019-12-27 04:21:00,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:00,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66683678] [2019-12-27 04:21:00,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:21:00,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:21:00,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103987286] [2019-12-27 04:21:00,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:21:00,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:00,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:21:00,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:21:00,398 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 04:21:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:00,465 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 04:21:00,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:21:00,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:21:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:00,483 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 04:21:00,483 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 04:21:00,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:21:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 04:21:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 04:21:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 04:21:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 04:21:00,583 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 04:21:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:00,583 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 04:21:00,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:21:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 04:21:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:21:00,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:00,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:00,584 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:00,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:00,584 INFO L82 PathProgramCache]: Analyzing trace with hash -598137854, now seen corresponding path program 1 times [2019-12-27 04:21:00,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:00,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093255120] [2019-12-27 04:21:00,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:00,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:00,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093255120] [2019-12-27 04:21:00,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:21:00,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:21:00,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056340067] [2019-12-27 04:21:00,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:21:00,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:00,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:21:00,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:21:00,611 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 04:21:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:00,755 INFO L93 Difference]: Finished difference Result 11058 states and 45915 transitions. [2019-12-27 04:21:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:21:00,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:21:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:00,779 INFO L225 Difference]: With dead ends: 11058 [2019-12-27 04:21:00,779 INFO L226 Difference]: Without dead ends: 11055 [2019-12-27 04:21:00,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:21:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2019-12-27 04:21:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 6120. [2019-12-27 04:21:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 04:21:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 04:21:01,058 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 04:21:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:01,059 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 04:21:01,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:21:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 04:21:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:21:01,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:01,059 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:01,060 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:01,060 INFO L82 PathProgramCache]: Analyzing trace with hash 63286460, now seen corresponding path program 1 times [2019-12-27 04:21:01,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:01,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779812064] [2019-12-27 04:21:01,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:21:01,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779812064] [2019-12-27 04:21:01,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:21:01,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:21:01,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519354305] [2019-12-27 04:21:01,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:21:01,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:01,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:21:01,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:21:01,102 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 04:21:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:01,254 INFO L93 Difference]: Finished difference Result 12424 states and 52328 transitions. [2019-12-27 04:21:01,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:21:01,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:21:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:01,282 INFO L225 Difference]: With dead ends: 12424 [2019-12-27 04:21:01,282 INFO L226 Difference]: Without dead ends: 12420 [2019-12-27 04:21:01,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:21:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12420 states. [2019-12-27 04:21:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12420 to 7145. [2019-12-27 04:21:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 04:21:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 04:21:01,453 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 04:21:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:01,453 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 04:21:01,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:21:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 04:21:01,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:21:01,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:01,453 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:01,454 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:01,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:01,454 INFO L82 PathProgramCache]: Analyzing trace with hash -697924765, now seen corresponding path program 1 times [2019-12-27 04:21:01,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:01,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737541752] [2019-12-27 04:21:01,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:01,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737541752] [2019-12-27 04:21:01,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293123493] [2019-12-27 04:21:01,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:01,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:21:01,597 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:01,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:01,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:21:01,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242360299] [2019-12-27 04:21:01,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:21:01,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:01,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:21:01,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:21:01,691 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 18 states. [2019-12-27 04:21:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:02,766 INFO L93 Difference]: Finished difference Result 22393 states and 85334 transitions. [2019-12-27 04:21:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:21:02,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:21:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:02,813 INFO L225 Difference]: With dead ends: 22393 [2019-12-27 04:21:02,813 INFO L226 Difference]: Without dead ends: 22388 [2019-12-27 04:21:02,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=1430, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 04:21:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22388 states. [2019-12-27 04:21:03,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22388 to 7191. [2019-12-27 04:21:03,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7191 states. [2019-12-27 04:21:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7191 states to 7191 states and 33225 transitions. [2019-12-27 04:21:03,060 INFO L78 Accepts]: Start accepts. Automaton has 7191 states and 33225 transitions. Word has length 15 [2019-12-27 04:21:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:03,060 INFO L462 AbstractCegarLoop]: Abstraction has 7191 states and 33225 transitions. [2019-12-27 04:21:03,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:21:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 7191 states and 33225 transitions. [2019-12-27 04:21:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:21:03,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:03,061 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:03,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:03,262 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:03,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash 688753653, now seen corresponding path program 2 times [2019-12-27 04:21:03,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:03,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183409282] [2019-12-27 04:21:03,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:03,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183409282] [2019-12-27 04:21:03,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738250310] [2019-12-27 04:21:03,325 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:03,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:21:03,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:21:03,397 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:21:03,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:03,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:03,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:03,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2019-12-27 04:21:03,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718798622] [2019-12-27 04:21:03,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 04:21:03,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:03,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 04:21:03,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:21:03,507 INFO L87 Difference]: Start difference. First operand 7191 states and 33225 transitions. Second operand 18 states. [2019-12-27 04:21:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:04,715 INFO L93 Difference]: Finished difference Result 28893 states and 112630 transitions. [2019-12-27 04:21:04,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:21:04,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-12-27 04:21:04,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:04,783 INFO L225 Difference]: With dead ends: 28893 [2019-12-27 04:21:04,783 INFO L226 Difference]: Without dead ends: 28888 [2019-12-27 04:21:04,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1267, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:21:04,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28888 states. [2019-12-27 04:21:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28888 to 6960. [2019-12-27 04:21:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6960 states. [2019-12-27 04:21:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6960 states to 6960 states and 32150 transitions. [2019-12-27 04:21:05,080 INFO L78 Accepts]: Start accepts. Automaton has 6960 states and 32150 transitions. Word has length 15 [2019-12-27 04:21:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:05,081 INFO L462 AbstractCegarLoop]: Abstraction has 6960 states and 32150 transitions. [2019-12-27 04:21:05,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 04:21:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6960 states and 32150 transitions. [2019-12-27 04:21:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:21:05,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:05,081 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:05,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:05,282 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:05,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1133625120, now seen corresponding path program 1 times [2019-12-27 04:21:05,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:05,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618744796] [2019-12-27 04:21:05,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:21:05,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618744796] [2019-12-27 04:21:05,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:21:05,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:21:05,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616820732] [2019-12-27 04:21:05,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:21:05,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:21:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:21:05,311 INFO L87 Difference]: Start difference. First operand 6960 states and 32150 transitions. Second operand 5 states. [2019-12-27 04:21:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:05,482 INFO L93 Difference]: Finished difference Result 13762 states and 58788 transitions. [2019-12-27 04:21:05,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:21:05,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 04:21:05,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:05,513 INFO L225 Difference]: With dead ends: 13762 [2019-12-27 04:21:05,513 INFO L226 Difference]: Without dead ends: 13754 [2019-12-27 04:21:05,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:21:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13754 states. [2019-12-27 04:21:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13754 to 8211. [2019-12-27 04:21:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8211 states. [2019-12-27 04:21:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8211 states to 8211 states and 38231 transitions. [2019-12-27 04:21:05,704 INFO L78 Accepts]: Start accepts. Automaton has 8211 states and 38231 transitions. Word has length 17 [2019-12-27 04:21:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:05,705 INFO L462 AbstractCegarLoop]: Abstraction has 8211 states and 38231 transitions. [2019-12-27 04:21:05,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:21:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 8211 states and 38231 transitions. [2019-12-27 04:21:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:21:05,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:05,705 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:05,705 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:05,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:05,706 INFO L82 PathProgramCache]: Analyzing trace with hash 266693639, now seen corresponding path program 1 times [2019-12-27 04:21:05,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:05,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603229136] [2019-12-27 04:21:05,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:05,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603229136] [2019-12-27 04:21:05,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821977227] [2019-12-27 04:21:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:05,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:21:05,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:06,008 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:06,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:06,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:21:06,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653848242] [2019-12-27 04:21:06,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:21:06,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:21:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:21:06,010 INFO L87 Difference]: Start difference. First operand 8211 states and 38231 transitions. Second operand 20 states. [2019-12-27 04:21:07,186 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 04:21:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:07,762 INFO L93 Difference]: Finished difference Result 22564 states and 89916 transitions. [2019-12-27 04:21:07,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 04:21:07,763 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:21:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:07,810 INFO L225 Difference]: With dead ends: 22564 [2019-12-27 04:21:07,810 INFO L226 Difference]: Without dead ends: 22557 [2019-12-27 04:21:07,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=521, Invalid=2029, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 04:21:07,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22557 states. [2019-12-27 04:21:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22557 to 8273. [2019-12-27 04:21:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8273 states. [2019-12-27 04:21:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8273 states to 8273 states and 38415 transitions. [2019-12-27 04:21:08,078 INFO L78 Accepts]: Start accepts. Automaton has 8273 states and 38415 transitions. Word has length 19 [2019-12-27 04:21:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:08,078 INFO L462 AbstractCegarLoop]: Abstraction has 8273 states and 38415 transitions. [2019-12-27 04:21:08,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:21:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8273 states and 38415 transitions. [2019-12-27 04:21:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:21:08,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:08,079 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:08,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:08,281 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:08,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:08,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1890641739, now seen corresponding path program 1 times [2019-12-27 04:21:08,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:08,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967474769] [2019-12-27 04:21:08,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:08,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967474769] [2019-12-27 04:21:08,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048053827] [2019-12-27 04:21:08,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:08,418 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 04:21:08,418 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:08,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:08,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2019-12-27 04:21:08,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121828582] [2019-12-27 04:21:08,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 04:21:08,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 04:21:08,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:21:08,524 INFO L87 Difference]: Start difference. First operand 8273 states and 38415 transitions. Second operand 20 states. [2019-12-27 04:21:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:09,742 INFO L93 Difference]: Finished difference Result 24099 states and 95744 transitions. [2019-12-27 04:21:09,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 04:21:09,743 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-12-27 04:21:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:09,793 INFO L225 Difference]: With dead ends: 24099 [2019-12-27 04:21:09,793 INFO L226 Difference]: Without dead ends: 24089 [2019-12-27 04:21:09,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=484, Invalid=1678, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 04:21:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24089 states. [2019-12-27 04:21:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24089 to 8359. [2019-12-27 04:21:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8359 states. [2019-12-27 04:21:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8359 states to 8359 states and 38734 transitions. [2019-12-27 04:21:10,058 INFO L78 Accepts]: Start accepts. Automaton has 8359 states and 38734 transitions. Word has length 19 [2019-12-27 04:21:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:10,059 INFO L462 AbstractCegarLoop]: Abstraction has 8359 states and 38734 transitions. [2019-12-27 04:21:10,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 04:21:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 8359 states and 38734 transitions. [2019-12-27 04:21:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:21:10,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:10,060 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:10,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:10,262 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:10,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:10,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1507971637, now seen corresponding path program 2 times [2019-12-27 04:21:10,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:10,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821131867] [2019-12-27 04:21:10,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:10,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821131867] [2019-12-27 04:21:10,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412433039] [2019-12-27 04:21:10,361 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:10,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:21:10,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:21:10,625 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:21:10,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 04:21:10,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:10,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 04:21:10,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44089743] [2019-12-27 04:21:10,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:21:10,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:10,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:21:10,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:21:10,728 INFO L87 Difference]: Start difference. First operand 8359 states and 38734 transitions. Second operand 19 states. [2019-12-27 04:21:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:11,724 INFO L93 Difference]: Finished difference Result 19471 states and 79365 transitions. [2019-12-27 04:21:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:21:11,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-27 04:21:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:11,767 INFO L225 Difference]: With dead ends: 19471 [2019-12-27 04:21:11,767 INFO L226 Difference]: Without dead ends: 19464 [2019-12-27 04:21:11,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:21:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19464 states. [2019-12-27 04:21:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19464 to 8266. [2019-12-27 04:21:11,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8266 states. [2019-12-27 04:21:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8266 states to 8266 states and 38293 transitions. [2019-12-27 04:21:12,002 INFO L78 Accepts]: Start accepts. Automaton has 8266 states and 38293 transitions. Word has length 19 [2019-12-27 04:21:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:12,002 INFO L462 AbstractCegarLoop]: Abstraction has 8266 states and 38293 transitions. [2019-12-27 04:21:12,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:21:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 8266 states and 38293 transitions. [2019-12-27 04:21:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:21:12,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:12,003 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:12,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:12,204 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:12,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:12,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1507960601, now seen corresponding path program 2 times [2019-12-27 04:21:12,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:12,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382999188] [2019-12-27 04:21:12,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:12,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382999188] [2019-12-27 04:21:12,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150058995] [2019-12-27 04:21:12,275 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:12,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:21:12,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:21:12,351 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:21:12,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 04:21:12,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:12,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2019-12-27 04:21:12,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540527894] [2019-12-27 04:21:12,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 04:21:12,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:12,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 04:21:12,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-12-27 04:21:12,450 INFO L87 Difference]: Start difference. First operand 8266 states and 38293 transitions. Second operand 19 states. [2019-12-27 04:21:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:13,288 INFO L93 Difference]: Finished difference Result 22340 states and 93099 transitions. [2019-12-27 04:21:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:21:13,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-27 04:21:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:13,338 INFO L225 Difference]: With dead ends: 22340 [2019-12-27 04:21:13,339 INFO L226 Difference]: Without dead ends: 22331 [2019-12-27 04:21:13,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:21:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22331 states. [2019-12-27 04:21:13,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22331 to 8151. [2019-12-27 04:21:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8151 states. [2019-12-27 04:21:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8151 states to 8151 states and 37770 transitions. [2019-12-27 04:21:13,611 INFO L78 Accepts]: Start accepts. Automaton has 8151 states and 37770 transitions. Word has length 19 [2019-12-27 04:21:13,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:13,611 INFO L462 AbstractCegarLoop]: Abstraction has 8151 states and 37770 transitions. [2019-12-27 04:21:13,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 04:21:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8151 states and 37770 transitions. [2019-12-27 04:21:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:21:13,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:13,612 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:13,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:13,813 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:13,813 INFO L82 PathProgramCache]: Analyzing trace with hash -509077988, now seen corresponding path program 1 times [2019-12-27 04:21:13,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:13,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138396098] [2019-12-27 04:21:13,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 04:21:13,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138396098] [2019-12-27 04:21:13,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136497294] [2019-12-27 04:21:13,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:13,963 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:21:13,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:14,769 WARN L192 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 04:21:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:14,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:14,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 04:21:14,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605554142] [2019-12-27 04:21:14,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:21:14,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:21:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:21:14,787 INFO L87 Difference]: Start difference. First operand 8151 states and 37770 transitions. Second operand 23 states. [2019-12-27 04:21:20,568 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-12-27 04:21:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:20,636 INFO L93 Difference]: Finished difference Result 48884 states and 174143 transitions. [2019-12-27 04:21:20,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-12-27 04:21:20,637 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-12-27 04:21:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:20,733 INFO L225 Difference]: With dead ends: 48884 [2019-12-27 04:21:20,734 INFO L226 Difference]: Without dead ends: 48852 [2019-12-27 04:21:20,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8136 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3170, Invalid=17710, Unknown=0, NotChecked=0, Total=20880 [2019-12-27 04:21:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48852 states. [2019-12-27 04:21:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48852 to 8509. [2019-12-27 04:21:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8509 states. [2019-12-27 04:21:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 39545 transitions. [2019-12-27 04:21:21,168 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 39545 transitions. Word has length 21 [2019-12-27 04:21:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:21,168 INFO L462 AbstractCegarLoop]: Abstraction has 8509 states and 39545 transitions. [2019-12-27 04:21:21,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 04:21:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 39545 transitions. [2019-12-27 04:21:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:21:21,169 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:21,170 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:21,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:21,370 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:21,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:21,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1405431908, now seen corresponding path program 2 times [2019-12-27 04:21:21,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:21,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755888757] [2019-12-27 04:21:21,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:21,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755888757] [2019-12-27 04:21:21,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272287273] [2019-12-27 04:21:21,453 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:21,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:21:21,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:21:21,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:21:21,528 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:21,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:21,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2019-12-27 04:21:21,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200783089] [2019-12-27 04:21:21,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 04:21:21,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:21,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 04:21:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2019-12-27 04:21:21,682 INFO L87 Difference]: Start difference. First operand 8509 states and 39545 transitions. Second operand 24 states. [2019-12-27 04:21:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:21:27,111 INFO L93 Difference]: Finished difference Result 55341 states and 202712 transitions. [2019-12-27 04:21:27,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-12-27 04:21:27,111 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 21 [2019-12-27 04:21:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:21:27,230 INFO L225 Difference]: With dead ends: 55341 [2019-12-27 04:21:27,230 INFO L226 Difference]: Without dead ends: 55304 [2019-12-27 04:21:27,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6202 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2803, Invalid=13967, Unknown=0, NotChecked=0, Total=16770 [2019-12-27 04:21:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55304 states. [2019-12-27 04:21:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55304 to 8588. [2019-12-27 04:21:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8588 states. [2019-12-27 04:21:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8588 states to 8588 states and 40107 transitions. [2019-12-27 04:21:27,770 INFO L78 Accepts]: Start accepts. Automaton has 8588 states and 40107 transitions. Word has length 21 [2019-12-27 04:21:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:21:27,770 INFO L462 AbstractCegarLoop]: Abstraction has 8588 states and 40107 transitions. [2019-12-27 04:21:27,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 04:21:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 8588 states and 40107 transitions. [2019-12-27 04:21:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:21:27,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:21:27,771 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:21:27,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:27,972 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:21:27,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:21:27,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1535369572, now seen corresponding path program 3 times [2019-12-27 04:21:27,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:21:27,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631507476] [2019-12-27 04:21:27,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:21:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:21:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:28,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631507476] [2019-12-27 04:21:28,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693984776] [2019-12-27 04:21:28,052 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:28,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:21:28,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:21:28,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 04:21:28,130 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:21:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:21:28,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:21:28,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2019-12-27 04:21:28,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953709439] [2019-12-27 04:21:28,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 04:21:28,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:21:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 04:21:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-12-27 04:21:28,268 INFO L87 Difference]: Start difference. First operand 8588 states and 40107 transitions. Second operand 23 states. Received shutdown request... [2019-12-27 04:21:29,357 WARN L209 SmtUtils]: Removed 2 from assertion stack [2019-12-27 04:21:29,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 04:21:29,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:21:29,558 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 04:21:29,563 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 04:21:29,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:21:29 BasicIcfg [2019-12-27 04:21:29,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:21:29,565 INFO L168 Benchmark]: Toolchain (without parser) took 255857.48 ms. Allocated memory was 145.2 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.8 MB in the beginning and 331.9 MB in the end (delta: -230.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 04:21:29,565 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 04:21:29,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.51 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 161.1 MB in the end (delta: -59.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:21:29,565 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.93 ms. Allocated memory is still 202.4 MB. Free memory was 161.1 MB in the beginning and 159.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:21:29,565 INFO L168 Benchmark]: Boogie Preprocessor took 34.92 ms. Allocated memory is still 202.4 MB. Free memory was 159.2 MB in the beginning and 158.3 MB in the end (delta: 963.4 kB). Peak memory consumption was 963.4 kB. Max. memory is 7.1 GB. [2019-12-27 04:21:29,566 INFO L168 Benchmark]: RCFGBuilder took 401.63 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 138.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:21:29,566 INFO L168 Benchmark]: TraceAbstraction took 254636.52 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 137.6 MB in the beginning and 331.9 MB in the end (delta: -194.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 04:21:29,568 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 145.2 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.51 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 161.1 MB in the end (delta: -59.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.93 ms. Allocated memory is still 202.4 MB. Free memory was 161.1 MB in the beginning and 159.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.92 ms. Allocated memory is still 202.4 MB. Free memory was 159.2 MB in the beginning and 158.3 MB in the end (delta: 963.4 kB). Peak memory consumption was 963.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 401.63 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 138.6 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 254636.52 ms. Allocated memory was 202.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 137.6 MB in the beginning and 331.9 MB in the end (delta: -194.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 60 ProgramPointsBefore, 15 ProgramPointsAfterwards, 56 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 7 FixpointIterations, 18 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 351 VarBasedMoverChecksPositive, 4 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 4 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 47 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 81 ProgramPointsBefore, 26 ProgramPointsAfterwards, 74 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 555 VarBasedMoverChecksPositive, 10 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 14 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1223 CheckedPairsTotal, 61 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 102 ProgramPointsBefore, 34 ProgramPointsAfterwards, 92 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 801 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1840 CheckedPairsTotal, 80 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 123 ProgramPointsBefore, 42 ProgramPointsAfterwards, 110 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1106 VarBasedMoverChecksPositive, 19 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2220 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 144 ProgramPointsBefore, 50 ProgramPointsAfterwards, 128 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 58 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 1461 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3419 CheckedPairsTotal, 108 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (8588states) and FLOYD_HOARE automaton (currently 39 states, 23 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 17 for 21ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 54 locations, 1 error locations. Result: TIMEOUT, OverallTime: 31.7s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 564 SDtfs, 4736 SDslu, 4006 SDs, 0 SdLazy, 10806 SolverSat, 663 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 665 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17680 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8588occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 195509 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 380 NumberOfCodeBlocks, 380 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 36528 SizeOfPredicates, 51 NumberOfNonLiveVariables, 986 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 28/130 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown