/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-NoLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:30:28,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:30:28,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:30:28,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:30:28,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:30:28,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:30:28,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:30:28,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:30:28,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:30:28,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:30:28,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:30:28,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:30:28,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:30:28,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:30:28,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:30:28,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:30:28,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:30:28,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:30:28,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:30:28,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:30:28,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:30:28,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:30:28,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:30:28,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:30:28,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:30:28,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:30:28,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:30:28,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:30:28,524 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:30:28,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:30:28,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:30:28,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:30:28,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:30:28,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:30:28,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:30:28,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:30:28,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:30:28,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:30:28,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:30:28,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:30:28,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:30:28,535 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-NoLbe-MCR.epf [2019-12-27 23:30:28,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:30:28,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:30:28,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:30:28,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:30:28,562 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:30:28,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:30:28,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:30:28,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:30:28,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:30:28,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:30:28,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:30:28,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:30:28,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:30:28,564 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:30:28,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:30:28,564 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:30:28,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:30:28,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:30:28,565 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:30:28,565 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:30:28,565 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:30:28,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:30:28,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:30:28,566 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:30:28,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:30:28,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:30:28,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:30:28,567 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:30:28,567 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:30:28,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:30:28,567 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:30:28,568 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:30:28,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:30:28,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:30:28,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:30:28,875 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:30:28,876 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:30:28,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2019-12-27 23:30:28,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31faaff0/9a522b96db88445388783e058e479be1/FLAG37fda99cf [2019-12-27 23:30:29,484 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:30:29,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2019-12-27 23:30:29,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31faaff0/9a522b96db88445388783e058e479be1/FLAG37fda99cf [2019-12-27 23:30:29,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c31faaff0/9a522b96db88445388783e058e479be1 [2019-12-27 23:30:29,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:30:29,758 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:30:29,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:29,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:30:29,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:30:29,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:29" (1/1) ... [2019-12-27 23:30:29,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fd14bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:29, skipping insertion in model container [2019-12-27 23:30:29,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:29" (1/1) ... [2019-12-27 23:30:29,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:30:29,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:30:30,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:30,342 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:30:30,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:30,488 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:30:30,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30 WrapperNode [2019-12-27 23:30:30,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:30,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:30,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:30:30,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:30:30,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:30,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:30:30,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:30:30,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:30:30,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... [2019-12-27 23:30:30,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:30:30,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:30:30,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:30:30,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:30:30,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:30:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:30:30,653 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:30:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:30:30,654 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:30:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:30:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:30:30,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:30:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:30:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:30:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:30:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:30:30,660 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 23:30:30,994 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:30:30,995 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:30:30,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:30 BoogieIcfgContainer [2019-12-27 23:30:30,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:30:30,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:30:30,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:30:31,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:30:31,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:30:29" (1/3) ... [2019-12-27 23:30:31,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bf37fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:31, skipping insertion in model container [2019-12-27 23:30:31,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:30" (2/3) ... [2019-12-27 23:30:31,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bf37fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:31, skipping insertion in model container [2019-12-27 23:30:31,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:30" (3/3) ... [2019-12-27 23:30:31,005 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2019-12-27 23:30:31,013 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:30:31,014 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:30:31,020 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:30:31,021 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:30:31,049 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,050 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,050 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,051 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,051 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,052 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,052 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,052 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,053 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,053 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,053 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,054 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,054 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,054 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,055 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,055 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,055 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,055 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,056 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,056 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,056 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,057 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,057 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,058 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,058 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,058 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,059 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,059 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,063 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,064 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,064 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,064 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,064 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,065 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,072 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,072 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,073 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,073 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,073 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,074 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:31,089 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 23:30:31,110 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:30:31,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:30:31,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:30:31,111 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:30:31,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:30:31,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:30:31,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:30:31,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:30:31,121 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 51 transitions [2019-12-27 23:30:31,207 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1013 states. [2019-12-27 23:30:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-27 23:30:31,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:30:31,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:31,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:31,222 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:31,229 INFO L82 PathProgramCache]: Analyzing trace with hash -910010, now seen corresponding path program 1 times [2019-12-27 23:30:31,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:31,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012389468] [2019-12-27 23:30:31,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:31,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012389468] [2019-12-27 23:30:31,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:31,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:31,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1201370240] [2019-12-27 23:30:31,617 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:31,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:31,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 23:30:31,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:31,650 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:31,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:31,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:31,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:31,670 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 5 states. [2019-12-27 23:30:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:31,842 INFO L93 Difference]: Finished difference Result 1778 states and 5126 transitions. [2019-12-27 23:30:31,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:30:31,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 23:30:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:31,873 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 23:30:31,873 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 23:30:31,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 23:30:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 388. [2019-12-27 23:30:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 23:30:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 993 transitions. [2019-12-27 23:30:31,962 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 993 transitions. Word has length 20 [2019-12-27 23:30:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:31,963 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 993 transitions. [2019-12-27 23:30:31,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 993 transitions. [2019-12-27 23:30:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:31,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:31,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:31,965 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 723642448, now seen corresponding path program 1 times [2019-12-27 23:30:31,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:31,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302529081] [2019-12-27 23:30:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:32,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302529081] [2019-12-27 23:30:32,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:32,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:32,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1356605311] [2019-12-27 23:30:32,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:32,117 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:32,121 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 41 transitions. [2019-12-27 23:30:32,121 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:32,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:30:32,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:32,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:32,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:32,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:32,137 INFO L87 Difference]: Start difference. First operand 388 states and 993 transitions. Second operand 5 states. [2019-12-27 23:30:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:32,259 INFO L93 Difference]: Finished difference Result 563 states and 1392 transitions. [2019-12-27 23:30:32,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:32,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:32,263 INFO L225 Difference]: With dead ends: 563 [2019-12-27 23:30:32,263 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 23:30:32,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:32,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 23:30:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2019-12-27 23:30:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-12-27 23:30:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 883 transitions. [2019-12-27 23:30:32,307 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 883 transitions. Word has length 23 [2019-12-27 23:30:32,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:32,307 INFO L462 AbstractCegarLoop]: Abstraction has 354 states and 883 transitions. [2019-12-27 23:30:32,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:32,308 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 883 transitions. [2019-12-27 23:30:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:32,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:32,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:32,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:32,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:32,314 INFO L82 PathProgramCache]: Analyzing trace with hash -660572760, now seen corresponding path program 1 times [2019-12-27 23:30:32,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:32,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148339347] [2019-12-27 23:30:32,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:32,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148339347] [2019-12-27 23:30:32,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:32,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:32,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1678453925] [2019-12-27 23:30:32,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:32,472 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:32,475 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:30:32,475 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:32,475 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:32,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:32,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:32,477 INFO L87 Difference]: Start difference. First operand 354 states and 883 transitions. Second operand 5 states. [2019-12-27 23:30:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:32,528 INFO L93 Difference]: Finished difference Result 431 states and 1037 transitions. [2019-12-27 23:30:32,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:32,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:32,531 INFO L225 Difference]: With dead ends: 431 [2019-12-27 23:30:32,531 INFO L226 Difference]: Without dead ends: 301 [2019-12-27 23:30:32,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-27 23:30:32,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 288. [2019-12-27 23:30:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-27 23:30:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 709 transitions. [2019-12-27 23:30:32,543 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 709 transitions. Word has length 23 [2019-12-27 23:30:32,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:32,543 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 709 transitions. [2019-12-27 23:30:32,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 709 transitions. [2019-12-27 23:30:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:30:32,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:32,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:32,545 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:32,546 INFO L82 PathProgramCache]: Analyzing trace with hash -962769584, now seen corresponding path program 1 times [2019-12-27 23:30:32,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:32,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510716252] [2019-12-27 23:30:32,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:32,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510716252] [2019-12-27 23:30:32,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:32,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:30:32,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153238709] [2019-12-27 23:30:32,686 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:32,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:32,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 50 transitions. [2019-12-27 23:30:32,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:32,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:30:32,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:30:32,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:30:32,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:32,698 INFO L87 Difference]: Start difference. First operand 288 states and 709 transitions. Second operand 6 states. [2019-12-27 23:30:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:32,854 INFO L93 Difference]: Finished difference Result 546 states and 1323 transitions. [2019-12-27 23:30:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:32,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 23:30:32,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:32,858 INFO L225 Difference]: With dead ends: 546 [2019-12-27 23:30:32,858 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 23:30:32,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:32,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 23:30:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2019-12-27 23:30:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-12-27 23:30:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 735 transitions. [2019-12-27 23:30:32,876 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 735 transitions. Word has length 26 [2019-12-27 23:30:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:32,877 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 735 transitions. [2019-12-27 23:30:32,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:30:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 735 transitions. [2019-12-27 23:30:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:30:32,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:32,883 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:32,883 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:32,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash -243930643, now seen corresponding path program 1 times [2019-12-27 23:30:32,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:32,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865023925] [2019-12-27 23:30:32,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:33,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865023925] [2019-12-27 23:30:33,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288412254] [2019-12-27 23:30:33,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:33,162 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:30:33,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:33,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:33,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:33,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 23:30:33,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [497668405] [2019-12-27 23:30:33,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:33,238 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:33,247 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 96 transitions. [2019-12-27 23:30:33,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:33,253 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:33,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:33,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:33,255 INFO L87 Difference]: Start difference. First operand 301 states and 735 transitions. Second operand 7 states. [2019-12-27 23:30:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:33,378 INFO L93 Difference]: Finished difference Result 483 states and 1148 transitions. [2019-12-27 23:30:33,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:33,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 23:30:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:33,382 INFO L225 Difference]: With dead ends: 483 [2019-12-27 23:30:33,382 INFO L226 Difference]: Without dead ends: 352 [2019-12-27 23:30:33,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-27 23:30:33,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-12-27 23:30:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-27 23:30:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 837 transitions. [2019-12-27 23:30:33,394 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 837 transitions. Word has length 30 [2019-12-27 23:30:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:33,395 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 837 transitions. [2019-12-27 23:30:33,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 837 transitions. [2019-12-27 23:30:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 23:30:33,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:33,397 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:33,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:33,603 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:33,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:33,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1994322550, now seen corresponding path program 1 times [2019-12-27 23:30:33,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:33,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498773560] [2019-12-27 23:30:33,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:33,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498773560] [2019-12-27 23:30:33,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711934725] [2019-12-27 23:30:33,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:33,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:30:33,794 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:33,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:33,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:33,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 23:30:33,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [806460984] [2019-12-27 23:30:33,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:33,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:33,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 100 transitions. [2019-12-27 23:30:33,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:33,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:33,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:30:33,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:33,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:30:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:33,848 INFO L87 Difference]: Start difference. First operand 352 states and 837 transitions. Second operand 8 states. [2019-12-27 23:30:34,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:34,008 INFO L93 Difference]: Finished difference Result 499 states and 1180 transitions. [2019-12-27 23:30:34,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:34,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 23:30:34,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:34,011 INFO L225 Difference]: With dead ends: 499 [2019-12-27 23:30:34,011 INFO L226 Difference]: Without dead ends: 368 [2019-12-27 23:30:34,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-27 23:30:34,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 317. [2019-12-27 23:30:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 23:30:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 767 transitions. [2019-12-27 23:30:34,029 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 767 transitions. Word has length 34 [2019-12-27 23:30:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:34,029 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 767 transitions. [2019-12-27 23:30:34,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:30:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 767 transitions. [2019-12-27 23:30:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 23:30:34,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:34,032 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:34,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:34,240 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:34,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:34,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1975292362, now seen corresponding path program 2 times [2019-12-27 23:30:34,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:34,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222452227] [2019-12-27 23:30:34,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222452227] [2019-12-27 23:30:34,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876069217] [2019-12-27 23:30:34,380 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:34,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:34,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:34,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:30:34,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:34,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:34,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:34,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 23:30:34,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1530111295] [2019-12-27 23:30:34,488 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:34,495 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:34,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 124 transitions. [2019-12-27 23:30:34,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:34,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:34,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:30:34,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:34,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:30:34,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:34,520 INFO L87 Difference]: Start difference. First operand 317 states and 767 transitions. Second operand 8 states. [2019-12-27 23:30:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:34,642 INFO L93 Difference]: Finished difference Result 515 states and 1212 transitions. [2019-12-27 23:30:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:30:34,643 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 23:30:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:34,652 INFO L225 Difference]: With dead ends: 515 [2019-12-27 23:30:34,652 INFO L226 Difference]: Without dead ends: 384 [2019-12-27 23:30:34,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-27 23:30:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-12-27 23:30:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-27 23:30:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 901 transitions. [2019-12-27 23:30:34,665 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 901 transitions. Word has length 34 [2019-12-27 23:30:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:34,666 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 901 transitions. [2019-12-27 23:30:34,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:30:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 901 transitions. [2019-12-27 23:30:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:34,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:34,667 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:34,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:34,871 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:34,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1246329683, now seen corresponding path program 3 times [2019-12-27 23:30:34,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:34,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195138053] [2019-12-27 23:30:34,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:34,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:34,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195138053] [2019-12-27 23:30:34,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978887174] [2019-12-27 23:30:34,974 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:35,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:30:35,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:35,045 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:30:35,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:35,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:35,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:35,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:35,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:35,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:35,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691633551] [2019-12-27 23:30:35,083 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:35,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:35,102 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 128 transitions. [2019-12-27 23:30:35,102 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:35,107 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:35,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:35,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:35,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:35,108 INFO L87 Difference]: Start difference. First operand 384 states and 901 transitions. Second operand 9 states. [2019-12-27 23:30:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:35,263 INFO L93 Difference]: Finished difference Result 531 states and 1244 transitions. [2019-12-27 23:30:35,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:30:35,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:35,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:35,267 INFO L225 Difference]: With dead ends: 531 [2019-12-27 23:30:35,267 INFO L226 Difference]: Without dead ends: 400 [2019-12-27 23:30:35,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:30:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-12-27 23:30:35,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 333. [2019-12-27 23:30:35,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-27 23:30:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 799 transitions. [2019-12-27 23:30:35,280 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 799 transitions. Word has length 38 [2019-12-27 23:30:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:35,281 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 799 transitions. [2019-12-27 23:30:35,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 799 transitions. [2019-12-27 23:30:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:35,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:35,282 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:35,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:35,491 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:35,491 INFO L82 PathProgramCache]: Analyzing trace with hash -40518361, now seen corresponding path program 4 times [2019-12-27 23:30:35,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:35,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923601212] [2019-12-27 23:30:35,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:35,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923601212] [2019-12-27 23:30:35,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641076133] [2019-12-27 23:30:35,629 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:35,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:35,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:35,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:30:35,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:35,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:35,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:35,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [645432582] [2019-12-27 23:30:35,715 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:35,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:35,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 152 transitions. [2019-12-27 23:30:35,739 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:35,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:35,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:35,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:35,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:35,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:35,745 INFO L87 Difference]: Start difference. First operand 333 states and 799 transitions. Second operand 9 states. [2019-12-27 23:30:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:35,921 INFO L93 Difference]: Finished difference Result 645 states and 1521 transitions. [2019-12-27 23:30:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:30:35,922 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:35,925 INFO L225 Difference]: With dead ends: 645 [2019-12-27 23:30:35,925 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 23:30:35,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 23:30:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 346. [2019-12-27 23:30:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-27 23:30:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 825 transitions. [2019-12-27 23:30:35,935 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 825 transitions. Word has length 38 [2019-12-27 23:30:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:35,936 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 825 transitions. [2019-12-27 23:30:35,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 825 transitions. [2019-12-27 23:30:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:30:35,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:35,937 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:36,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:36,143 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:36,144 INFO L82 PathProgramCache]: Analyzing trace with hash 57013188, now seen corresponding path program 5 times [2019-12-27 23:30:36,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:36,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125895065] [2019-12-27 23:30:36,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:36,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125895065] [2019-12-27 23:30:36,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495889399] [2019-12-27 23:30:36,254 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:36,313 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:30:36,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:36,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:30:36,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:36,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:36,350 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:36,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 23:30:36,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [164973780] [2019-12-27 23:30:36,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:36,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:36,402 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 156 transitions. [2019-12-27 23:30:36,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:36,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:36,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:36,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:36,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:36,420 INFO L87 Difference]: Start difference. First operand 346 states and 825 transitions. Second operand 10 states. [2019-12-27 23:30:36,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:36,627 INFO L93 Difference]: Finished difference Result 677 states and 1585 transitions. [2019-12-27 23:30:36,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:36,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-12-27 23:30:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:36,631 INFO L225 Difference]: With dead ends: 677 [2019-12-27 23:30:36,631 INFO L226 Difference]: Without dead ends: 464 [2019-12-27 23:30:36,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-27 23:30:36,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 365. [2019-12-27 23:30:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-12-27 23:30:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 863 transitions. [2019-12-27 23:30:36,641 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 863 transitions. Word has length 42 [2019-12-27 23:30:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:36,641 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 863 transitions. [2019-12-27 23:30:36,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 863 transitions. [2019-12-27 23:30:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 23:30:36,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:36,642 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:36,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:36,845 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:36,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:36,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2041820769, now seen corresponding path program 6 times [2019-12-27 23:30:36,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:36,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997480603] [2019-12-27 23:30:36,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:36,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997480603] [2019-12-27 23:30:36,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715316583] [2019-12-27 23:30:36,977 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:37,039 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-27 23:30:37,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:37,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:30:37,042 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:37,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:37,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:37,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 23:30:37,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1117950448] [2019-12-27 23:30:37,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:37,084 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:37,107 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 208 transitions. [2019-12-27 23:30:37,107 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:37,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:30:37,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:30:37,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:37,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:30:37,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:37,112 INFO L87 Difference]: Start difference. First operand 365 states and 863 transitions. Second operand 11 states. [2019-12-27 23:30:37,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:37,311 INFO L93 Difference]: Finished difference Result 709 states and 1649 transitions. [2019-12-27 23:30:37,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:37,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-12-27 23:30:37,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:37,314 INFO L225 Difference]: With dead ends: 709 [2019-12-27 23:30:37,315 INFO L226 Difference]: Without dead ends: 496 [2019-12-27 23:30:37,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-12-27 23:30:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 378. [2019-12-27 23:30:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-27 23:30:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 889 transitions. [2019-12-27 23:30:37,340 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 889 transitions. Word has length 46 [2019-12-27 23:30:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:37,340 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 889 transitions. [2019-12-27 23:30:37,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:30:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 889 transitions. [2019-12-27 23:30:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:30:37,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:37,341 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:37,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:37,551 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash 216399870, now seen corresponding path program 7 times [2019-12-27 23:30:37,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:37,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989227199] [2019-12-27 23:30:37,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:37,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:37,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989227199] [2019-12-27 23:30:37,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007062254] [2019-12-27 23:30:37,686 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:37,736 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:30:37,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:37,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:37,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:37,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 23:30:37,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321291558] [2019-12-27 23:30:37,777 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:37,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:37,807 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 212 transitions. [2019-12-27 23:30:37,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:37,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:30:37,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:37,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:37,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:37,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:37,812 INFO L87 Difference]: Start difference. First operand 378 states and 889 transitions. Second operand 12 states. [2019-12-27 23:30:38,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:38,047 INFO L93 Difference]: Finished difference Result 643 states and 1468 transitions. [2019-12-27 23:30:38,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:38,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-27 23:30:38,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:38,050 INFO L225 Difference]: With dead ends: 643 [2019-12-27 23:30:38,050 INFO L226 Difference]: Without dead ends: 512 [2019-12-27 23:30:38,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:30:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-27 23:30:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-12-27 23:30:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-27 23:30:38,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1157 transitions. [2019-12-27 23:30:38,062 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1157 transitions. Word has length 50 [2019-12-27 23:30:38,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,063 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1157 transitions. [2019-12-27 23:30:38,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:38,063 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1157 transitions. [2019-12-27 23:30:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 23:30:38,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,064 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:38,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:38,275 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1532488761, now seen corresponding path program 8 times [2019-12-27 23:30:38,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51370091] [2019-12-27 23:30:38,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:38,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51370091] [2019-12-27 23:30:38,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580643241] [2019-12-27 23:30:38,438 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:38,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:38,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:38,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:38,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:38,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:38,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:38,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:38,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 23:30:38,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1673790319] [2019-12-27 23:30:38,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:38,552 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:38,600 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 240 transitions. [2019-12-27 23:30:38,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:38,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:30:38,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:30:38,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:38,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:30:38,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:38,605 INFO L87 Difference]: Start difference. First operand 512 states and 1157 transitions. Second operand 13 states. [2019-12-27 23:30:38,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:38,855 INFO L93 Difference]: Finished difference Result 659 states and 1500 transitions. [2019-12-27 23:30:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:38,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 23:30:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:38,859 INFO L225 Difference]: With dead ends: 659 [2019-12-27 23:30:38,859 INFO L226 Difference]: Without dead ends: 528 [2019-12-27 23:30:38,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:30:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-27 23:30:38,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2019-12-27 23:30:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-27 23:30:38,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 927 transitions. [2019-12-27 23:30:38,870 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 927 transitions. Word has length 54 [2019-12-27 23:30:38,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,870 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 927 transitions. [2019-12-27 23:30:38,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:30:38,870 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 927 transitions. [2019-12-27 23:30:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 23:30:38,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,871 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:39,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:39,077 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1337338469, now seen corresponding path program 9 times [2019-12-27 23:30:39,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:39,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495290867] [2019-12-27 23:30:39,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:39,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495290867] [2019-12-27 23:30:39,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605405721] [2019-12-27 23:30:39,219 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:39,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:30:39,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:39,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:30:39,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:39,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:39,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:39,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 23:30:39,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526402780] [2019-12-27 23:30:39,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:39,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:39,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 264 transitions. [2019-12-27 23:30:39,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:39,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 23:30:39,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:30:39,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:30:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:39,360 INFO L87 Difference]: Start difference. First operand 397 states and 927 transitions. Second operand 13 states. [2019-12-27 23:30:39,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:39,618 INFO L93 Difference]: Finished difference Result 675 states and 1532 transitions. [2019-12-27 23:30:39,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:39,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 23:30:39,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:39,621 INFO L225 Difference]: With dead ends: 675 [2019-12-27 23:30:39,622 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 23:30:39,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:30:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 23:30:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-12-27 23:30:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-27 23:30:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1221 transitions. [2019-12-27 23:30:39,633 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1221 transitions. Word has length 54 [2019-12-27 23:30:39,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:39,633 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1221 transitions. [2019-12-27 23:30:39,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:30:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1221 transitions. [2019-12-27 23:30:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:39,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:39,635 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:39,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:39,839 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:39,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1662726712, now seen corresponding path program 10 times [2019-12-27 23:30:39,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:39,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339067932] [2019-12-27 23:30:39,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:39,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339067932] [2019-12-27 23:30:39,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457102118] [2019-12-27 23:30:39,989 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:40,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:40,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:40,043 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:30:40,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:40,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:40,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:40,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:40,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:40,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 23:30:40,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1262010118] [2019-12-27 23:30:40,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:40,083 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:40,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 268 transitions. [2019-12-27 23:30:40,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:40,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 23:30:40,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:40,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:40,134 INFO L87 Difference]: Start difference. First operand 544 states and 1221 transitions. Second operand 14 states. [2019-12-27 23:30:40,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:40,426 INFO L93 Difference]: Finished difference Result 789 states and 1809 transitions. [2019-12-27 23:30:40,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:30:40,427 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 23:30:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:40,431 INFO L225 Difference]: With dead ends: 789 [2019-12-27 23:30:40,432 INFO L226 Difference]: Without dead ends: 576 [2019-12-27 23:30:40,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=544, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:30:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-27 23:30:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-12-27 23:30:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 23:30:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1285 transitions. [2019-12-27 23:30:40,444 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1285 transitions. Word has length 58 [2019-12-27 23:30:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:40,445 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1285 transitions. [2019-12-27 23:30:40,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1285 transitions. [2019-12-27 23:30:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:40,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:40,446 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:40,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:40,650 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:40,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:40,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1598172444, now seen corresponding path program 11 times [2019-12-27 23:30:40,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:40,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025518100] [2019-12-27 23:30:40,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:40,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025518100] [2019-12-27 23:30:40,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38347486] [2019-12-27 23:30:40,864 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:40,937 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:30:40,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:40,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:30:40,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:40,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:40,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:40,977 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:40,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:40,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 23:30:40,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936430242] [2019-12-27 23:30:40,979 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:40,988 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:41,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 292 transitions. [2019-12-27 23:30:41,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:41,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 23:30:41,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:41,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:41,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:41,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:41,053 INFO L87 Difference]: Start difference. First operand 576 states and 1285 transitions. Second operand 14 states. [2019-12-27 23:30:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:41,284 INFO L93 Difference]: Finished difference Result 723 states and 1628 transitions. [2019-12-27 23:30:41,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:41,284 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 23:30:41,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:41,289 INFO L225 Difference]: With dead ends: 723 [2019-12-27 23:30:41,289 INFO L226 Difference]: Without dead ends: 592 [2019-12-27 23:30:41,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:30:41,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-12-27 23:30:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 429. [2019-12-27 23:30:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-27 23:30:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 991 transitions. [2019-12-27 23:30:41,306 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 991 transitions. Word has length 58 [2019-12-27 23:30:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:41,307 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 991 transitions. [2019-12-27 23:30:41,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 991 transitions. [2019-12-27 23:30:41,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 23:30:41,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:41,310 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:41,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:41,514 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash -774759723, now seen corresponding path program 12 times [2019-12-27 23:30:41,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:41,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55213128] [2019-12-27 23:30:41,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:41,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55213128] [2019-12-27 23:30:41,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471937842] [2019-12-27 23:30:41,681 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:41,754 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2019-12-27 23:30:41,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:41,755 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:30:41,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:41,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:41,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:41,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 23:30:41,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [783631875] [2019-12-27 23:30:41,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:41,792 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:41,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 320 transitions. [2019-12-27 23:30:41,862 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:41,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 23:30:41,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:30:41,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:41,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:30:41,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:30:41,867 INFO L87 Difference]: Start difference. First operand 429 states and 991 transitions. Second operand 15 states. [2019-12-27 23:30:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:42,164 INFO L93 Difference]: Finished difference Result 739 states and 1660 transitions. [2019-12-27 23:30:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:42,165 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-12-27 23:30:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:42,168 INFO L225 Difference]: With dead ends: 739 [2019-12-27 23:30:42,168 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 23:30:42,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:30:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 23:30:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-12-27 23:30:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-27 23:30:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1349 transitions. [2019-12-27 23:30:42,181 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1349 transitions. Word has length 62 [2019-12-27 23:30:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:42,181 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1349 transitions. [2019-12-27 23:30:42,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:30:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1349 transitions. [2019-12-27 23:30:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 23:30:42,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:42,183 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:42,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:42,386 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1451259278, now seen corresponding path program 13 times [2019-12-27 23:30:42,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:42,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645773912] [2019-12-27 23:30:42,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:42,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645773912] [2019-12-27 23:30:42,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688968221] [2019-12-27 23:30:42,547 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:30:42,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:42,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:42,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:42,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 23:30:42,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308253107] [2019-12-27 23:30:42,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:42,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:42,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 324 transitions. [2019-12-27 23:30:42,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:42,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 23:30:42,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:42,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:42,732 INFO L87 Difference]: Start difference. First operand 608 states and 1349 transitions. Second operand 16 states. [2019-12-27 23:30:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:43,145 INFO L93 Difference]: Finished difference Result 853 states and 1937 transitions. [2019-12-27 23:30:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:43,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 23:30:43,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:43,149 INFO L225 Difference]: With dead ends: 853 [2019-12-27 23:30:43,150 INFO L226 Difference]: Without dead ends: 640 [2019-12-27 23:30:43,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:30:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-27 23:30:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-12-27 23:30:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 23:30:43,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1413 transitions. [2019-12-27 23:30:43,161 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1413 transitions. Word has length 66 [2019-12-27 23:30:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:43,162 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1413 transitions. [2019-12-27 23:30:43,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:30:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1413 transitions. [2019-12-27 23:30:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 23:30:43,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:43,163 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:43,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:43,367 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:43,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1915950306, now seen corresponding path program 14 times [2019-12-27 23:30:43,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:43,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561981390] [2019-12-27 23:30:43,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:43,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561981390] [2019-12-27 23:30:43,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979146289] [2019-12-27 23:30:43,538 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:43,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:43,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:43,602 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:30:43,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:43,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:43,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:43,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 23:30:43,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1290786307] [2019-12-27 23:30:43,635 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:43,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:43,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 348 transitions. [2019-12-27 23:30:43,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:43,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 23:30:43,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:43,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:43,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:43,735 INFO L87 Difference]: Start difference. First operand 640 states and 1413 transitions. Second operand 16 states. [2019-12-27 23:30:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:44,091 INFO L93 Difference]: Finished difference Result 787 states and 1756 transitions. [2019-12-27 23:30:44,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:30:44,091 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 23:30:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:44,094 INFO L225 Difference]: With dead ends: 787 [2019-12-27 23:30:44,094 INFO L226 Difference]: Without dead ends: 656 [2019-12-27 23:30:44,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:30:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-12-27 23:30:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 461. [2019-12-27 23:30:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 23:30:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1055 transitions. [2019-12-27 23:30:44,106 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1055 transitions. Word has length 66 [2019-12-27 23:30:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:44,106 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1055 transitions. [2019-12-27 23:30:44,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:30:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1055 transitions. [2019-12-27 23:30:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 23:30:44,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:44,108 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:44,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:44,312 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:44,313 INFO L82 PathProgramCache]: Analyzing trace with hash -188316145, now seen corresponding path program 15 times [2019-12-27 23:30:44,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:44,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572368901] [2019-12-27 23:30:44,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:44,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572368901] [2019-12-27 23:30:44,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294882417] [2019-12-27 23:30:44,486 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:44,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-12-27 23:30:44,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:44,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 23:30:44,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:44,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:44,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:44,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 23:30:44,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575644174] [2019-12-27 23:30:44,613 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:44,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:44,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 376 transitions. [2019-12-27 23:30:44,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:44,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 23:30:44,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:30:44,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:44,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:30:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:30:44,689 INFO L87 Difference]: Start difference. First operand 461 states and 1055 transitions. Second operand 17 states. [2019-12-27 23:30:45,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:45,058 INFO L93 Difference]: Finished difference Result 803 states and 1788 transitions. [2019-12-27 23:30:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:30:45,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-12-27 23:30:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:45,062 INFO L225 Difference]: With dead ends: 803 [2019-12-27 23:30:45,062 INFO L226 Difference]: Without dead ends: 672 [2019-12-27 23:30:45,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:30:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-27 23:30:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2019-12-27 23:30:45,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-12-27 23:30:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1477 transitions. [2019-12-27 23:30:45,076 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1477 transitions. Word has length 70 [2019-12-27 23:30:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:45,077 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 1477 transitions. [2019-12-27 23:30:45,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:30:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1477 transitions. [2019-12-27 23:30:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 23:30:45,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:45,078 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:45,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:45,282 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1770850476, now seen corresponding path program 16 times [2019-12-27 23:30:45,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:45,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080167793] [2019-12-27 23:30:45,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:45,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080167793] [2019-12-27 23:30:45,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737140031] [2019-12-27 23:30:45,456 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:45,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:45,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:45,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 23:30:45,524 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:45,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:45,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:45,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 23:30:45,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1386178131] [2019-12-27 23:30:45,614 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:45,627 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:45,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 380 transitions. [2019-12-27 23:30:45,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:45,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 23:30:45,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:30:45,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:45,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:30:45,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:45,703 INFO L87 Difference]: Start difference. First operand 672 states and 1477 transitions. Second operand 18 states. [2019-12-27 23:30:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:46,116 INFO L93 Difference]: Finished difference Result 819 states and 1820 transitions. [2019-12-27 23:30:46,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:46,116 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2019-12-27 23:30:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:46,121 INFO L225 Difference]: With dead ends: 819 [2019-12-27 23:30:46,121 INFO L226 Difference]: Without dead ends: 688 [2019-12-27 23:30:46,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=837, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:30:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-12-27 23:30:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 477. [2019-12-27 23:30:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-12-27 23:30:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1087 transitions. [2019-12-27 23:30:46,139 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1087 transitions. Word has length 74 [2019-12-27 23:30:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:46,140 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 1087 transitions. [2019-12-27 23:30:46,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:30:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1087 transitions. [2019-12-27 23:30:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 23:30:46,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:46,142 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:46,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:46,346 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:46,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -37410472, now seen corresponding path program 17 times [2019-12-27 23:30:46,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:46,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644061058] [2019-12-27 23:30:46,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:46,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644061058] [2019-12-27 23:30:46,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072145073] [2019-12-27 23:30:46,538 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 23:30:46,603 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 23:30:46,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:46,605 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 23:30:46,606 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:46,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:46,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 23:30:46,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1866565571] [2019-12-27 23:30:46,638 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:46,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:46,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 404 transitions. [2019-12-27 23:30:46,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:46,815 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 23:30:46,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:30:46,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:46,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:30:46,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:46,816 INFO L87 Difference]: Start difference. First operand 477 states and 1087 transitions. Second operand 18 states. [2019-12-27 23:30:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:47,199 INFO L93 Difference]: Finished difference Result 835 states and 1852 transitions. [2019-12-27 23:30:47,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:30:47,200 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2019-12-27 23:30:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:47,204 INFO L225 Difference]: With dead ends: 835 [2019-12-27 23:30:47,204 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 23:30:47,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=798, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:30:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 23:30:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-12-27 23:30:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-12-27 23:30:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1541 transitions. [2019-12-27 23:30:47,217 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1541 transitions. Word has length 74 [2019-12-27 23:30:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:47,218 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1541 transitions. [2019-12-27 23:30:47,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:30:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1541 transitions. [2019-12-27 23:30:47,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 23:30:47,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:47,219 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:47,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:47,423 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:47,424 INFO L82 PathProgramCache]: Analyzing trace with hash -803269259, now seen corresponding path program 18 times [2019-12-27 23:30:47,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:47,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244643540] [2019-12-27 23:30:47,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:47,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244643540] [2019-12-27 23:30:47,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252257405] [2019-12-27 23:30:47,634 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 23:30:47,705 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-27 23:30:47,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:47,707 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 23:30:47,708 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:47,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:47,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:47,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 23:30:47,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1779361893] [2019-12-27 23:30:47,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:47,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:48,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 408 transitions. [2019-12-27 23:30:48,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:48,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 23:30:48,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:30:48,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:48,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:30:48,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:48,230 INFO L87 Difference]: Start difference. First operand 704 states and 1541 transitions. Second operand 19 states. [2019-12-27 23:30:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:48,652 INFO L93 Difference]: Finished difference Result 851 states and 1884 transitions. [2019-12-27 23:30:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:30:48,653 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-12-27 23:30:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:48,657 INFO L225 Difference]: With dead ends: 851 [2019-12-27 23:30:48,657 INFO L226 Difference]: Without dead ends: 720 [2019-12-27 23:30:48,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:30:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2019-12-27 23:30:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 493. [2019-12-27 23:30:48,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-12-27 23:30:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1119 transitions. [2019-12-27 23:30:48,669 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1119 transitions. Word has length 78 [2019-12-27 23:30:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:48,670 INFO L462 AbstractCegarLoop]: Abstraction has 493 states and 1119 transitions. [2019-12-27 23:30:48,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:30:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1119 transitions. [2019-12-27 23:30:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 23:30:48,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:48,671 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:48,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:48,883 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash 362878793, now seen corresponding path program 19 times [2019-12-27 23:30:48,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:48,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156305628] [2019-12-27 23:30:48,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:49,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156305628] [2019-12-27 23:30:49,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243274991] [2019-12-27 23:30:49,100 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 23:30:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:49,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 23:30:49,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:49,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:49,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:49,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 23:30:49,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [289700158] [2019-12-27 23:30:49,196 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:49,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:49,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 432 transitions. [2019-12-27 23:30:49,286 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:49,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 23:30:49,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:30:49,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:49,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:30:49,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:49,291 INFO L87 Difference]: Start difference. First operand 493 states and 1119 transitions. Second operand 19 states. [2019-12-27 23:30:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:49,692 INFO L93 Difference]: Finished difference Result 867 states and 1916 transitions. [2019-12-27 23:30:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:49,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-12-27 23:30:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:49,697 INFO L225 Difference]: With dead ends: 867 [2019-12-27 23:30:49,697 INFO L226 Difference]: Without dead ends: 736 [2019-12-27 23:30:49,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=895, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:30:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-12-27 23:30:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-12-27 23:30:49,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 23:30:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1605 transitions. [2019-12-27 23:30:49,712 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1605 transitions. Word has length 78 [2019-12-27 23:30:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:49,712 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1605 transitions. [2019-12-27 23:30:49,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:30:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1605 transitions. [2019-12-27 23:30:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 23:30:49,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:49,714 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:49,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:49,918 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:49,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:49,918 INFO L82 PathProgramCache]: Analyzing trace with hash 314420454, now seen corresponding path program 20 times [2019-12-27 23:30:49,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:49,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103801758] [2019-12-27 23:30:49,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:50,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103801758] [2019-12-27 23:30:50,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422312906] [2019-12-27 23:30:50,152 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:50,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:50,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:50,209 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 23:30:50,210 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:50,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:50,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:50,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 23:30:50,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562673255] [2019-12-27 23:30:50,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:50,247 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:50,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 260 states and 436 transitions. [2019-12-27 23:30:50,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:50,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 23:30:50,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:30:50,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:50,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:30:50,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:50,337 INFO L87 Difference]: Start difference. First operand 736 states and 1605 transitions. Second operand 20 states. [2019-12-27 23:30:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:50,826 INFO L93 Difference]: Finished difference Result 981 states and 2193 transitions. [2019-12-27 23:30:50,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:30:50,827 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-12-27 23:30:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:50,832 INFO L225 Difference]: With dead ends: 981 [2019-12-27 23:30:50,832 INFO L226 Difference]: Without dead ends: 768 [2019-12-27 23:30:50,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=446, Invalid=1114, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:30:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-27 23:30:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2019-12-27 23:30:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-27 23:30:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1669 transitions. [2019-12-27 23:30:50,846 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1669 transitions. Word has length 82 [2019-12-27 23:30:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:50,847 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1669 transitions. [2019-12-27 23:30:50,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:30:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1669 transitions. [2019-12-27 23:30:50,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 23:30:50,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:50,849 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:51,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:51,053 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:51,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:51,054 INFO L82 PathProgramCache]: Analyzing trace with hash 539004306, now seen corresponding path program 21 times [2019-12-27 23:30:51,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:51,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275984654] [2019-12-27 23:30:51,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:51,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275984654] [2019-12-27 23:30:51,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014351088] [2019-12-27 23:30:51,258 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:51,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-27 23:30:51,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:51,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 23:30:51,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:51,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:51,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:51,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 23:30:51,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770142843] [2019-12-27 23:30:51,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:51,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:51,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 460 transitions. [2019-12-27 23:30:51,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:51,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 47 times. [2019-12-27 23:30:51,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:30:51,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:30:51,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:51,474 INFO L87 Difference]: Start difference. First operand 768 states and 1669 transitions. Second operand 20 states. [2019-12-27 23:30:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:51,916 INFO L93 Difference]: Finished difference Result 915 states and 2012 transitions. [2019-12-27 23:30:51,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:30:51,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-12-27 23:30:51,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:51,921 INFO L225 Difference]: With dead ends: 915 [2019-12-27 23:30:51,921 INFO L226 Difference]: Without dead ends: 784 [2019-12-27 23:30:51,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=998, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:30:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-27 23:30:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 525. [2019-12-27 23:30:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-12-27 23:30:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1183 transitions. [2019-12-27 23:30:51,934 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1183 transitions. Word has length 82 [2019-12-27 23:30:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:51,934 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 1183 transitions. [2019-12-27 23:30:51,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:30:51,934 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1183 transitions. [2019-12-27 23:30:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 23:30:51,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:51,936 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:52,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:52,139 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 383504003, now seen corresponding path program 22 times [2019-12-27 23:30:52,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:52,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679881540] [2019-12-27 23:30:52,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:52,375 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:52,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679881540] [2019-12-27 23:30:52,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834992273] [2019-12-27 23:30:52,375 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:52,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:52,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:52,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 23:30:52,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:52,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:52,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:52,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:52,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:52,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 23:30:52,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1162239827] [2019-12-27 23:30:52,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:52,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:52,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 288 states and 488 transitions. [2019-12-27 23:30:52,635 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:52,639 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 50 times. [2019-12-27 23:30:52,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 23:30:52,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:52,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 23:30:52,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:30:52,640 INFO L87 Difference]: Start difference. First operand 525 states and 1183 transitions. Second operand 21 states. [2019-12-27 23:30:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:53,121 INFO L93 Difference]: Finished difference Result 931 states and 2044 transitions. [2019-12-27 23:30:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:30:53,121 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2019-12-27 23:30:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:53,125 INFO L225 Difference]: With dead ends: 931 [2019-12-27 23:30:53,125 INFO L226 Difference]: Without dead ends: 800 [2019-12-27 23:30:53,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=454, Invalid=1106, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:30:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-27 23:30:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-27 23:30:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 23:30:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1733 transitions. [2019-12-27 23:30:53,140 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1733 transitions. Word has length 86 [2019-12-27 23:30:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:53,140 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1733 transitions. [2019-12-27 23:30:53,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 23:30:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1733 transitions. [2019-12-27 23:30:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 23:30:53,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:53,142 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:53,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:53,346 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash -91523296, now seen corresponding path program 23 times [2019-12-27 23:30:53,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:53,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232855279] [2019-12-27 23:30:53,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:53,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232855279] [2019-12-27 23:30:53,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812043296] [2019-12-27 23:30:53,615 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:53,683 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-12-27 23:30:53,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:53,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 23:30:53,686 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:53,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:53,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:53,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 23:30:53,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211409381] [2019-12-27 23:30:53,719 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:53,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:53,849 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 492 transitions. [2019-12-27 23:30:53,850 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:53,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 50 times. [2019-12-27 23:30:53,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 23:30:53,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:53,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 23:30:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:30:53,856 INFO L87 Difference]: Start difference. First operand 800 states and 1733 transitions. Second operand 22 states. [2019-12-27 23:30:54,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:54,435 INFO L93 Difference]: Finished difference Result 1045 states and 2321 transitions. [2019-12-27 23:30:54,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 23:30:54,435 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2019-12-27 23:30:54,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:54,439 INFO L225 Difference]: With dead ends: 1045 [2019-12-27 23:30:54,439 INFO L226 Difference]: Without dead ends: 832 [2019-12-27 23:30:54,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=544, Invalid=1348, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:30:54,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-12-27 23:30:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2019-12-27 23:30:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2019-12-27 23:30:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1797 transitions. [2019-12-27 23:30:54,453 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1797 transitions. Word has length 90 [2019-12-27 23:30:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:54,454 INFO L462 AbstractCegarLoop]: Abstraction has 832 states and 1797 transitions. [2019-12-27 23:30:54,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 23:30:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1797 transitions. [2019-12-27 23:30:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 23:30:54,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:54,456 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:54,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:54,660 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash 173610956, now seen corresponding path program 24 times [2019-12-27 23:30:54,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:54,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034666874] [2019-12-27 23:30:54,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:54,908 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:54,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034666874] [2019-12-27 23:30:54,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146702314] [2019-12-27 23:30:54,909 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:54,976 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-12-27 23:30:54,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:54,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 23:30:54,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:55,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:55,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:55,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 23:30:55,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106690425] [2019-12-27 23:30:55,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:55,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:55,197 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 516 transitions. [2019-12-27 23:30:55,197 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:55,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 53 times. [2019-12-27 23:30:55,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 23:30:55,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:55,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 23:30:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:30:55,208 INFO L87 Difference]: Start difference. First operand 832 states and 1797 transitions. Second operand 22 states. [2019-12-27 23:30:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:55,699 INFO L93 Difference]: Finished difference Result 979 states and 2140 transitions. [2019-12-27 23:30:55,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 23:30:55,700 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2019-12-27 23:30:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:55,705 INFO L225 Difference]: With dead ends: 979 [2019-12-27 23:30:55,705 INFO L226 Difference]: Without dead ends: 848 [2019-12-27 23:30:55,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=480, Invalid=1160, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:30:55,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-27 23:30:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 557. [2019-12-27 23:30:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-12-27 23:30:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1247 transitions. [2019-12-27 23:30:55,721 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1247 transitions. Word has length 90 [2019-12-27 23:30:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:55,722 INFO L462 AbstractCegarLoop]: Abstraction has 557 states and 1247 transitions. [2019-12-27 23:30:55,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 23:30:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1247 transitions. [2019-12-27 23:30:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 23:30:55,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:55,724 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:55,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:55,929 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1057969219, now seen corresponding path program 25 times [2019-12-27 23:30:55,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:55,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844519907] [2019-12-27 23:30:55,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:56,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844519907] [2019-12-27 23:30:56,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703315673] [2019-12-27 23:30:56,181 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:56,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 23:30:56,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:56,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:56,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:56,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 23:30:56,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566899281] [2019-12-27 23:30:56,274 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:56,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:56,426 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 320 states and 544 transitions. [2019-12-27 23:30:56,426 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:56,430 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 56 times. [2019-12-27 23:30:56,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 23:30:56,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:56,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 23:30:56,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:30:56,430 INFO L87 Difference]: Start difference. First operand 557 states and 1247 transitions. Second operand 23 states. [2019-12-27 23:30:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:56,990 INFO L93 Difference]: Finished difference Result 995 states and 2172 transitions. [2019-12-27 23:30:56,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:30:56,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2019-12-27 23:30:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:56,994 INFO L225 Difference]: With dead ends: 995 [2019-12-27 23:30:56,994 INFO L226 Difference]: Without dead ends: 864 [2019-12-27 23:30:56,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=553, Invalid=1339, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:30:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-12-27 23:30:57,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-12-27 23:30:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-12-27 23:30:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1861 transitions. [2019-12-27 23:30:57,009 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1861 transitions. Word has length 94 [2019-12-27 23:30:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:57,009 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1861 transitions. [2019-12-27 23:30:57,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 23:30:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1861 transitions. [2019-12-27 23:30:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 23:30:57,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:57,012 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:57,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:57,215 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:57,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1550870362, now seen corresponding path program 26 times [2019-12-27 23:30:57,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:57,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806818683] [2019-12-27 23:30:57,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:57,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806818683] [2019-12-27 23:30:57,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260105857] [2019-12-27 23:30:57,603 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:57,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:57,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:57,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 23:30:57,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:57,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:30:57,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:57,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 23:30:57,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [904518398] [2019-12-27 23:30:57,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:57,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:58,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 324 states and 548 transitions. [2019-12-27 23:30:58,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:58,146 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 56 times. [2019-12-27 23:30:58,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 23:30:58,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 23:30:58,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:30:58,147 INFO L87 Difference]: Start difference. First operand 864 states and 1861 transitions. Second operand 24 states. [2019-12-27 23:30:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:59,004 INFO L93 Difference]: Finished difference Result 1011 states and 2204 transitions. [2019-12-27 23:30:59,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 23:30:59,005 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2019-12-27 23:30:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:59,021 INFO L225 Difference]: With dead ends: 1011 [2019-12-27 23:30:59,022 INFO L226 Difference]: Without dead ends: 880 [2019-12-27 23:30:59,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=647, Invalid=1515, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 23:30:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-12-27 23:30:59,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 573. [2019-12-27 23:30:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-27 23:30:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1279 transitions. [2019-12-27 23:30:59,051 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1279 transitions. Word has length 98 [2019-12-27 23:30:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:59,052 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1279 transitions. [2019-12-27 23:30:59,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 23:30:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1279 transitions. [2019-12-27 23:30:59,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 23:30:59,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:59,056 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:30:59,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:59,262 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:59,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:59,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1209481210, now seen corresponding path program 27 times [2019-12-27 23:30:59,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:59,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60527424] [2019-12-27 23:30:59,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:30:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:30:59,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:30:59,379 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:30:59,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:30:59 BasicIcfg [2019-12-27 23:30:59,573 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:30:59,576 INFO L168 Benchmark]: Toolchain (without parser) took 29819.81 ms. Allocated memory was 145.8 MB in the beginning and 843.6 MB in the end (delta: 697.8 MB). Free memory was 101.9 MB in the beginning and 417.8 MB in the end (delta: -315.9 MB). Peak memory consumption was 382.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:59,577 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 23:30:59,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.60 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 161.6 MB in the end (delta: -60.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:59,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.08 ms. Allocated memory is still 203.4 MB. Free memory was 161.6 MB in the beginning and 159.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:59,579 INFO L168 Benchmark]: Boogie Preprocessor took 26.41 ms. Allocated memory is still 203.4 MB. Free memory was 159.6 MB in the beginning and 158.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:59,579 INFO L168 Benchmark]: RCFGBuilder took 405.63 ms. Allocated memory is still 203.4 MB. Free memory was 158.2 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 23:30:59,580 INFO L168 Benchmark]: TraceAbstraction took 28575.03 ms. Allocated memory was 203.4 MB in the beginning and 843.6 MB in the end (delta: 640.2 MB). Free memory was 137.9 MB in the beginning and 417.8 MB in the end (delta: -279.9 MB). Peak memory consumption was 360.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:30:59,582 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.21 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 730.60 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.5 MB in the beginning and 161.6 MB in the end (delta: -60.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.08 ms. Allocated memory is still 203.4 MB. Free memory was 161.6 MB in the beginning and 159.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.41 ms. Allocated memory is still 203.4 MB. Free memory was 159.6 MB in the beginning and 158.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.63 ms. Allocated memory is still 203.4 MB. Free memory was 158.2 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 28575.03 ms. Allocated memory was 203.4 MB in the beginning and 843.6 MB in the end (delta: 640.2 MB). Free memory was 137.9 MB in the beginning and 417.8 MB in the end (delta: -279.9 MB). Peak memory consumption was 360.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L675] 0 int i = 3, j = 6; VAL [i=3, j=6] [L693] 0 pthread_t id1, id2; VAL [i=3, j=6] [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L677] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L685] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=1, k=0] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=2, k=1] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=2] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=6, k=5] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=7, k=6] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=8, k=7] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L677] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=9, k=8] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L685] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L677] COND TRUE 1 k < 10 [L679] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L685] COND TRUE 2 k < 10 [L687] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L697] 0 int condI = i >= (2*10 +6); [L700] 0 int condJ = j >= (2*10 +6); VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L702] COND TRUE 0 condI || condJ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L703] 0 __VERIFIER_error() VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 28.2s, OverallIterations: 32, TraceHistogramMax: 10, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1584 SDtfs, 6287 SDslu, 10815 SDs, 0 SdLazy, 1994 SolverSat, 1149 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3373 GetRequests, 2606 SyntacticMatches, 0 SemanticMatches, 767 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4224 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1013occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 2365 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 3642 NumberOfCodeBlocks, 3642 NumberOfCodeBlocksAsserted, 130 NumberOfCheckSat, 3486 ConstructedInterpolants, 0 QuantifiedInterpolants, 712390 SizeOfPredicates, 391 NumberOfNonLiveVariables, 4235 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 58 InterpolantComputations, 4 PerfectInterpolantSequences, 0/5712 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 proved your program to be incorrect! Received shutdown request...