/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-longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:30:33,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:30:33,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:30:34,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:30:34,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:30:34,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:30:34,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:30:34,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:30:34,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:30:34,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:30:34,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:30:34,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:30:34,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:30:34,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:30:34,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:30:34,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:30:34,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:30:34,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:30:34,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:30:34,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:30:34,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:30:34,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:30:34,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:30:34,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:30:34,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:30:34,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:30:34,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:30:34,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:30:34,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:30:34,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:30:34,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:30:34,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:30:34,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:30:34,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:30:34,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:30:34,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:30:34,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:30:34,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:30:34,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:30:34,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:30:34,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:30:34,038 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:34,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:30:34,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:30:34,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:30:34,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:30:34,066 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:30:34,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:30:34,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:30:34,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:30:34,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:30:34,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:30:34,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:30:34,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:30:34,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:30:34,068 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:30:34,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:30:34,070 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:30:34,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:30:34,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:30:34,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:30:34,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:30:34,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:30:34,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:30:34,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:30:34,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:30:34,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:30:34,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:30:34,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:30:34,073 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:30:34,073 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 23:30:34,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:30:34,074 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:30:34,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:30:34,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:30:34,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:30:34,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:30:34,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:30:34,434 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:30:34,435 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-1.i [2019-12-27 23:30:34,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cde797d1/b08bdf216241485ba1a5a5c924575dc1/FLAGc196afffa [2019-12-27 23:30:35,025 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:30:35,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-1.i [2019-12-27 23:30:35,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cde797d1/b08bdf216241485ba1a5a5c924575dc1/FLAGc196afffa [2019-12-27 23:30:35,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cde797d1/b08bdf216241485ba1a5a5c924575dc1 [2019-12-27 23:30:35,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:30:35,353 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:30:35,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:35,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:30:35,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:30:35,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:35" (1/1) ... [2019-12-27 23:30:35,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de4d4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:35, skipping insertion in model container [2019-12-27 23:30:35,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:30:35" (1/1) ... [2019-12-27 23:30:35,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:30:35,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:30:35,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:35,898 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:30:35,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:30:36,049 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:30:36,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:36 WrapperNode [2019-12-27 23:30:36,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:30:36,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:36,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:30:36,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:30:36,062 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:36" (1/1) ... [2019-12-27 23:30:36,094 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:36" (1/1) ... [2019-12-27 23:30:36,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:30:36,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:30:36,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:30:36,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:30:36,127 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:36" (1/1) ... [2019-12-27 23:30:36,128 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:36" (1/1) ... [2019-12-27 23:30:36,130 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:36" (1/1) ... [2019-12-27 23:30:36,131 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:36" (1/1) ... [2019-12-27 23:30:36,136 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:36" (1/1) ... [2019-12-27 23:30:36,141 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:36" (1/1) ... [2019-12-27 23:30:36,143 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:36" (1/1) ... [2019-12-27 23:30:36,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:30:36,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:30:36,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:30:36,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:30:36,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:36" (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:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-27 23:30:36,201 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-27 23:30:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-27 23:30:36,202 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-27 23:30:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:30:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:30:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:30:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:30:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:30:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:30:36,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:30:36,206 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:36,596 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:30:36,596 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-27 23:30:36,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:36 BoogieIcfgContainer [2019-12-27 23:30:36,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:30:36,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:30:36,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:30:36,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:30:36,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:30:35" (1/3) ... [2019-12-27 23:30:36,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d0a294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:36, skipping insertion in model container [2019-12-27 23:30:36,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:30:36" (2/3) ... [2019-12-27 23:30:36,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d0a294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:30:36, skipping insertion in model container [2019-12-27 23:30:36,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:30:36" (3/3) ... [2019-12-27 23:30:36,606 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2019-12-27 23:30:36,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:30:36,616 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:30:36,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 23:30:36,623 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:30:36,646 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,647 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,647 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,647 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,648 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,648 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,648 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,649 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,649 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,649 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,650 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,650 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,650 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,650 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,651 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,651 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,651 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,652 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,652 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,652 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,653 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,653 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,653 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,654 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,654 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,654 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,654 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,655 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,659 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,659 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,659 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,660 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,660 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,660 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,673 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,673 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,673 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,674 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,674 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,674 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:30:36,690 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-27 23:30:36,711 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:30:36,711 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:30:36,712 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:30:36,712 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:30:36,712 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:30:36,712 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:30:36,712 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:30:36,712 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:30:36,725 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 51 transitions [2019-12-27 23:30:36,804 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1013 states. [2019-12-27 23:30:36,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states. [2019-12-27 23:30:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 23:30:36,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:36,820 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:36,820 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash -910010, now seen corresponding path program 1 times [2019-12-27 23:30:36,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:36,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058877319] [2019-12-27 23:30:36,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:37,248 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:37,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058877319] [2019-12-27 23:30:37,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:37,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:37,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [463549131] [2019-12-27 23:30:37,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:37,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:37,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 23:30:37,280 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:37,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:37,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:37,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:37,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:37,302 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand 5 states. [2019-12-27 23:30:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:37,481 INFO L93 Difference]: Finished difference Result 1778 states and 5126 transitions. [2019-12-27 23:30:37,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:30:37,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 23:30:37,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:37,511 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 23:30:37,511 INFO L226 Difference]: Without dead ends: 500 [2019-12-27 23:30:37,513 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:37,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-27 23:30:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 388. [2019-12-27 23:30:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-27 23:30:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 993 transitions. [2019-12-27 23:30:37,614 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 993 transitions. Word has length 20 [2019-12-27 23:30:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:37,615 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 993 transitions. [2019-12-27 23:30:37,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 993 transitions. [2019-12-27 23:30:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:37,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:37,618 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:37,619 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:37,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash 723642448, now seen corresponding path program 1 times [2019-12-27 23:30:37,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:37,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670377667] [2019-12-27 23:30:37,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:37,793 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:37,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670377667] [2019-12-27 23:30:37,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:37,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:37,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614557751] [2019-12-27 23:30:37,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:37,798 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:37,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 41 transitions. [2019-12-27 23:30:37,804 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:37,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 23:30:37,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:37,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:37,840 INFO L87 Difference]: Start difference. First operand 388 states and 993 transitions. Second operand 5 states. [2019-12-27 23:30:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:37,965 INFO L93 Difference]: Finished difference Result 465 states and 1147 transitions. [2019-12-27 23:30:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:37,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:37,971 INFO L225 Difference]: With dead ends: 465 [2019-12-27 23:30:37,971 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 23:30:37,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 23:30:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 320. [2019-12-27 23:30:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 23:30:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 815 transitions. [2019-12-27 23:30:38,030 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 815 transitions. Word has length 23 [2019-12-27 23:30:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,031 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 815 transitions. [2019-12-27 23:30:38,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:38,031 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 815 transitions. [2019-12-27 23:30:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 23:30:38,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,034 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:38,034 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:38,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash -660572760, now seen corresponding path program 1 times [2019-12-27 23:30:38,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024312932] [2019-12-27 23:30:38,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:38,230 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:38,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024312932] [2019-12-27 23:30:38,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:38,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:30:38,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753538458] [2019-12-27 23:30:38,232 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:38,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:38,239 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 23:30:38,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:38,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:30:38,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:30:38,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:30:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:30:38,243 INFO L87 Difference]: Start difference. First operand 320 states and 815 transitions. Second operand 5 states. [2019-12-27 23:30:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:38,337 INFO L93 Difference]: Finished difference Result 421 states and 1017 transitions. [2019-12-27 23:30:38,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 23:30:38,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 23:30:38,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:38,341 INFO L225 Difference]: With dead ends: 421 [2019-12-27 23:30:38,341 INFO L226 Difference]: Without dead ends: 291 [2019-12-27 23:30:38,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:30:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-27 23:30:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2019-12-27 23:30:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-27 23:30:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 715 transitions. [2019-12-27 23:30:38,363 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 715 transitions. Word has length 23 [2019-12-27 23:30:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,364 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 715 transitions. [2019-12-27 23:30:38,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:30:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 715 transitions. [2019-12-27 23:30:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:30:38,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,369 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:38,370 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash -962769584, now seen corresponding path program 1 times [2019-12-27 23:30:38,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876508433] [2019-12-27 23:30:38,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:38,512 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:38,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876508433] [2019-12-27 23:30:38,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:38,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:30:38,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1497482154] [2019-12-27 23:30:38,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:38,517 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:38,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 50 transitions. [2019-12-27 23:30:38,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:38,528 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:30:38,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:30:38,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:38,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:30:38,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:38,530 INFO L87 Difference]: Start difference. First operand 291 states and 715 transitions. Second operand 6 states. [2019-12-27 23:30:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:38,669 INFO L93 Difference]: Finished difference Result 438 states and 1058 transitions. [2019-12-27 23:30:38,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:38,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 23:30:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:38,673 INFO L225 Difference]: With dead ends: 438 [2019-12-27 23:30:38,673 INFO L226 Difference]: Without dead ends: 310 [2019-12-27 23:30:38,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-27 23:30:38,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 300. [2019-12-27 23:30:38,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-12-27 23:30:38,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 733 transitions. [2019-12-27 23:30:38,686 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 733 transitions. Word has length 26 [2019-12-27 23:30:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,687 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 733 transitions. [2019-12-27 23:30:38,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:30:38,687 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 733 transitions. [2019-12-27 23:30:38,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:30:38,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,689 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:38,689 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:38,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash -971706884, now seen corresponding path program 2 times [2019-12-27 23:30:38,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292799003] [2019-12-27 23:30:38,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:38,822 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:38,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292799003] [2019-12-27 23:30:38,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:30:38,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:30:38,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1239640073] [2019-12-27 23:30:38,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:38,833 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:38,842 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 56 transitions. [2019-12-27 23:30:38,842 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:38,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:30:38,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 23:30:38,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 23:30:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:30:38,848 INFO L87 Difference]: Start difference. First operand 300 states and 733 transitions. Second operand 6 states. [2019-12-27 23:30:38,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:38,951 INFO L93 Difference]: Finished difference Result 457 states and 1096 transitions. [2019-12-27 23:30:38,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 23:30:38,951 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 23:30:38,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:38,954 INFO L225 Difference]: With dead ends: 457 [2019-12-27 23:30:38,954 INFO L226 Difference]: Without dead ends: 320 [2019-12-27 23:30:38,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-12-27 23:30:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-12-27 23:30:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 23:30:38,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 773 transitions. [2019-12-27 23:30:38,966 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 773 transitions. Word has length 26 [2019-12-27 23:30:38,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:38,967 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 773 transitions. [2019-12-27 23:30:38,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 23:30:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 773 transitions. [2019-12-27 23:30:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:30:38,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:38,968 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:38,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:38,969 INFO L82 PathProgramCache]: Analyzing trace with hash -327915495, now seen corresponding path program 1 times [2019-12-27 23:30:38,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:38,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128803840] [2019-12-27 23:30:38,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,116 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:39,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128803840] [2019-12-27 23:30:39,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571182257] [2019-12-27 23:30:39,118 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:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,216 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:30:39,222 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:39,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,277 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:39,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:39,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 23:30:39,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410651827] [2019-12-27 23:30:39,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:39,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:39,291 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 72 transitions. [2019-12-27 23:30:39,292 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:39,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 23:30:39,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:39,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:39,297 INFO L87 Difference]: Start difference. First operand 320 states and 773 transitions. Second operand 7 states. [2019-12-27 23:30:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:39,482 INFO L93 Difference]: Finished difference Result 467 states and 1116 transitions. [2019-12-27 23:30:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:30:39,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 23:30:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:39,487 INFO L225 Difference]: With dead ends: 467 [2019-12-27 23:30:39,487 INFO L226 Difference]: Without dead ends: 336 [2019-12-27 23:30:39,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-12-27 23:30:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 301. [2019-12-27 23:30:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-12-27 23:30:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 735 transitions. [2019-12-27 23:30:39,499 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 735 transitions. Word has length 30 [2019-12-27 23:30:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:39,500 INFO L462 AbstractCegarLoop]: Abstraction has 301 states and 735 transitions. [2019-12-27 23:30:39,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 735 transitions. [2019-12-27 23:30:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 23:30:39,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:39,503 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:39,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:39,708 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash -243930643, now seen corresponding path program 1 times [2019-12-27 23:30:39,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:39,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603296377] [2019-12-27 23:30:39,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,797 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:39,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603296377] [2019-12-27 23:30:39,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191790741] [2019-12-27 23:30:39,798 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:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:39,910 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 23:30:39,914 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:39,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:39,945 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:39,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:39,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-27 23:30:39,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [163046952] [2019-12-27 23:30:39,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:39,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:39,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 96 transitions. [2019-12-27 23:30:39,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:39,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:39,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:30:39,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:30:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 23:30:39,968 INFO L87 Difference]: Start difference. First operand 301 states and 735 transitions. Second operand 7 states. [2019-12-27 23:30:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:40,048 INFO L93 Difference]: Finished difference Result 483 states and 1148 transitions. [2019-12-27 23:30:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 23:30:40,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-27 23:30:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:40,051 INFO L225 Difference]: With dead ends: 483 [2019-12-27 23:30:40,051 INFO L226 Difference]: Without dead ends: 352 [2019-12-27 23:30:40,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-27 23:30:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-12-27 23:30:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-27 23:30:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 837 transitions. [2019-12-27 23:30:40,066 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 837 transitions. Word has length 30 [2019-12-27 23:30:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:40,066 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 837 transitions. [2019-12-27 23:30:40,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:30:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 837 transitions. [2019-12-27 23:30:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 23:30:40,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:40,071 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:40,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:40,274 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1994322550, now seen corresponding path program 1 times [2019-12-27 23:30:40,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:40,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641357330] [2019-12-27 23:30:40,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:40,396 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:40,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641357330] [2019-12-27 23:30:40,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754153519] [2019-12-27 23:30:40,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:40,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:30:40,456 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:40,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:40,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:40,483 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:40,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:40,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 23:30:40,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1473894244] [2019-12-27 23:30:40,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:40,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:40,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 100 transitions. [2019-12-27 23:30:40,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:40,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 23:30:40,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:30:40,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:30:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:40,508 INFO L87 Difference]: Start difference. First operand 352 states and 837 transitions. Second operand 8 states. [2019-12-27 23:30:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:40,672 INFO L93 Difference]: Finished difference Result 499 states and 1180 transitions. [2019-12-27 23:30:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:40,672 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 23:30:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:40,676 INFO L225 Difference]: With dead ends: 499 [2019-12-27 23:30:40,676 INFO L226 Difference]: Without dead ends: 368 [2019-12-27 23:30:40,677 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:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-27 23:30:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 317. [2019-12-27 23:30:40,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 23:30:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 767 transitions. [2019-12-27 23:30:40,687 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 767 transitions. Word has length 34 [2019-12-27 23:30:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:40,689 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 767 transitions. [2019-12-27 23:30:40,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:30:40,689 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 767 transitions. [2019-12-27 23:30:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 23:30:40,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:40,690 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:40,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:40,895 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:40,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1975292362, now seen corresponding path program 2 times [2019-12-27 23:30:40,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:40,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677135743] [2019-12-27 23:30:40,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:41,041 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:41,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677135743] [2019-12-27 23:30:41,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037213986] [2019-12-27 23:30:41,042 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:41,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:41,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:41,105 INFO L264 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-27 23:30:41,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:41,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,132 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:41,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:41,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-27 23:30:41,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1690159487] [2019-12-27 23:30:41,133 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:41,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:41,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 124 transitions. [2019-12-27 23:30:41,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:41,153 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:41,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 23:30:41,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:41,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 23:30:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:30:41,154 INFO L87 Difference]: Start difference. First operand 317 states and 767 transitions. Second operand 8 states. [2019-12-27 23:30:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:41,276 INFO L93 Difference]: Finished difference Result 515 states and 1212 transitions. [2019-12-27 23:30:41,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:30:41,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-27 23:30:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:41,280 INFO L225 Difference]: With dead ends: 515 [2019-12-27 23:30:41,280 INFO L226 Difference]: Without dead ends: 384 [2019-12-27 23:30:41,280 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:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-12-27 23:30:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2019-12-27 23:30:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-12-27 23:30:41,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 901 transitions. [2019-12-27 23:30:41,292 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 901 transitions. Word has length 34 [2019-12-27 23:30:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:41,292 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 901 transitions. [2019-12-27 23:30:41,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 23:30:41,293 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 901 transitions. [2019-12-27 23:30:41,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:41,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:41,294 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:41,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:41,499 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:41,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1246329683, now seen corresponding path program 3 times [2019-12-27 23:30:41,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:41,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443720851] [2019-12-27 23:30:41,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:41,610 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:41,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443720851] [2019-12-27 23:30:41,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162430778] [2019-12-27 23:30:41,611 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:41,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 23:30:41,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:41,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:30:41,678 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:41,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:41,710 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:41,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:41,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:41,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253439953] [2019-12-27 23:30:41,711 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:41,716 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:41,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 128 transitions. [2019-12-27 23:30:41,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:41,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 23:30:41,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:41,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:41,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:41,734 INFO L87 Difference]: Start difference. First operand 384 states and 901 transitions. Second operand 9 states. [2019-12-27 23:30:41,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:41,899 INFO L93 Difference]: Finished difference Result 531 states and 1244 transitions. [2019-12-27 23:30:41,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 23:30:41,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:41,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:41,903 INFO L225 Difference]: With dead ends: 531 [2019-12-27 23:30:41,903 INFO L226 Difference]: Without dead ends: 400 [2019-12-27 23:30:41,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-12-27 23:30:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 333. [2019-12-27 23:30:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-27 23:30:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 799 transitions. [2019-12-27 23:30:41,916 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 799 transitions. Word has length 38 [2019-12-27 23:30:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:41,917 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 799 transitions. [2019-12-27 23:30:41,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 799 transitions. [2019-12-27 23:30:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 23:30:41,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:41,918 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:42,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:42,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash -40518361, now seen corresponding path program 4 times [2019-12-27 23:30:42,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:42,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826768881] [2019-12-27 23:30:42,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,237 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:42,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826768881] [2019-12-27 23:30:42,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553929523] [2019-12-27 23:30:42,238 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:42,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:42,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:42,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-27 23:30:42,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:42,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,313 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:42,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:42,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-27 23:30:42,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109615699] [2019-12-27 23:30:42,314 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:42,318 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:42,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 152 transitions. [2019-12-27 23:30:42,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:42,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:42,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:30:42,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:30:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:30:42,338 INFO L87 Difference]: Start difference. First operand 333 states and 799 transitions. Second operand 9 states. [2019-12-27 23:30:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:42,449 INFO L93 Difference]: Finished difference Result 547 states and 1276 transitions. [2019-12-27 23:30:42,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 23:30:42,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 23:30:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:42,453 INFO L225 Difference]: With dead ends: 547 [2019-12-27 23:30:42,453 INFO L226 Difference]: Without dead ends: 416 [2019-12-27 23:30:42,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-27 23:30:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2019-12-27 23:30:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-12-27 23:30:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 965 transitions. [2019-12-27 23:30:42,467 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 965 transitions. Word has length 38 [2019-12-27 23:30:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:42,467 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 965 transitions. [2019-12-27 23:30:42,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:30:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 965 transitions. [2019-12-27 23:30:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:30:42,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:42,468 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:42,672 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:42,673 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:42,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash 57013188, now seen corresponding path program 5 times [2019-12-27 23:30:42,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:42,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434373080] [2019-12-27 23:30:42,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:42,766 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:42,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434373080] [2019-12-27 23:30:42,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786970166] [2019-12-27 23:30:42,767 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:42,814 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-12-27 23:30:42,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:42,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:30:42,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:42,867 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:42,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:42,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 23:30:42,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [125159872] [2019-12-27 23:30:42,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:42,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:42,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 156 transitions. [2019-12-27 23:30:42,886 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:42,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 23:30:42,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:42,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:42,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:42,891 INFO L87 Difference]: Start difference. First operand 416 states and 965 transitions. Second operand 10 states. [2019-12-27 23:30:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:43,054 INFO L93 Difference]: Finished difference Result 563 states and 1308 transitions. [2019-12-27 23:30:43,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 23:30:43,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-12-27 23:30:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:43,057 INFO L225 Difference]: With dead ends: 563 [2019-12-27 23:30:43,057 INFO L226 Difference]: Without dead ends: 432 [2019-12-27 23:30:43,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:30:43,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-27 23:30:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 349. [2019-12-27 23:30:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-12-27 23:30:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 831 transitions. [2019-12-27 23:30:43,068 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 831 transitions. Word has length 42 [2019-12-27 23:30:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:43,068 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 831 transitions. [2019-12-27 23:30:43,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 831 transitions. [2019-12-27 23:30:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:30:43,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:43,069 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:43,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:43,278 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:43,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash 259200112, now seen corresponding path program 6 times [2019-12-27 23:30:43,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:43,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031168678] [2019-12-27 23:30:43,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:43,370 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:43,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031168678] [2019-12-27 23:30:43,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473654760] [2019-12-27 23:30:43,371 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:43,425 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-27 23:30:43,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:43,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-27 23:30:43,432 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:43,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:43,462 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:43,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:43,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-27 23:30:43,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1886499183] [2019-12-27 23:30:43,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:43,470 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:43,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 112 states and 180 transitions. [2019-12-27 23:30:43,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:43,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:30:43,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 23:30:43,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:43,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 23:30:43,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:30:43,500 INFO L87 Difference]: Start difference. First operand 349 states and 831 transitions. Second operand 10 states. [2019-12-27 23:30:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:43,699 INFO L93 Difference]: Finished difference Result 677 states and 1585 transitions. [2019-12-27 23:30:43,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:30:43,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-12-27 23:30:43,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:43,703 INFO L225 Difference]: With dead ends: 677 [2019-12-27 23:30:43,704 INFO L226 Difference]: Without dead ends: 464 [2019-12-27 23:30:43,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-12-27 23:30:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 362. [2019-12-27 23:30:43,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-27 23:30:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 857 transitions. [2019-12-27 23:30:43,715 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 857 transitions. Word has length 42 [2019-12-27 23:30:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:43,715 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 857 transitions. [2019-12-27 23:30:43,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 23:30:43,715 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 857 transitions. [2019-12-27 23:30:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 23:30:43,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:43,716 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:43,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:43,920 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1361267571, now seen corresponding path program 7 times [2019-12-27 23:30:43,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:43,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161498147] [2019-12-27 23:30:43,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:44,023 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:44,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161498147] [2019-12-27 23:30:44,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273242042] [2019-12-27 23:30:44,023 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 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:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:44,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-27 23:30:44,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,109 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:44,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:44,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-27 23:30:44,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1707147177] [2019-12-27 23:30:44,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:44,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:44,156 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 184 transitions. [2019-12-27 23:30:44,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:44,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 23:30:44,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:30:44,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:44,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:30:44,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-27 23:30:44,160 INFO L87 Difference]: Start difference. First operand 362 states and 857 transitions. Second operand 11 states. [2019-12-27 23:30:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:44,454 INFO L93 Difference]: Finished difference Result 709 states and 1649 transitions. [2019-12-27 23:30:44,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:44,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-12-27 23:30:44,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:44,458 INFO L225 Difference]: With dead ends: 709 [2019-12-27 23:30:44,458 INFO L226 Difference]: Without dead ends: 496 [2019-12-27 23:30:44,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:30:44,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-12-27 23:30:44,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 381. [2019-12-27 23:30:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-12-27 23:30:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 895 transitions. [2019-12-27 23:30:44,470 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 895 transitions. Word has length 46 [2019-12-27 23:30:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:44,470 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 895 transitions. [2019-12-27 23:30:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:30:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 895 transitions. [2019-12-27 23:30:44,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 23:30:44,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:44,471 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:44,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:44,675 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:44,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:44,675 INFO L82 PathProgramCache]: Analyzing trace with hash -316809046, now seen corresponding path program 8 times [2019-12-27 23:30:44,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:44,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688741489] [2019-12-27 23:30:44,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:44,798 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:44,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688741489] [2019-12-27 23:30:44,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225190902] [2019-12-27 23:30:44,799 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:44,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:44,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:44,856 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-27 23:30:44,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:44,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:44,884 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:44,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:44,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-27 23:30:44,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2058550607] [2019-12-27 23:30:44,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:44,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:44,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 144 states and 236 transitions. [2019-12-27 23:30:44,928 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:44,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:30:44,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 23:30:44,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 23:30:44,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:30:44,942 INFO L87 Difference]: Start difference. First operand 381 states and 895 transitions. Second operand 12 states. [2019-12-27 23:30:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:45,167 INFO L93 Difference]: Finished difference Result 643 states and 1468 transitions. [2019-12-27 23:30:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 23:30:45,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-27 23:30:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:45,170 INFO L225 Difference]: With dead ends: 643 [2019-12-27 23:30:45,171 INFO L226 Difference]: Without dead ends: 512 [2019-12-27 23:30:45,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:30:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-12-27 23:30:45,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-12-27 23:30:45,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-12-27 23:30:45,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1157 transitions. [2019-12-27 23:30:45,182 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 1157 transitions. Word has length 50 [2019-12-27 23:30:45,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:45,183 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 1157 transitions. [2019-12-27 23:30:45,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 23:30:45,183 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 1157 transitions. [2019-12-27 23:30:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 23:30:45,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:45,184 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:45,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:45,395 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1532488761, now seen corresponding path program 9 times [2019-12-27 23:30:45,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:45,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089148497] [2019-12-27 23:30:45,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:45,529 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:45,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089148497] [2019-12-27 23:30:45,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030272538] [2019-12-27 23:30:45,530 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:45,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-27 23:30:45,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:45,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:45,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:45,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:45,609 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:45,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:45,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 23:30:45,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1750185084] [2019-12-27 23:30:45,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:45,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:45,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 148 states and 240 transitions. [2019-12-27 23:30:45,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:45,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 23 times. [2019-12-27 23:30:45,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:30:45,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:45,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:30:45,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:45,661 INFO L87 Difference]: Start difference. First operand 512 states and 1157 transitions. Second operand 13 states. [2019-12-27 23:30:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:45,890 INFO L93 Difference]: Finished difference Result 659 states and 1500 transitions. [2019-12-27 23:30:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 23:30:45,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 23:30:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:45,894 INFO L225 Difference]: With dead ends: 659 [2019-12-27 23:30:45,894 INFO L226 Difference]: Without dead ends: 528 [2019-12-27 23:30:45,895 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:45,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-27 23:30:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 397. [2019-12-27 23:30:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-27 23:30:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 927 transitions. [2019-12-27 23:30:45,904 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 927 transitions. Word has length 54 [2019-12-27 23:30:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:45,905 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 927 transitions. [2019-12-27 23:30:45,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:30:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 927 transitions. [2019-12-27 23:30:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 23:30:45,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:45,906 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:46,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:46,110 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1337338469, now seen corresponding path program 10 times [2019-12-27 23:30:46,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:46,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506235815] [2019-12-27 23:30:46,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:46,247 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:46,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506235815] [2019-12-27 23:30:46,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853925788] [2019-12-27 23:30:46,248 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 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:46,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:46,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:46,343 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-27 23:30:46,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:46,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:46,369 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:46,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:46,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-27 23:30:46,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [804447620] [2019-12-27 23:30:46,369 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:46,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:46,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 264 transitions. [2019-12-27 23:30:46,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:46,422 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 23:30:46,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:30:46,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:30:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 23:30:46,423 INFO L87 Difference]: Start difference. First operand 397 states and 927 transitions. Second operand 13 states. [2019-12-27 23:30:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:46,666 INFO L93 Difference]: Finished difference Result 675 states and 1532 transitions. [2019-12-27 23:30:46,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 23:30:46,667 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 23:30:46,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:46,669 INFO L225 Difference]: With dead ends: 675 [2019-12-27 23:30:46,669 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 23:30:46,670 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:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 23:30:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2019-12-27 23:30:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-27 23:30:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1221 transitions. [2019-12-27 23:30:46,680 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1221 transitions. Word has length 54 [2019-12-27 23:30:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:46,681 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 1221 transitions. [2019-12-27 23:30:46,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:30:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1221 transitions. [2019-12-27 23:30:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:46,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:46,682 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:46,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:46,885 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:46,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:46,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1662726712, now seen corresponding path program 11 times [2019-12-27 23:30:46,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:46,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125918503] [2019-12-27 23:30:46,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:47,043 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:47,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125918503] [2019-12-27 23:30:47,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494116091] [2019-12-27 23:30:47,044 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 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:47,098 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-27 23:30:47,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:47,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:30:47,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:47,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,132 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:47,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:47,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 23:30:47,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744644049] [2019-12-27 23:30:47,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:47,146 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:47,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 268 transitions. [2019-12-27 23:30:47,225 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:47,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 23:30:47,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:47,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:47,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:47,231 INFO L87 Difference]: Start difference. First operand 544 states and 1221 transitions. Second operand 14 states. [2019-12-27 23:30:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:47,465 INFO L93 Difference]: Finished difference Result 691 states and 1564 transitions. [2019-12-27 23:30:47,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 23:30:47,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 23:30:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:47,470 INFO L225 Difference]: With dead ends: 691 [2019-12-27 23:30:47,470 INFO L226 Difference]: Without dead ends: 560 [2019-12-27 23:30:47,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:30:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-12-27 23:30:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 413. [2019-12-27 23:30:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-27 23:30:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 959 transitions. [2019-12-27 23:30:47,482 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 959 transitions. Word has length 58 [2019-12-27 23:30:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:47,482 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 959 transitions. [2019-12-27 23:30:47,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 959 transitions. [2019-12-27 23:30:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 23:30:47,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:47,483 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:47,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:47,688 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1598172444, now seen corresponding path program 12 times [2019-12-27 23:30:47,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:47,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791536001] [2019-12-27 23:30:47,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:47,829 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:47,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791536001] [2019-12-27 23:30:47,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544501676] [2019-12-27 23:30:47,830 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 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:47,891 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-27 23:30:47,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:47,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-27 23:30:47,893 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:47,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:47,921 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:47,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:47,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-27 23:30:47,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1051956467] [2019-12-27 23:30:47,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:47,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:47,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 292 transitions. [2019-12-27 23:30:47,972 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:47,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 23:30:47,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 23:30:47,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:47,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 23:30:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-12-27 23:30:47,976 INFO L87 Difference]: Start difference. First operand 413 states and 959 transitions. Second operand 14 states. [2019-12-27 23:30:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:48,310 INFO L93 Difference]: Finished difference Result 805 states and 1841 transitions. [2019-12-27 23:30:48,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:30:48,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-12-27 23:30:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:48,312 INFO L225 Difference]: With dead ends: 805 [2019-12-27 23:30:48,312 INFO L226 Difference]: Without dead ends: 592 [2019-12-27 23:30:48,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:30:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-12-27 23:30:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 426. [2019-12-27 23:30:48,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-27 23:30:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 985 transitions. [2019-12-27 23:30:48,322 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 985 transitions. Word has length 58 [2019-12-27 23:30:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:48,323 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 985 transitions. [2019-12-27 23:30:48,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 23:30:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 985 transitions. [2019-12-27 23:30:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-27 23:30:48,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:48,324 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:48,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:48,536 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:48,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1675257599, now seen corresponding path program 13 times [2019-12-27 23:30:48,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:48,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682857077] [2019-12-27 23:30:48,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:48,679 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:48,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682857077] [2019-12-27 23:30:48,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680441641] [2019-12-27 23:30:48,680 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 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:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:48,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-27 23:30:48,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:48,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:48,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:48,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:48,762 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:48,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:48,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-27 23:30:48,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620456552] [2019-12-27 23:30:48,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:48,773 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:48,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 296 transitions. [2019-12-27 23:30:48,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:48,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 23:30:48,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 23:30:48,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:48,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 23:30:48,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:30:48,832 INFO L87 Difference]: Start difference. First operand 426 states and 985 transitions. Second operand 15 states. [2019-12-27 23:30:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:49,113 INFO L93 Difference]: Finished difference Result 739 states and 1660 transitions. [2019-12-27 23:30:49,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:30:49,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2019-12-27 23:30:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:49,122 INFO L225 Difference]: With dead ends: 739 [2019-12-27 23:30:49,122 INFO L226 Difference]: Without dead ends: 608 [2019-12-27 23:30:49,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=572, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:30:49,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-27 23:30:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-12-27 23:30:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-12-27 23:30:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1349 transitions. [2019-12-27 23:30:49,135 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1349 transitions. Word has length 62 [2019-12-27 23:30:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:49,135 INFO L462 AbstractCegarLoop]: Abstraction has 608 states and 1349 transitions. [2019-12-27 23:30:49,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 23:30:49,135 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1349 transitions. [2019-12-27 23:30:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 23:30:49,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:49,138 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:49,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:49,342 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:49,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1451259278, now seen corresponding path program 14 times [2019-12-27 23:30:49,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:49,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852923878] [2019-12-27 23:30:49,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:49,547 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:49,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852923878] [2019-12-27 23:30:49,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011537726] [2019-12-27 23:30:49,548 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 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:49,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:49,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:49,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 23:30:49,615 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:49,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:49,650 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:49,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:49,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 23:30:49,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [428968686] [2019-12-27 23:30:49,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:49,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:49,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 196 states and 324 transitions. [2019-12-27 23:30:49,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:49,733 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 23:30:49,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:49,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:49,734 INFO L87 Difference]: Start difference. First operand 608 states and 1349 transitions. Second operand 16 states. [2019-12-27 23:30:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:50,050 INFO L93 Difference]: Finished difference Result 755 states and 1692 transitions. [2019-12-27 23:30:50,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:30:50,050 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 23:30:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:50,053 INFO L225 Difference]: With dead ends: 755 [2019-12-27 23:30:50,053 INFO L226 Difference]: Without dead ends: 624 [2019-12-27 23:30:50,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=275, Invalid=655, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:30:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-12-27 23:30:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 445. [2019-12-27 23:30:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-27 23:30:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1023 transitions. [2019-12-27 23:30:50,064 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1023 transitions. Word has length 66 [2019-12-27 23:30:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:50,064 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 1023 transitions. [2019-12-27 23:30:50,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:30:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1023 transitions. [2019-12-27 23:30:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 23:30:50,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:50,066 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:50,270 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:50,270 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:50,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1915950306, now seen corresponding path program 15 times [2019-12-27 23:30:50,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:50,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327599505] [2019-12-27 23:30:50,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:50,439 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:50,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327599505] [2019-12-27 23:30:50,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877119903] [2019-12-27 23:30:50,440 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 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:50,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-27 23:30:50,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:50,512 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-27 23:30:50,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:50,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:50,589 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:50,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:50,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-27 23:30:50,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1134481935] [2019-12-27 23:30:50,592 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:50,603 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:50,685 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 348 transitions. [2019-12-27 23:30:50,685 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:50,689 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 23:30:50,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:30:50,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:50,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:30:50,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-12-27 23:30:50,691 INFO L87 Difference]: Start difference. First operand 445 states and 1023 transitions. Second operand 16 states. [2019-12-27 23:30:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:51,007 INFO L93 Difference]: Finished difference Result 771 states and 1724 transitions. [2019-12-27 23:30:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 23:30:51,007 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 23:30:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:51,010 INFO L225 Difference]: With dead ends: 771 [2019-12-27 23:30:51,010 INFO L226 Difference]: Without dead ends: 640 [2019-12-27 23:30:51,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=250, Invalid=620, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:30:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-27 23:30:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 640. [2019-12-27 23:30:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-27 23:30:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1413 transitions. [2019-12-27 23:30:51,022 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1413 transitions. Word has length 66 [2019-12-27 23:30:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:51,022 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1413 transitions. [2019-12-27 23:30:51,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:30:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1413 transitions. [2019-12-27 23:30:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 23:30:51,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:51,024 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:51,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:51,227 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash -338738117, now seen corresponding path program 16 times [2019-12-27 23:30:51,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:51,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542574095] [2019-12-27 23:30:51,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:51,383 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:51,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542574095] [2019-12-27 23:30:51,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685138540] [2019-12-27 23:30:51,383 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 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:51,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:51,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:51,435 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 23:30:51,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:51,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:51,481 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:51,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:51,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 23:30:51,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96733511] [2019-12-27 23:30:51,482 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:51,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:51,602 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 352 transitions. [2019-12-27 23:30:51,602 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:51,606 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 23:30:51,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:30:51,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:51,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:30:51,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:30:51,607 INFO L87 Difference]: Start difference. First operand 640 states and 1413 transitions. Second operand 17 states. [2019-12-27 23:30:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:51,967 INFO L93 Difference]: Finished difference Result 787 states and 1756 transitions. [2019-12-27 23:30:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:30:51,967 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-12-27 23:30:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:51,971 INFO L225 Difference]: With dead ends: 787 [2019-12-27 23:30:51,972 INFO L226 Difference]: Without dead ends: 656 [2019-12-27 23:30:51,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:30:51,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2019-12-27 23:30:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 461. [2019-12-27 23:30:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-27 23:30:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1055 transitions. [2019-12-27 23:30:51,982 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1055 transitions. Word has length 70 [2019-12-27 23:30:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:51,983 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1055 transitions. [2019-12-27 23:30:51,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:30:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1055 transitions. [2019-12-27 23:30:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 23:30:51,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:51,984 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:52,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:52,188 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:52,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:52,189 INFO L82 PathProgramCache]: Analyzing trace with hash -188316145, now seen corresponding path program 17 times [2019-12-27 23:30:52,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:52,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628248845] [2019-12-27 23:30:52,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:52,352 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:52,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628248845] [2019-12-27 23:30:52,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748784924] [2019-12-27 23:30:52,353 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 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:52,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-27 23:30:52,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:52,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-27 23:30:52,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:52,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:52,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:52,458 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:52,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:52,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-27 23:30:52,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [430533993] [2019-12-27 23:30:52,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:52,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:52,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 376 transitions. [2019-12-27 23:30:52,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:52,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 23:30:52,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 23:30:52,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:52,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 23:30:52,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 23:30:52,837 INFO L87 Difference]: Start difference. First operand 461 states and 1055 transitions. Second operand 17 states. [2019-12-27 23:30:53,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:53,186 INFO L93 Difference]: Finished difference Result 803 states and 1788 transitions. [2019-12-27 23:30:53,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 23:30:53,187 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-12-27 23:30:53,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:53,191 INFO L225 Difference]: With dead ends: 803 [2019-12-27 23:30:53,191 INFO L226 Difference]: Without dead ends: 672 [2019-12-27 23:30:53,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:30:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-27 23:30:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2019-12-27 23:30:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2019-12-27 23:30:53,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1477 transitions. [2019-12-27 23:30:53,206 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1477 transitions. Word has length 70 [2019-12-27 23:30:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:53,206 INFO L462 AbstractCegarLoop]: Abstraction has 672 states and 1477 transitions. [2019-12-27 23:30:53,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 23:30:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1477 transitions. [2019-12-27 23:30:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 23:30:53,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:53,208 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:53,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:53,420 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:53,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:53,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1770850476, now seen corresponding path program 18 times [2019-12-27 23:30:53,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:53,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34649874] [2019-12-27 23:30:53,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:53,575 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:53,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34649874] [2019-12-27 23:30:53,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960248998] [2019-12-27 23:30:53,575 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 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:53,634 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-27 23:30:53,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:53,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 23:30:53,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:53,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:53,663 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:53,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:53,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 23:30:53,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [102409523] [2019-12-27 23:30:53,664 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:53,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:53,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 380 transitions. [2019-12-27 23:30:53,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:53,764 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 23:30:53,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:30:53,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:53,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:30:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:53,765 INFO L87 Difference]: Start difference. First operand 672 states and 1477 transitions. Second operand 18 states. [2019-12-27 23:30:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:54,127 INFO L93 Difference]: Finished difference Result 819 states and 1820 transitions. [2019-12-27 23:30:54,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:54,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2019-12-27 23:30:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:54,130 INFO L225 Difference]: With dead ends: 819 [2019-12-27 23:30:54,130 INFO L226 Difference]: Without dead ends: 688 [2019-12-27 23:30:54,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=334, Invalid=788, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:30:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-12-27 23:30:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 477. [2019-12-27 23:30:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-12-27 23:30:54,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1087 transitions. [2019-12-27 23:30:54,143 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 1087 transitions. Word has length 74 [2019-12-27 23:30:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:54,143 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 1087 transitions. [2019-12-27 23:30:54,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:30:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 1087 transitions. [2019-12-27 23:30:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 23:30:54,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:54,146 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:54,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:54,349 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash -37410472, now seen corresponding path program 19 times [2019-12-27 23:30:54,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:54,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662038309] [2019-12-27 23:30:54,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:54,523 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:54,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662038309] [2019-12-27 23:30:54,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523735927] [2019-12-27 23:30:54,524 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 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:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:54,577 INFO L264 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-27 23:30:54,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:54,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:54,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:54,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:54,609 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:54,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:54,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-27 23:30:54,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1708358554] [2019-12-27 23:30:54,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:54,622 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:54,722 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 404 transitions. [2019-12-27 23:30:54,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:54,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 23:30:54,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 23:30:54,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 23:30:54,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 23:30:54,728 INFO L87 Difference]: Start difference. First operand 477 states and 1087 transitions. Second operand 18 states. [2019-12-27 23:30:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:55,104 INFO L93 Difference]: Finished difference Result 835 states and 1852 transitions. [2019-12-27 23:30:55,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 23:30:55,104 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 74 [2019-12-27 23:30:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:55,108 INFO L225 Difference]: With dead ends: 835 [2019-12-27 23:30:55,108 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 23:30:55,109 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:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 23:30:55,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2019-12-27 23:30:55,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-12-27 23:30:55,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1541 transitions. [2019-12-27 23:30:55,121 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1541 transitions. Word has length 74 [2019-12-27 23:30:55,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:55,121 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1541 transitions. [2019-12-27 23:30:55,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 23:30:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1541 transitions. [2019-12-27 23:30:55,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 23:30:55,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:55,125 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:55,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:55,329 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:55,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:55,329 INFO L82 PathProgramCache]: Analyzing trace with hash -803269259, now seen corresponding path program 20 times [2019-12-27 23:30:55,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:55,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668191340] [2019-12-27 23:30:55,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:55,538 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:55,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668191340] [2019-12-27 23:30:55,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764353701] [2019-12-27 23:30:55,539 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 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:55,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:30:55,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:55,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-27 23:30:55,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:55,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:55,650 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:55,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:55,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 23:30:55,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1537629663] [2019-12-27 23:30:55,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:55,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:55,775 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 408 transitions. [2019-12-27 23:30:55,775 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:55,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 23:30:55,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:30:55,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:30:55,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:55,781 INFO L87 Difference]: Start difference. First operand 704 states and 1541 transitions. Second operand 19 states. [2019-12-27 23:30:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:56,231 INFO L93 Difference]: Finished difference Result 949 states and 2129 transitions. [2019-12-27 23:30:56,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 23:30:56,231 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-12-27 23:30:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:56,236 INFO L225 Difference]: With dead ends: 949 [2019-12-27 23:30:56,236 INFO L226 Difference]: Without dead ends: 736 [2019-12-27 23:30:56,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=401, Invalid=1005, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:30:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2019-12-27 23:30:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2019-12-27 23:30:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 23:30:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1605 transitions. [2019-12-27 23:30:56,249 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1605 transitions. Word has length 78 [2019-12-27 23:30:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:56,249 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1605 transitions. [2019-12-27 23:30:56,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:30:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1605 transitions. [2019-12-27 23:30:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 23:30:56,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:56,251 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:56,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:56,455 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash 362878793, now seen corresponding path program 21 times [2019-12-27 23:30:56,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:56,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149931396] [2019-12-27 23:30:56,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:56,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:56,636 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:56,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149931396] [2019-12-27 23:30:56,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367121492] [2019-12-27 23:30:56,637 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 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:56,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-27 23:30:56,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:56,700 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 23:30:56,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:56,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:56,740 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:56,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:56,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-27 23:30:56,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [696747149] [2019-12-27 23:30:56,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:56,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:56,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 432 transitions. [2019-12-27 23:30:56,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:56,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 23:30:56,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 23:30:56,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 23:30:56,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-12-27 23:30:56,850 INFO L87 Difference]: Start difference. First operand 736 states and 1605 transitions. Second operand 19 states. [2019-12-27 23:30:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:57,224 INFO L93 Difference]: Finished difference Result 883 states and 1948 transitions. [2019-12-27 23:30:57,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 23:30:57,224 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-12-27 23:30:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:57,228 INFO L225 Difference]: With dead ends: 883 [2019-12-27 23:30:57,228 INFO L226 Difference]: Without dead ends: 752 [2019-12-27 23:30:57,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=346, Invalid=844, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:30:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-12-27 23:30:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 509. [2019-12-27 23:30:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-12-27 23:30:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1151 transitions. [2019-12-27 23:30:57,239 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 1151 transitions. Word has length 78 [2019-12-27 23:30:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:57,240 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 1151 transitions. [2019-12-27 23:30:57,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 23:30:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 1151 transitions. [2019-12-27 23:30:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-27 23:30:57,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:57,241 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:57,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:57,445 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:57,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash 539004306, now seen corresponding path program 22 times [2019-12-27 23:30:57,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:57,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891768674] [2019-12-27 23:30:57,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:57,650 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:57,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891768674] [2019-12-27 23:30:57,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142353529] [2019-12-27 23:30:57,651 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 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:57,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:30:57,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:57,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-27 23:30:57,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:57,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:57,734 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:57,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:57,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-27 23:30:57,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1643805006] [2019-12-27 23:30:57,735 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:57,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:57,895 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 460 transitions. [2019-12-27 23:30:57,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:57,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 47 times. [2019-12-27 23:30:57,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 23:30:57,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:57,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 23:30:57,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-27 23:30:57,901 INFO L87 Difference]: Start difference. First operand 509 states and 1151 transitions. Second operand 20 states. [2019-12-27 23:30:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:58,474 INFO L93 Difference]: Finished difference Result 899 states and 1980 transitions. [2019-12-27 23:30:58,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 23:30:58,475 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 82 [2019-12-27 23:30:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:58,478 INFO L225 Difference]: With dead ends: 899 [2019-12-27 23:30:58,479 INFO L226 Difference]: Without dead ends: 768 [2019-12-27 23:30:58,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=408, Invalid=998, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:30:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-12-27 23:30:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2019-12-27 23:30:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-27 23:30:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1669 transitions. [2019-12-27 23:30:58,493 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1669 transitions. Word has length 82 [2019-12-27 23:30:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:58,494 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1669 transitions. [2019-12-27 23:30:58,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 23:30:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1669 transitions. [2019-12-27 23:30:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 23:30:58,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:58,496 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:58,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:58,700 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1804537007, now seen corresponding path program 23 times [2019-12-27 23:30:58,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:58,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991621097] [2019-12-27 23:30:58,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:30:58,927 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:58,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991621097] [2019-12-27 23:30:58,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356467926] [2019-12-27 23:30:58,928 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 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:58,990 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-12-27 23:30:58,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:30:58,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-27 23:30:58,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:30:59,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:59,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:59,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:30:59,027 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:59,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:30:59,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 23:30:59,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123423704] [2019-12-27 23:30:59,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:30:59,039 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:30:59,175 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 276 states and 464 transitions. [2019-12-27 23:30:59,175 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:30:59,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 47 times. [2019-12-27 23:30:59,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 23:30:59,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:30:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 23:30:59,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:30:59,180 INFO L87 Difference]: Start difference. First operand 768 states and 1669 transitions. Second operand 21 states. [2019-12-27 23:30:59,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:30:59,651 INFO L93 Difference]: Finished difference Result 915 states and 2012 transitions. [2019-12-27 23:30:59,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 23:30:59,651 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2019-12-27 23:30:59,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:30:59,655 INFO L225 Difference]: With dead ends: 915 [2019-12-27 23:30:59,655 INFO L226 Difference]: Without dead ends: 784 [2019-12-27 23:30:59,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=489, Invalid=1151, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:30:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-27 23:30:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 525. [2019-12-27 23:30:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-12-27 23:30:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 1183 transitions. [2019-12-27 23:30:59,666 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 1183 transitions. Word has length 86 [2019-12-27 23:30:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:30:59,667 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 1183 transitions. [2019-12-27 23:30:59,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 23:30:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 1183 transitions. [2019-12-27 23:30:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 23:30:59,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:30:59,668 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:59,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:30:59,872 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:30:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:30:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 383504003, now seen corresponding path program 24 times [2019-12-27 23:30:59,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:30:59,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471225712] [2019-12-27 23:30:59,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:30:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:00,097 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:31:00,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471225712] [2019-12-27 23:31:00,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775368171] [2019-12-27 23:31:00,098 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 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:31:00,166 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-12-27 23:31:00,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:00,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 23:31:00,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:00,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:00,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:00,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:00,216 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:31:00,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:00,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-27 23:31:00,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732339384] [2019-12-27 23:31:00,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:00,224 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:00,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 288 states and 488 transitions. [2019-12-27 23:31:00,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:00,338 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 50 times. [2019-12-27 23:31:00,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 23:31:00,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:00,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 23:31:00,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2019-12-27 23:31:00,339 INFO L87 Difference]: Start difference. First operand 525 states and 1183 transitions. Second operand 21 states. [2019-12-27 23:31:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:00,821 INFO L93 Difference]: Finished difference Result 931 states and 2044 transitions. [2019-12-27 23:31:00,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:31:00,821 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 86 [2019-12-27 23:31:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:00,824 INFO L225 Difference]: With dead ends: 931 [2019-12-27 23:31:00,825 INFO L226 Difference]: Without dead ends: 800 [2019-12-27 23:31:00,825 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:31:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-12-27 23:31:00,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2019-12-27 23:31:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 23:31:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1733 transitions. [2019-12-27 23:31:00,835 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1733 transitions. Word has length 86 [2019-12-27 23:31:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:00,835 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1733 transitions. [2019-12-27 23:31:00,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 23:31:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1733 transitions. [2019-12-27 23:31:00,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 23:31:00,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:00,838 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:31:01,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:01,041 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:01,042 INFO L82 PathProgramCache]: Analyzing trace with hash -91523296, now seen corresponding path program 25 times [2019-12-27 23:31:01,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:01,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232303340] [2019-12-27 23:31:01,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:01,307 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:31:01,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232303340] [2019-12-27 23:31:01,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311137645] [2019-12-27 23:31:01,308 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 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:31:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:01,371 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 23:31:01,373 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:01,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:01,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:01,408 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:31:01,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:01,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 23:31:01,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1766223678] [2019-12-27 23:31:01,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:01,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:01,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 292 states and 492 transitions. [2019-12-27 23:31:01,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:01,529 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 50 times. [2019-12-27 23:31:01,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 23:31:01,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:01,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 23:31:01,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:31:01,530 INFO L87 Difference]: Start difference. First operand 800 states and 1733 transitions. Second operand 22 states. [2019-12-27 23:31:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:02,004 INFO L93 Difference]: Finished difference Result 947 states and 2076 transitions. [2019-12-27 23:31:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 23:31:02,005 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2019-12-27 23:31:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:02,009 INFO L225 Difference]: With dead ends: 947 [2019-12-27 23:31:02,009 INFO L226 Difference]: Without dead ends: 816 [2019-12-27 23:31:02,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=516, Invalid=1206, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 23:31:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2019-12-27 23:31:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 541. [2019-12-27 23:31:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-12-27 23:31:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1215 transitions. [2019-12-27 23:31:02,021 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1215 transitions. Word has length 90 [2019-12-27 23:31:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:02,021 INFO L462 AbstractCegarLoop]: Abstraction has 541 states and 1215 transitions. [2019-12-27 23:31:02,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 23:31:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1215 transitions. [2019-12-27 23:31:02,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-27 23:31:02,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:02,023 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:31:02,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:02,226 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash 173610956, now seen corresponding path program 26 times [2019-12-27 23:31:02,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:02,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390129440] [2019-12-27 23:31:02,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:02,499 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:31:02,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390129440] [2019-12-27 23:31:02,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201180289] [2019-12-27 23:31:02,500 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:02,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:02,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:02,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-27 23:31:02,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:02,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:02,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:02,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:02,668 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:31:02,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:02,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-27 23:31:02,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1239868325] [2019-12-27 23:31:02,669 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:02,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:02,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 516 transitions. [2019-12-27 23:31:02,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:02,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 53 times. [2019-12-27 23:31:02,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 23:31:02,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:02,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 23:31:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:31:02,868 INFO L87 Difference]: Start difference. First operand 541 states and 1215 transitions. Second operand 22 states. [2019-12-27 23:31:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:03,567 INFO L93 Difference]: Finished difference Result 1061 states and 2353 transitions. [2019-12-27 23:31:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 23:31:03,568 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 90 [2019-12-27 23:31:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:03,573 INFO L225 Difference]: With dead ends: 1061 [2019-12-27 23:31:03,573 INFO L226 Difference]: Without dead ends: 848 [2019-12-27 23:31:03,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=507, Invalid=1299, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 23:31:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-12-27 23:31:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 554. [2019-12-27 23:31:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-12-27 23:31:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1241 transitions. [2019-12-27 23:31:03,588 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 1241 transitions. Word has length 90 [2019-12-27 23:31:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:03,589 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 1241 transitions. [2019-12-27 23:31:03,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 23:31:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 1241 transitions. [2019-12-27 23:31:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 23:31:03,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:03,592 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:31:03,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:03,797 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:03,798 INFO L82 PathProgramCache]: Analyzing trace with hash -963040791, now seen corresponding path program 27 times [2019-12-27 23:31:03,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:03,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176550897] [2019-12-27 23:31:03,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:04,055 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:31:04,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176550897] [2019-12-27 23:31:04,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546145641] [2019-12-27 23:31:04,055 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:04,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-12-27 23:31:04,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:04,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-27 23:31:04,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:04,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:04,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:04,155 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:31:04,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:04,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-27 23:31:04,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1262700417] [2019-12-27 23:31:04,156 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:04,168 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:04,351 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 308 states and 520 transitions. [2019-12-27 23:31:04,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:04,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 53 times. [2019-12-27 23:31:04,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 23:31:04,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 23:31:04,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2019-12-27 23:31:04,355 INFO L87 Difference]: Start difference. First operand 554 states and 1241 transitions. Second operand 23 states. [2019-12-27 23:31:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:04,895 INFO L93 Difference]: Finished difference Result 1093 states and 2417 transitions. [2019-12-27 23:31:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:31:04,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 94 [2019-12-27 23:31:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:04,908 INFO L225 Difference]: With dead ends: 1093 [2019-12-27 23:31:04,908 INFO L226 Difference]: Without dead ends: 880 [2019-12-27 23:31:04,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=597, Invalid=1473, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 23:31:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-12-27 23:31:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 573. [2019-12-27 23:31:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-12-27 23:31:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1279 transitions. [2019-12-27 23:31:04,923 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1279 transitions. Word has length 94 [2019-12-27 23:31:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:04,923 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 1279 transitions. [2019-12-27 23:31:04,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 23:31:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1279 transitions. [2019-12-27 23:31:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-27 23:31:04,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:04,925 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:31:05,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:05,128 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1209481210, now seen corresponding path program 28 times [2019-12-27 23:31:05,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:05,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225558867] [2019-12-27 23:31:05,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:05,412 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:31:05,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225558867] [2019-12-27 23:31:05,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605422514] [2019-12-27 23:31:05,414 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:05,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:05,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:05,509 INFO L264 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-27 23:31:05,511 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:05,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:05,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:05,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:05,558 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:31:05,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:05,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-27 23:31:05,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [550803235] [2019-12-27 23:31:05,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:05,587 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:05,910 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 336 states and 572 transitions. [2019-12-27 23:31:05,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:05,915 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 59 times. [2019-12-27 23:31:05,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 23:31:05,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 23:31:05,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-27 23:31:05,916 INFO L87 Difference]: Start difference. First operand 573 states and 1279 transitions. Second operand 24 states. [2019-12-27 23:31:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:06,470 INFO L93 Difference]: Finished difference Result 1027 states and 2236 transitions. [2019-12-27 23:31:06,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 23:31:06,470 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2019-12-27 23:31:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:06,474 INFO L225 Difference]: With dead ends: 1027 [2019-12-27 23:31:06,474 INFO L226 Difference]: Without dead ends: 896 [2019-12-27 23:31:06,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=606, Invalid=1464, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 23:31:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2019-12-27 23:31:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 896. [2019-12-27 23:31:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-27 23:31:06,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1925 transitions. [2019-12-27 23:31:06,489 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1925 transitions. Word has length 98 [2019-12-27 23:31:06,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:06,489 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1925 transitions. [2019-12-27 23:31:06,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 23:31:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1925 transitions. [2019-12-27 23:31:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:31:06,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:06,492 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 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:31:06,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:06,695 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:06,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:06,696 INFO L82 PathProgramCache]: Analyzing trace with hash -810062557, now seen corresponding path program 29 times [2019-12-27 23:31:06,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:06,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607319919] [2019-12-27 23:31:06,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:06,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607319919] [2019-12-27 23:31:06,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056412544] [2019-12-27 23:31:06,990 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:07,063 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-12-27 23:31:07,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:07,065 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-27 23:31:07,067 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:07,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:07,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:07,107 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:07,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:07,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 23:31:07,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1901784886] [2019-12-27 23:31:07,108 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:07,119 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:07,392 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 340 states and 576 transitions. [2019-12-27 23:31:07,393 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:07,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 59 times. [2019-12-27 23:31:07,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 23:31:07,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:07,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 23:31:07,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:31:07,398 INFO L87 Difference]: Start difference. First operand 896 states and 1925 transitions. Second operand 25 states. [2019-12-27 23:31:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:08,001 INFO L93 Difference]: Finished difference Result 1141 states and 2513 transitions. [2019-12-27 23:31:08,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 23:31:08,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-12-27 23:31:08,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:08,005 INFO L225 Difference]: With dead ends: 1141 [2019-12-27 23:31:08,005 INFO L226 Difference]: Without dead ends: 928 [2019-12-27 23:31:08,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=710, Invalid=1740, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:31:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-12-27 23:31:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2019-12-27 23:31:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-12-27 23:31:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1989 transitions. [2019-12-27 23:31:08,017 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1989 transitions. Word has length 102 [2019-12-27 23:31:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:08,017 INFO L462 AbstractCegarLoop]: Abstraction has 928 states and 1989 transitions. [2019-12-27 23:31:08,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 23:31:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1989 transitions. [2019-12-27 23:31:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-27 23:31:08,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:08,019 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 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:31:08,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:08,223 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:08,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1034309897, now seen corresponding path program 30 times [2019-12-27 23:31:08,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:08,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960203366] [2019-12-27 23:31:08,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:08,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960203366] [2019-12-27 23:31:08,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887589264] [2019-12-27 23:31:08,491 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:08,565 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-12-27 23:31:08,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:08,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-27 23:31:08,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:08,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:08,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:08,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 343 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:08,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:08,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-27 23:31:08,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [660111299] [2019-12-27 23:31:08,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:08,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:09,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 352 states and 600 transitions. [2019-12-27 23:31:09,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:09,246 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 62 times. [2019-12-27 23:31:09,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 23:31:09,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:09,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 23:31:09,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-12-27 23:31:09,247 INFO L87 Difference]: Start difference. First operand 928 states and 1989 transitions. Second operand 25 states. [2019-12-27 23:31:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:09,993 INFO L93 Difference]: Finished difference Result 1075 states and 2332 transitions. [2019-12-27 23:31:10,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 23:31:10,000 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 102 [2019-12-27 23:31:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:10,002 INFO L225 Difference]: With dead ends: 1075 [2019-12-27 23:31:10,002 INFO L226 Difference]: Without dead ends: 944 [2019-12-27 23:31:10,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=662, Invalid=1594, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 23:31:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2019-12-27 23:31:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 605. [2019-12-27 23:31:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 23:31:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1343 transitions. [2019-12-27 23:31:10,012 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1343 transitions. Word has length 102 [2019-12-27 23:31:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:10,013 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1343 transitions. [2019-12-27 23:31:10,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 23:31:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1343 transitions. [2019-12-27 23:31:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-27 23:31:10,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:10,015 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 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:31:10,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:10,218 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash 172596800, now seen corresponding path program 31 times [2019-12-27 23:31:10,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:10,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514370903] [2019-12-27 23:31:10,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:10,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:10,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514370903] [2019-12-27 23:31:10,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024586640] [2019-12-27 23:31:10,517 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:10,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-27 23:31:10,584 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:10,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:10,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:10,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:10,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:10,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-27 23:31:10,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [638176227] [2019-12-27 23:31:10,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:10,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:10,832 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 368 states and 628 transitions. [2019-12-27 23:31:10,832 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:10,838 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 65 times. [2019-12-27 23:31:10,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 23:31:10,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 23:31:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 23:31:10,839 INFO L87 Difference]: Start difference. First operand 605 states and 1343 transitions. Second operand 26 states. [2019-12-27 23:31:11,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:11,468 INFO L93 Difference]: Finished difference Result 1091 states and 2364 transitions. [2019-12-27 23:31:11,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 23:31:11,468 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 106 [2019-12-27 23:31:11,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:11,470 INFO L225 Difference]: With dead ends: 1091 [2019-12-27 23:31:11,470 INFO L226 Difference]: Without dead ends: 960 [2019-12-27 23:31:11,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=720, Invalid=1730, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:31:11,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-12-27 23:31:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2019-12-27 23:31:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-12-27 23:31:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 2053 transitions. [2019-12-27 23:31:11,485 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 2053 transitions. Word has length 106 [2019-12-27 23:31:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:11,485 INFO L462 AbstractCegarLoop]: Abstraction has 960 states and 2053 transitions. [2019-12-27 23:31:11,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 23:31:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 2053 transitions. [2019-12-27 23:31:11,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-27 23:31:11,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:11,487 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 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:31:11,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:11,691 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1533269597, now seen corresponding path program 32 times [2019-12-27 23:31:11,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:11,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590444853] [2019-12-27 23:31:11,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:12,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590444853] [2019-12-27 23:31:12,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029166065] [2019-12-27 23:31:12,135 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:12,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:12,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:12,203 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-27 23:31:12,205 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:12,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:12,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:12,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:12,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 23:31:12,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699808804] [2019-12-27 23:31:12,249 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:12,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:12,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 372 states and 632 transitions. [2019-12-27 23:31:12,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:12,580 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 65 times. [2019-12-27 23:31:12,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 23:31:12,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 23:31:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:31:12,584 INFO L87 Difference]: Start difference. First operand 960 states and 2053 transitions. Second operand 27 states. [2019-12-27 23:31:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:13,278 INFO L93 Difference]: Finished difference Result 1205 states and 2641 transitions. [2019-12-27 23:31:13,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 23:31:13,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-12-27 23:31:13,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:13,281 INFO L225 Difference]: With dead ends: 1205 [2019-12-27 23:31:13,281 INFO L226 Difference]: Without dead ends: 992 [2019-12-27 23:31:13,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=833, Invalid=2029, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 23:31:13,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2019-12-27 23:31:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2019-12-27 23:31:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2019-12-27 23:31:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2117 transitions. [2019-12-27 23:31:13,293 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2117 transitions. Word has length 110 [2019-12-27 23:31:13,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:13,293 INFO L462 AbstractCegarLoop]: Abstraction has 992 states and 2117 transitions. [2019-12-27 23:31:13,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 23:31:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2117 transitions. [2019-12-27 23:31:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-27 23:31:13,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:13,295 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 10, 10, 10, 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:31:13,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:13,495 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1349461967, now seen corresponding path program 33 times [2019-12-27 23:31:13,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:13,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127635692] [2019-12-27 23:31:13,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:13,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127635692] [2019-12-27 23:31:13,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884953091] [2019-12-27 23:31:13,823 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:13,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-27 23:31:13,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:13,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 23:31:13,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:13,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:13,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-27 23:31:13,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [934918571] [2019-12-27 23:31:13,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:13,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:14,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 384 states and 656 transitions. [2019-12-27 23:31:14,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:14,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 68 times. [2019-12-27 23:31:14,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 23:31:14,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:14,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 23:31:14,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2019-12-27 23:31:14,254 INFO L87 Difference]: Start difference. First operand 992 states and 2117 transitions. Second operand 27 states. [2019-12-27 23:31:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:14,866 INFO L93 Difference]: Finished difference Result 1139 states and 2460 transitions. [2019-12-27 23:31:14,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 23:31:14,866 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-12-27 23:31:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:14,868 INFO L225 Difference]: With dead ends: 1139 [2019-12-27 23:31:14,868 INFO L226 Difference]: Without dead ends: 1008 [2019-12-27 23:31:14,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=754, Invalid=1796, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 23:31:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-12-27 23:31:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 637. [2019-12-27 23:31:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-12-27 23:31:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1407 transitions. [2019-12-27 23:31:14,879 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1407 transitions. Word has length 110 [2019-12-27 23:31:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:14,880 INFO L462 AbstractCegarLoop]: Abstraction has 637 states and 1407 transitions. [2019-12-27 23:31:14,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 23:31:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1407 transitions. [2019-12-27 23:31:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-27 23:31:14,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:14,881 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 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:31:15,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:15,083 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -923428230, now seen corresponding path program 34 times [2019-12-27 23:31:15,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:15,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724085630] [2019-12-27 23:31:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:15,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724085630] [2019-12-27 23:31:15,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834879785] [2019-12-27 23:31:15,392 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:15,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:15,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:15,458 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-27 23:31:15,461 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:15,530 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:15,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:15,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-27 23:31:15,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168156261] [2019-12-27 23:31:15,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:15,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:15,770 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 400 states and 684 transitions. [2019-12-27 23:31:15,770 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:15,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 71 times. [2019-12-27 23:31:15,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 23:31:15,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:15,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 23:31:15,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-12-27 23:31:15,776 INFO L87 Difference]: Start difference. First operand 637 states and 1407 transitions. Second operand 28 states. [2019-12-27 23:31:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:16,571 INFO L93 Difference]: Finished difference Result 1253 states and 2737 transitions. [2019-12-27 23:31:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 23:31:16,571 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 114 [2019-12-27 23:31:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:16,573 INFO L225 Difference]: With dead ends: 1253 [2019-12-27 23:31:16,573 INFO L226 Difference]: Without dead ends: 1040 [2019-12-27 23:31:16,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=849, Invalid=2121, Unknown=0, NotChecked=0, Total=2970 [2019-12-27 23:31:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-12-27 23:31:16,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 650. [2019-12-27 23:31:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-12-27 23:31:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1433 transitions. [2019-12-27 23:31:16,586 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1433 transitions. Word has length 114 [2019-12-27 23:31:16,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:16,587 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 1433 transitions. [2019-12-27 23:31:16,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 23:31:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1433 transitions. [2019-12-27 23:31:16,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-27 23:31:16,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:16,589 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 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:31:16,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:16,792 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 605578647, now seen corresponding path program 35 times [2019-12-27 23:31:16,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:16,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206398723] [2019-12-27 23:31:16,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:17,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206398723] [2019-12-27 23:31:17,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150857717] [2019-12-27 23:31:17,294 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:17,380 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-27 23:31:17,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:17,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-27 23:31:17,384 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:17,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:17,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:17,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-27 23:31:17,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2075329571] [2019-12-27 23:31:17,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:17,451 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:17,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 404 states and 688 transitions. [2019-12-27 23:31:17,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:17,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 71 times. [2019-12-27 23:31:17,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 23:31:17,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:17,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 23:31:17,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2019-12-27 23:31:17,839 INFO L87 Difference]: Start difference. First operand 650 states and 1433 transitions. Second operand 29 states. [2019-12-27 23:31:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:18,569 INFO L93 Difference]: Finished difference Result 1187 states and 2556 transitions. [2019-12-27 23:31:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 23:31:18,570 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2019-12-27 23:31:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:18,574 INFO L225 Difference]: With dead ends: 1187 [2019-12-27 23:31:18,574 INFO L226 Difference]: Without dead ends: 1056 [2019-12-27 23:31:18,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=961, Invalid=2231, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 23:31:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-12-27 23:31:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2019-12-27 23:31:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-12-27 23:31:18,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 2245 transitions. [2019-12-27 23:31:18,592 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 2245 transitions. Word has length 118 [2019-12-27 23:31:18,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:18,593 INFO L462 AbstractCegarLoop]: Abstraction has 1056 states and 2245 transitions. [2019-12-27 23:31:18,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 23:31:18,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 2245 transitions. [2019-12-27 23:31:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-27 23:31:18,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:18,595 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 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:31:18,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:18,798 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:18,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash 728636424, now seen corresponding path program 36 times [2019-12-27 23:31:18,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:18,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955607724] [2019-12-27 23:31:18,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:19,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955607724] [2019-12-27 23:31:19,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849796459] [2019-12-27 23:31:19,258 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:19,340 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-12-27 23:31:19,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:19,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-27 23:31:19,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:19,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:19,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:19,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:19,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:19,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 23:31:19,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [144997322] [2019-12-27 23:31:19,397 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:19,422 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:19,711 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 420 states and 716 transitions. [2019-12-27 23:31:19,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:19,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 74 times. [2019-12-27 23:31:19,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 23:31:19,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:19,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 23:31:19,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:31:19,719 INFO L87 Difference]: Start difference. First operand 1056 states and 2245 transitions. Second operand 30 states. [2019-12-27 23:31:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:20,471 INFO L93 Difference]: Finished difference Result 1203 states and 2588 transitions. [2019-12-27 23:31:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 23:31:20,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2019-12-27 23:31:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:20,473 INFO L225 Difference]: With dead ends: 1203 [2019-12-27 23:31:20,474 INFO L226 Difference]: Without dead ends: 1072 [2019-12-27 23:31:20,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1000, Invalid=2306, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 23:31:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-12-27 23:31:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 669. [2019-12-27 23:31:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2019-12-27 23:31:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1471 transitions. [2019-12-27 23:31:20,489 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1471 transitions. Word has length 122 [2019-12-27 23:31:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:20,489 INFO L462 AbstractCegarLoop]: Abstraction has 669 states and 1471 transitions. [2019-12-27 23:31:20,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 23:31:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1471 transitions. [2019-12-27 23:31:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-27 23:31:20,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:20,491 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 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:31:20,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:20,694 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1587102540, now seen corresponding path program 37 times [2019-12-27 23:31:20,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:20,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555444309] [2019-12-27 23:31:20,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:21,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555444309] [2019-12-27 23:31:21,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092813744] [2019-12-27 23:31:21,060 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:21,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-27 23:31:21,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:21,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:21,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:21,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:21,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:21,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-27 23:31:21,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [452330984] [2019-12-27 23:31:21,183 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:21,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:21,451 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 432 states and 740 transitions. [2019-12-27 23:31:21,451 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:21,455 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 77 times. [2019-12-27 23:31:21,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 23:31:21,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 23:31:21,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2019-12-27 23:31:21,456 INFO L87 Difference]: Start difference. First operand 669 states and 1471 transitions. Second operand 30 states. [2019-12-27 23:31:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:22,236 INFO L93 Difference]: Finished difference Result 1317 states and 2865 transitions. [2019-12-27 23:31:22,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 23:31:22,236 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 122 [2019-12-27 23:31:22,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:22,239 INFO L225 Difference]: With dead ends: 1317 [2019-12-27 23:31:22,239 INFO L226 Difference]: Without dead ends: 1104 [2019-12-27 23:31:22,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=983, Invalid=2439, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 23:31:22,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-12-27 23:31:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 682. [2019-12-27 23:31:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-12-27 23:31:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1497 transitions. [2019-12-27 23:31:22,252 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1497 transitions. Word has length 122 [2019-12-27 23:31:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:22,253 INFO L462 AbstractCegarLoop]: Abstraction has 682 states and 1497 transitions. [2019-12-27 23:31:22,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 23:31:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1497 transitions. [2019-12-27 23:31:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-27 23:31:22,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:22,254 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 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:31:22,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:22,457 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:22,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash -900785455, now seen corresponding path program 38 times [2019-12-27 23:31:22,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:22,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178062046] [2019-12-27 23:31:22,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:22,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178062046] [2019-12-27 23:31:22,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549418491] [2019-12-27 23:31:22,850 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:22,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:22,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:22,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-27 23:31:22,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:22,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:22,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:22,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 0 proven. 601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:22,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:22,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-27 23:31:22,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2071601890] [2019-12-27 23:31:22,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:22,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:23,312 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 436 states and 744 transitions. [2019-12-27 23:31:23,312 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:23,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 77 times. [2019-12-27 23:31:23,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-27 23:31:23,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-27 23:31:23,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2019-12-27 23:31:23,317 INFO L87 Difference]: Start difference. First operand 682 states and 1497 transitions. Second operand 31 states. [2019-12-27 23:31:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:24,097 INFO L93 Difference]: Finished difference Result 1251 states and 2684 transitions. [2019-12-27 23:31:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 23:31:24,097 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 126 [2019-12-27 23:31:24,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:24,099 INFO L225 Difference]: With dead ends: 1251 [2019-12-27 23:31:24,099 INFO L226 Difference]: Without dead ends: 1120 [2019-12-27 23:31:24,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1104, Invalid=2556, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 23:31:24,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-27 23:31:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2019-12-27 23:31:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2019-12-27 23:31:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2373 transitions. [2019-12-27 23:31:24,112 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 2373 transitions. Word has length 126 [2019-12-27 23:31:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:24,113 INFO L462 AbstractCegarLoop]: Abstraction has 1120 states and 2373 transitions. [2019-12-27 23:31:24,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-27 23:31:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 2373 transitions. [2019-12-27 23:31:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-27 23:31:24,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:24,114 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 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:31:24,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:24,315 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1066163134, now seen corresponding path program 39 times [2019-12-27 23:31:24,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:24,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451191911] [2019-12-27 23:31:24,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:24,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451191911] [2019-12-27 23:31:24,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901386465] [2019-12-27 23:31:24,719 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:24,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-27 23:31:24,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:24,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-27 23:31:24,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:24,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:24,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:24,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:24,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:24,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 23:31:24,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1940490323] [2019-12-27 23:31:24,837 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:24,853 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:25,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 452 states and 772 transitions. [2019-12-27 23:31:25,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:25,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 80 times. [2019-12-27 23:31:25,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 23:31:25,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:25,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 23:31:25,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=808, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:31:25,160 INFO L87 Difference]: Start difference. First operand 1120 states and 2373 transitions. Second operand 32 states. [2019-12-27 23:31:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:25,967 INFO L93 Difference]: Finished difference Result 1267 states and 2716 transitions. [2019-12-27 23:31:25,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 23:31:25,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 130 [2019-12-27 23:31:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:25,970 INFO L225 Difference]: With dead ends: 1267 [2019-12-27 23:31:25,970 INFO L226 Difference]: Without dead ends: 1136 [2019-12-27 23:31:25,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1146, Invalid=2636, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 23:31:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-12-27 23:31:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 701. [2019-12-27 23:31:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-12-27 23:31:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1535 transitions. [2019-12-27 23:31:25,984 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1535 transitions. Word has length 130 [2019-12-27 23:31:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:25,985 INFO L462 AbstractCegarLoop]: Abstraction has 701 states and 1535 transitions. [2019-12-27 23:31:25,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 23:31:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1535 transitions. [2019-12-27 23:31:25,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-27 23:31:25,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:25,986 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 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:31:26,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:26,191 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:26,191 INFO L82 PathProgramCache]: Analyzing trace with hash 655820014, now seen corresponding path program 40 times [2019-12-27 23:31:26,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:26,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105335860] [2019-12-27 23:31:26,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:26,617 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:26,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105335860] [2019-12-27 23:31:26,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336228804] [2019-12-27 23:31:26,618 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:26,709 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:26,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:26,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-27 23:31:26,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:26,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:26,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:26,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:26,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:26,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-27 23:31:26,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1734242135] [2019-12-27 23:31:26,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:26,766 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:27,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 464 states and 796 transitions. [2019-12-27 23:31:27,080 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:27,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 83 times. [2019-12-27 23:31:27,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 23:31:27,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 23:31:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=809, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 23:31:27,086 INFO L87 Difference]: Start difference. First operand 701 states and 1535 transitions. Second operand 32 states. [2019-12-27 23:31:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:27,944 INFO L93 Difference]: Finished difference Result 1381 states and 2993 transitions. [2019-12-27 23:31:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 23:31:27,945 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 130 [2019-12-27 23:31:27,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:27,946 INFO L225 Difference]: With dead ends: 1381 [2019-12-27 23:31:27,946 INFO L226 Difference]: Without dead ends: 1168 [2019-12-27 23:31:27,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1127, Invalid=2779, Unknown=0, NotChecked=0, Total=3906 [2019-12-27 23:31:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2019-12-27 23:31:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 714. [2019-12-27 23:31:27,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-12-27 23:31:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1561 transitions. [2019-12-27 23:31:27,959 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1561 transitions. Word has length 130 [2019-12-27 23:31:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:27,959 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1561 transitions. [2019-12-27 23:31:27,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 23:31:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1561 transitions. [2019-12-27 23:31:27,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-27 23:31:27,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:27,960 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 13, 13, 13, 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:31:28,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:28,162 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -729680373, now seen corresponding path program 41 times [2019-12-27 23:31:28,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:28,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208562325] [2019-12-27 23:31:28,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:28,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208562325] [2019-12-27 23:31:28,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050112120] [2019-12-27 23:31:28,599 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:28,679 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-12-27 23:31:28,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:28,681 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-27 23:31:28,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:28,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:28,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:28,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:28,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:28,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-27 23:31:28,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [912111545] [2019-12-27 23:31:28,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:28,737 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:29,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 468 states and 800 transitions. [2019-12-27 23:31:29,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:29,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 83 times. [2019-12-27 23:31:29,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-27 23:31:29,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:29,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-27 23:31:29,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 23:31:29,082 INFO L87 Difference]: Start difference. First operand 714 states and 1561 transitions. Second operand 33 states. [2019-12-27 23:31:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:29,965 INFO L93 Difference]: Finished difference Result 1315 states and 2812 transitions. [2019-12-27 23:31:29,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 23:31:29,966 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 134 [2019-12-27 23:31:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:29,967 INFO L225 Difference]: With dead ends: 1315 [2019-12-27 23:31:29,967 INFO L226 Difference]: Without dead ends: 1184 [2019-12-27 23:31:29,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1257, Invalid=2903, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 23:31:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-27 23:31:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2019-12-27 23:31:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2019-12-27 23:31:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 2501 transitions. [2019-12-27 23:31:29,983 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 2501 transitions. Word has length 134 [2019-12-27 23:31:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:29,984 INFO L462 AbstractCegarLoop]: Abstraction has 1184 states and 2501 transitions. [2019-12-27 23:31:29,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-27 23:31:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 2501 transitions. [2019-12-27 23:31:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 23:31:29,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:29,985 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 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:31:30,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:30,186 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:30,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:30,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1928483452, now seen corresponding path program 42 times [2019-12-27 23:31:30,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:30,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601206379] [2019-12-27 23:31:30,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:30,647 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:30,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601206379] [2019-12-27 23:31:30,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743884783] [2019-12-27 23:31:30,648 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:30,727 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-12-27 23:31:30,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:30,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 23:31:30,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:30,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:30,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:30,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:30,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:30,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 23:31:30,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [364356349] [2019-12-27 23:31:30,809 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:30,836 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:31,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 484 states and 828 transitions. [2019-12-27 23:31:31,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:31,187 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 86 times. [2019-12-27 23:31:31,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 23:31:31,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 23:31:31,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:31:31,189 INFO L87 Difference]: Start difference. First operand 1184 states and 2501 transitions. Second operand 34 states. [2019-12-27 23:31:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:32,121 INFO L93 Difference]: Finished difference Result 1331 states and 2844 transitions. [2019-12-27 23:31:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 23:31:32,121 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 138 [2019-12-27 23:31:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:32,122 INFO L225 Difference]: With dead ends: 1331 [2019-12-27 23:31:32,123 INFO L226 Difference]: Without dead ends: 1200 [2019-12-27 23:31:32,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1337, Invalid=3085, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 23:31:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-12-27 23:31:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 733. [2019-12-27 23:31:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-12-27 23:31:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1599 transitions. [2019-12-27 23:31:32,135 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1599 transitions. Word has length 138 [2019-12-27 23:31:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1599 transitions. [2019-12-27 23:31:32,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 23:31:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1599 transitions. [2019-12-27 23:31:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-27 23:31:32,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:32,137 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 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:31:32,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:32,339 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash -746556632, now seen corresponding path program 43 times [2019-12-27 23:31:32,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:32,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189497945] [2019-12-27 23:31:32,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:32,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189497945] [2019-12-27 23:31:32,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610691328] [2019-12-27 23:31:32,712 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:32,781 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-27 23:31:32,783 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:32,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:32,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:32,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:32,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:32,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-27 23:31:32,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1813117241] [2019-12-27 23:31:32,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:32,871 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:33,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 496 states and 852 transitions. [2019-12-27 23:31:33,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:33,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 89 times. [2019-12-27 23:31:33,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 23:31:33,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:33,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 23:31:33,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=911, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 23:31:33,275 INFO L87 Difference]: Start difference. First operand 733 states and 1599 transitions. Second operand 34 states. [2019-12-27 23:31:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:34,333 INFO L93 Difference]: Finished difference Result 1347 states and 2876 transitions. [2019-12-27 23:31:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 23:31:34,333 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 138 [2019-12-27 23:31:34,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:34,334 INFO L225 Difference]: With dead ends: 1347 [2019-12-27 23:31:34,334 INFO L226 Difference]: Without dead ends: 1216 [2019-12-27 23:31:34,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1276, Invalid=3014, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 23:31:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-12-27 23:31:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1216. [2019-12-27 23:31:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2019-12-27 23:31:34,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 2565 transitions. [2019-12-27 23:31:34,350 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 2565 transitions. Word has length 138 [2019-12-27 23:31:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:34,351 INFO L462 AbstractCegarLoop]: Abstraction has 1216 states and 2565 transitions. [2019-12-27 23:31:34,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 23:31:34,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2565 transitions. [2019-12-27 23:31:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-27 23:31:34,353 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:34,353 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 14, 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:31:34,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:34,557 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1356138683, now seen corresponding path program 44 times [2019-12-27 23:31:34,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:34,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145247027] [2019-12-27 23:31:34,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:35,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145247027] [2019-12-27 23:31:35,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695581209] [2019-12-27 23:31:35,149 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:35,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:35,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:35,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-27 23:31:35,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:35,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:35,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:35,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:35,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:35,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 23:31:35,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128416850] [2019-12-27 23:31:35,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:35,291 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:35,717 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 500 states and 856 transitions. [2019-12-27 23:31:35,717 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:35,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 89 times. [2019-12-27 23:31:35,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 23:31:35,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 23:31:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:31:35,722 INFO L87 Difference]: Start difference. First operand 1216 states and 2565 transitions. Second operand 35 states. [2019-12-27 23:31:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:36,716 INFO L93 Difference]: Finished difference Result 1461 states and 3153 transitions. [2019-12-27 23:31:36,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 23:31:36,717 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2019-12-27 23:31:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:36,718 INFO L225 Difference]: With dead ends: 1461 [2019-12-27 23:31:36,718 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 23:31:36,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1425, Invalid=3405, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:31:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 23:31:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2019-12-27 23:31:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1248 states. [2019-12-27 23:31:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 2629 transitions. [2019-12-27 23:31:36,732 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 2629 transitions. Word has length 142 [2019-12-27 23:31:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:36,733 INFO L462 AbstractCegarLoop]: Abstraction has 1248 states and 2629 transitions. [2019-12-27 23:31:36,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 23:31:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 2629 transitions. [2019-12-27 23:31:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-27 23:31:36,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:36,735 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 14, 14, 14, 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:31:36,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:36,935 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1509754599, now seen corresponding path program 45 times [2019-12-27 23:31:36,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:36,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097107358] [2019-12-27 23:31:36,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:37,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097107358] [2019-12-27 23:31:37,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893511906] [2019-12-27 23:31:37,380 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:37,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-12-27 23:31:37,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:37,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 23:31:37,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:37,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:37,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:37,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:37,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:37,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-27 23:31:37,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [54674810] [2019-12-27 23:31:37,517 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:37,536 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:38,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 512 states and 880 transitions. [2019-12-27 23:31:38,588 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:38,594 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 92 times. [2019-12-27 23:31:38,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-27 23:31:38,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-27 23:31:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 23:31:38,595 INFO L87 Difference]: Start difference. First operand 1248 states and 2629 transitions. Second operand 35 states. [2019-12-27 23:31:39,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:39,720 INFO L93 Difference]: Finished difference Result 1395 states and 2972 transitions. [2019-12-27 23:31:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 23:31:39,721 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2019-12-27 23:31:39,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:39,723 INFO L225 Difference]: With dead ends: 1395 [2019-12-27 23:31:39,723 INFO L226 Difference]: Without dead ends: 1264 [2019-12-27 23:31:39,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1357, Invalid=3199, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 23:31:39,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2019-12-27 23:31:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 765. [2019-12-27 23:31:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-12-27 23:31:39,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1663 transitions. [2019-12-27 23:31:39,743 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1663 transitions. Word has length 142 [2019-12-27 23:31:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:39,744 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1663 transitions. [2019-12-27 23:31:39,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-27 23:31:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1663 transitions. [2019-12-27 23:31:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-27 23:31:39,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:39,746 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 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:31:39,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:39,951 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash 102565730, now seen corresponding path program 46 times [2019-12-27 23:31:39,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:39,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519430603] [2019-12-27 23:31:39,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:40,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519430603] [2019-12-27 23:31:40,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093895070] [2019-12-27 23:31:40,638 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:40,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:40,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:40,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-27 23:31:40,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:40,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:40,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:40,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:40,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-27 23:31:40,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028782126] [2019-12-27 23:31:40,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:40,826 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:41,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 528 states and 908 transitions. [2019-12-27 23:31:41,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:41,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 95 times. [2019-12-27 23:31:41,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-27 23:31:41,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-27 23:31:41,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 23:31:41,420 INFO L87 Difference]: Start difference. First operand 765 states and 1663 transitions. Second operand 36 states. [2019-12-27 23:31:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:42,434 INFO L93 Difference]: Finished difference Result 1411 states and 3004 transitions. [2019-12-27 23:31:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 23:31:42,434 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 146 [2019-12-27 23:31:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:42,436 INFO L225 Difference]: With dead ends: 1411 [2019-12-27 23:31:42,436 INFO L226 Difference]: Without dead ends: 1280 [2019-12-27 23:31:42,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1440, Invalid=3390, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 23:31:42,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-27 23:31:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2019-12-27 23:31:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-12-27 23:31:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2693 transitions. [2019-12-27 23:31:42,452 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2693 transitions. Word has length 146 [2019-12-27 23:31:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:42,452 INFO L462 AbstractCegarLoop]: Abstraction has 1280 states and 2693 transitions. [2019-12-27 23:31:42,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-27 23:31:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2693 transitions. [2019-12-27 23:31:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-27 23:31:42,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:42,455 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 15, 15, 15, 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:31:42,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:42,658 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1396433281, now seen corresponding path program 47 times [2019-12-27 23:31:42,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:42,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127530075] [2019-12-27 23:31:42,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:43,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127530075] [2019-12-27 23:31:43,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206708683] [2019-12-27 23:31:43,144 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:43,225 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-12-27 23:31:43,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:43,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-27 23:31:43,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:43,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:43,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:43,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:43,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:43,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 23:31:43,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89700056] [2019-12-27 23:31:43,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:43,298 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:44,402 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 532 states and 912 transitions. [2019-12-27 23:31:44,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:44,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 95 times. [2019-12-27 23:31:44,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 23:31:44,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 23:31:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:31:44,410 INFO L87 Difference]: Start difference. First operand 1280 states and 2693 transitions. Second operand 37 states. [2019-12-27 23:31:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:45,459 INFO L93 Difference]: Finished difference Result 1525 states and 3281 transitions. [2019-12-27 23:31:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:31:45,459 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 150 [2019-12-27 23:31:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:45,460 INFO L225 Difference]: With dead ends: 1525 [2019-12-27 23:31:45,461 INFO L226 Difference]: Without dead ends: 1312 [2019-12-27 23:31:45,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1598, Invalid=3804, Unknown=0, NotChecked=0, Total=5402 [2019-12-27 23:31:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-12-27 23:31:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2019-12-27 23:31:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2019-12-27 23:31:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 2757 transitions. [2019-12-27 23:31:45,473 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 2757 transitions. Word has length 150 [2019-12-27 23:31:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:45,474 INFO L462 AbstractCegarLoop]: Abstraction has 1312 states and 2757 transitions. [2019-12-27 23:31:45,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 23:31:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 2757 transitions. [2019-12-27 23:31:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-27 23:31:45,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:45,475 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 15, 15, 15, 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:31:45,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:45,679 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:45,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1399251027, now seen corresponding path program 48 times [2019-12-27 23:31:45,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:45,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739387331] [2019-12-27 23:31:45,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:46,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739387331] [2019-12-27 23:31:46,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978036794] [2019-12-27 23:31:46,136 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:46,222 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-27 23:31:46,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:46,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 23:31:46,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:46,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:46,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:46,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:46,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:46,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-27 23:31:46,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554518948] [2019-12-27 23:31:46,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:46,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:46,999 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 544 states and 936 transitions. [2019-12-27 23:31:46,999 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:47,005 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 98 times. [2019-12-27 23:31:47,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 23:31:47,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:47,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 23:31:47,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1074, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 23:31:47,006 INFO L87 Difference]: Start difference. First operand 1312 states and 2757 transitions. Second operand 37 states. [2019-12-27 23:31:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:48,016 INFO L93 Difference]: Finished difference Result 1459 states and 3100 transitions. [2019-12-27 23:31:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 23:31:48,016 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 150 [2019-12-27 23:31:48,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:48,017 INFO L225 Difference]: With dead ends: 1459 [2019-12-27 23:31:48,018 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 23:31:48,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1489, Invalid=3481, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 23:31:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 23:31:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 797. [2019-12-27 23:31:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-27 23:31:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1727 transitions. [2019-12-27 23:31:48,029 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1727 transitions. Word has length 150 [2019-12-27 23:31:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:48,030 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1727 transitions. [2019-12-27 23:31:48,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 23:31:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1727 transitions. [2019-12-27 23:31:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-27 23:31:48,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:48,031 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 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:31:48,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:48,232 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash 73843100, now seen corresponding path program 49 times [2019-12-27 23:31:48,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:48,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893529334] [2019-12-27 23:31:48,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:48,763 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:48,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893529334] [2019-12-27 23:31:48,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196600993] [2019-12-27 23:31:48,763 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:48,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-27 23:31:48,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:48,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:48,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:48,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:48,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:48,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-27 23:31:48,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1087402609] [2019-12-27 23:31:48,903 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:48,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:49,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 560 states and 964 transitions. [2019-12-27 23:31:49,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:49,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 101 times. [2019-12-27 23:31:49,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-27 23:31:49,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:49,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-27 23:31:49,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1133, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 23:31:49,675 INFO L87 Difference]: Start difference. First operand 797 states and 1727 transitions. Second operand 38 states. [2019-12-27 23:31:50,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:50,803 INFO L93 Difference]: Finished difference Result 1573 states and 3377 transitions. [2019-12-27 23:31:50,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:31:50,804 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 154 [2019-12-27 23:31:50,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:50,806 INFO L225 Difference]: With dead ends: 1573 [2019-12-27 23:31:50,806 INFO L226 Difference]: Without dead ends: 1360 [2019-12-27 23:31:50,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1619, Invalid=3931, Unknown=0, NotChecked=0, Total=5550 [2019-12-27 23:31:50,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2019-12-27 23:31:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 810. [2019-12-27 23:31:50,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2019-12-27 23:31:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1753 transitions. [2019-12-27 23:31:50,817 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1753 transitions. Word has length 154 [2019-12-27 23:31:50,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:50,818 INFO L462 AbstractCegarLoop]: Abstraction has 810 states and 1753 transitions. [2019-12-27 23:31:50,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-27 23:31:50,818 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1753 transitions. [2019-12-27 23:31:50,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-27 23:31:50,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:50,819 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 16, 16, 16, 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:31:51,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:51,023 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:51,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:51,023 INFO L82 PathProgramCache]: Analyzing trace with hash 96955321, now seen corresponding path program 50 times [2019-12-27 23:31:51,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:51,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058320328] [2019-12-27 23:31:51,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 0 proven. 1057 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:51,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058320328] [2019-12-27 23:31:51,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746132170] [2019-12-27 23:31:51,515 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:51,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:31:51,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:51,590 INFO L264 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-27 23:31:51,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:51,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:51,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:51,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 0 proven. 1057 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:51,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:51,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-27 23:31:51,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [83417418] [2019-12-27 23:31:51,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:51,701 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:52,356 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 564 states and 968 transitions. [2019-12-27 23:31:52,356 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:52,362 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 101 times. [2019-12-27 23:31:52,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 23:31:52,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:52,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 23:31:52,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:31:52,363 INFO L87 Difference]: Start difference. First operand 810 states and 1753 transitions. Second operand 39 states. [2019-12-27 23:31:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:53,483 INFO L93 Difference]: Finished difference Result 1507 states and 3196 transitions. [2019-12-27 23:31:53,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 23:31:53,484 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 158 [2019-12-27 23:31:53,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:53,486 INFO L225 Difference]: With dead ends: 1507 [2019-12-27 23:31:53,486 INFO L226 Difference]: Without dead ends: 1376 [2019-12-27 23:31:53,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1776, Invalid=4076, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 23:31:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-12-27 23:31:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2019-12-27 23:31:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-12-27 23:31:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2885 transitions. [2019-12-27 23:31:53,501 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2885 transitions. Word has length 158 [2019-12-27 23:31:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:53,502 INFO L462 AbstractCegarLoop]: Abstraction has 1376 states and 2885 transitions. [2019-12-27 23:31:53,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 23:31:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2885 transitions. [2019-12-27 23:31:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-27 23:31:53,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:53,504 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 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:31:53,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:53,704 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash -200720086, now seen corresponding path program 51 times [2019-12-27 23:31:53,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:53,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971576146] [2019-12-27 23:31:53,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:54,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971576146] [2019-12-27 23:31:54,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119732334] [2019-12-27 23:31:54,316 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:54,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-27 23:31:54,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:54,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 23:31:54,424 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:54,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:54,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:54,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:54,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:54,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 23:31:54,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568752535] [2019-12-27 23:31:54,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:54,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:55,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 580 states and 996 transitions. [2019-12-27 23:31:55,207 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:55,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 104 times. [2019-12-27 23:31:55,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 23:31:55,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:55,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 23:31:55,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=1252, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:31:55,212 INFO L87 Difference]: Start difference. First operand 1376 states and 2885 transitions. Second operand 40 states. [2019-12-27 23:31:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:56,305 INFO L93 Difference]: Finished difference Result 1523 states and 3228 transitions. [2019-12-27 23:31:56,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 23:31:56,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 162 [2019-12-27 23:31:56,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:56,307 INFO L225 Difference]: With dead ends: 1523 [2019-12-27 23:31:56,307 INFO L226 Difference]: Without dead ends: 1392 [2019-12-27 23:31:56,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=4176, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 23:31:56,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-12-27 23:31:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 829. [2019-12-27 23:31:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-27 23:31:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1791 transitions. [2019-12-27 23:31:56,319 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1791 transitions. Word has length 162 [2019-12-27 23:31:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:56,319 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1791 transitions. [2019-12-27 23:31:56,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 23:31:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1791 transitions. [2019-12-27 23:31:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-27 23:31:56,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:56,321 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 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:31:56,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:56,522 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:56,522 INFO L82 PathProgramCache]: Analyzing trace with hash -103308842, now seen corresponding path program 52 times [2019-12-27 23:31:56,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:56,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145117468] [2019-12-27 23:31:56,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:57,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145117468] [2019-12-27 23:31:57,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458935656] [2019-12-27 23:31:57,034 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:57,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:31:57,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:31:57,108 INFO L264 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 23:31:57,109 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:31:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:57,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:57,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:31:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:57,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:31:57,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-27 23:31:57,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [228414360] [2019-12-27 23:31:57,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:31:57,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:31:57,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 592 states and 1020 transitions. [2019-12-27 23:31:57,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:31:57,906 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 107 times. [2019-12-27 23:31:57,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-27 23:31:57,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:31:57,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-27 23:31:57,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=1253, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 23:31:57,908 INFO L87 Difference]: Start difference. First operand 829 states and 1791 transitions. Second operand 40 states. [2019-12-27 23:31:59,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:31:59,123 INFO L93 Difference]: Finished difference Result 1637 states and 3505 transitions. [2019-12-27 23:31:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:31:59,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 162 [2019-12-27 23:31:59,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:31:59,125 INFO L225 Difference]: With dead ends: 1637 [2019-12-27 23:31:59,125 INFO L226 Difference]: Without dead ends: 1424 [2019-12-27 23:31:59,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=4359, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 23:31:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2019-12-27 23:31:59,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 842. [2019-12-27 23:31:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-12-27 23:31:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1817 transitions. [2019-12-27 23:31:59,136 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1817 transitions. Word has length 162 [2019-12-27 23:31:59,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:31:59,136 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1817 transitions. [2019-12-27 23:31:59,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-27 23:31:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1817 transitions. [2019-12-27 23:31:59,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-27 23:31:59,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:31:59,138 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 17, 17, 17, 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:31:59,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:31:59,339 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:31:59,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:31:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash -659628301, now seen corresponding path program 53 times [2019-12-27 23:31:59,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:31:59,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616351193] [2019-12-27 23:31:59,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:31:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:31:59,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 0 proven. 1191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:31:59,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616351193] [2019-12-27 23:31:59,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486621171] [2019-12-27 23:31:59,943 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:00,034 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-27 23:32:00,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:00,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-27 23:32:00,038 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:00,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:00,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:00,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 0 proven. 1191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:00,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:00,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-12-27 23:32:00,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1829340925] [2019-12-27 23:32:00,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:00,138 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:00,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 596 states and 1024 transitions. [2019-12-27 23:32:00,815 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:00,819 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 107 times. [2019-12-27 23:32:00,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-27 23:32:00,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-27 23:32:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 23:32:00,820 INFO L87 Difference]: Start difference. First operand 842 states and 1817 transitions. Second operand 41 states. [2019-12-27 23:32:02,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:02,040 INFO L93 Difference]: Finished difference Result 1571 states and 3324 transitions. [2019-12-27 23:32:02,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:32:02,040 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 166 [2019-12-27 23:32:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:02,042 INFO L225 Difference]: With dead ends: 1571 [2019-12-27 23:32:02,042 INFO L226 Difference]: Without dead ends: 1440 [2019-12-27 23:32:02,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1969, Invalid=4511, Unknown=0, NotChecked=0, Total=6480 [2019-12-27 23:32:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-12-27 23:32:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1440. [2019-12-27 23:32:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2019-12-27 23:32:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 3013 transitions. [2019-12-27 23:32:02,059 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 3013 transitions. Word has length 166 [2019-12-27 23:32:02,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:02,059 INFO L462 AbstractCegarLoop]: Abstraction has 1440 states and 3013 transitions. [2019-12-27 23:32:02,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-27 23:32:02,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 3013 transitions. [2019-12-27 23:32:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-27 23:32:02,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:02,062 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 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:32:02,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:02,266 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:02,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1395689316, now seen corresponding path program 54 times [2019-12-27 23:32:02,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:02,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300135613] [2019-12-27 23:32:02,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:02,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300135613] [2019-12-27 23:32:02,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097305180] [2019-12-27 23:32:02,868 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:02,978 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-12-27 23:32:02,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:02,980 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-27 23:32:02,983 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:03,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:03,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:03,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:03,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:03,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-12-27 23:32:03,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1273417812] [2019-12-27 23:32:03,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:03,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:03,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 612 states and 1052 transitions. [2019-12-27 23:32:03,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:03,874 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 110 times. [2019-12-27 23:32:03,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 23:32:03,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:03,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 23:32:03,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1379, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 23:32:03,875 INFO L87 Difference]: Start difference. First operand 1440 states and 3013 transitions. Second operand 42 states. [2019-12-27 23:32:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:05,150 INFO L93 Difference]: Finished difference Result 1587 states and 3356 transitions. [2019-12-27 23:32:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:32:05,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 170 [2019-12-27 23:32:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:05,152 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 23:32:05,152 INFO L226 Difference]: Without dead ends: 1456 [2019-12-27 23:32:05,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2069, Invalid=4737, Unknown=0, NotChecked=0, Total=6806 [2019-12-27 23:32:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-12-27 23:32:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 861. [2019-12-27 23:32:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-12-27 23:32:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1855 transitions. [2019-12-27 23:32:05,165 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1855 transitions. Word has length 170 [2019-12-27 23:32:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:05,165 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1855 transitions. [2019-12-27 23:32:05,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 23:32:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1855 transitions. [2019-12-27 23:32:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-27 23:32:05,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:05,166 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 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:32:05,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:05,367 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:05,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:05,367 INFO L82 PathProgramCache]: Analyzing trace with hash -135682032, now seen corresponding path program 55 times [2019-12-27 23:32:05,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:05,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856035719] [2019-12-27 23:32:05,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:05,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:05,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856035719] [2019-12-27 23:32:05,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59389469] [2019-12-27 23:32:05,980 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:06,058 INFO L264 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-27 23:32:06,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:06,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:06,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:06,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:06,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-12-27 23:32:06,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [232443978] [2019-12-27 23:32:06,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:06,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:06,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 624 states and 1076 transitions. [2019-12-27 23:32:06,874 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:06,880 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 113 times. [2019-12-27 23:32:06,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-27 23:32:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-27 23:32:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=1379, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 23:32:06,881 INFO L87 Difference]: Start difference. First operand 861 states and 1855 transitions. Second operand 42 states. [2019-12-27 23:32:08,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:08,195 INFO L93 Difference]: Finished difference Result 1603 states and 3388 transitions. [2019-12-27 23:32:08,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:32:08,195 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 170 [2019-12-27 23:32:08,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:08,197 INFO L225 Difference]: With dead ends: 1603 [2019-12-27 23:32:08,197 INFO L226 Difference]: Without dead ends: 1472 [2019-12-27 23:32:08,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1992, Invalid=4650, Unknown=0, NotChecked=0, Total=6642 [2019-12-27 23:32:08,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-12-27 23:32:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1472. [2019-12-27 23:32:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2019-12-27 23:32:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 3077 transitions. [2019-12-27 23:32:08,216 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 3077 transitions. Word has length 170 [2019-12-27 23:32:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:08,216 INFO L462 AbstractCegarLoop]: Abstraction has 1472 states and 3077 transitions. [2019-12-27 23:32:08,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-27 23:32:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 3077 transitions. [2019-12-27 23:32:08,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-27 23:32:08,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:08,220 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 18, 18, 18, 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:32:08,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:08,424 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:08,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:08,424 INFO L82 PathProgramCache]: Analyzing trace with hash 703887405, now seen corresponding path program 56 times [2019-12-27 23:32:08,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:08,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040667445] [2019-12-27 23:32:08,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:09,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040667445] [2019-12-27 23:32:09,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679412755] [2019-12-27 23:32:09,036 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:09,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 23:32:09,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:09,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-27 23:32:09,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:09,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:09,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:09,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:09,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-12-27 23:32:09,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [512301071] [2019-12-27 23:32:09,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:09,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:09,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 628 states and 1080 transitions. [2019-12-27 23:32:09,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:09,958 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 113 times. [2019-12-27 23:32:09,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 23:32:09,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:09,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 23:32:09,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:32:09,959 INFO L87 Difference]: Start difference. First operand 1472 states and 3077 transitions. Second operand 43 states. [2019-12-27 23:32:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:11,320 INFO L93 Difference]: Finished difference Result 1619 states and 3420 transitions. [2019-12-27 23:32:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:32:11,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2019-12-27 23:32:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:11,322 INFO L225 Difference]: With dead ends: 1619 [2019-12-27 23:32:11,322 INFO L226 Difference]: Without dead ends: 1488 [2019-12-27 23:32:11,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2172, Invalid=4968, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 23:32:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-27 23:32:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 877. [2019-12-27 23:32:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-27 23:32:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1887 transitions. [2019-12-27 23:32:11,334 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1887 transitions. Word has length 174 [2019-12-27 23:32:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:11,334 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1887 transitions. [2019-12-27 23:32:11,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 23:32:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1887 transitions. [2019-12-27 23:32:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-27 23:32:11,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:11,335 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 18, 18, 18, 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:32:11,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:11,536 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1467447809, now seen corresponding path program 57 times [2019-12-27 23:32:11,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:11,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835746752] [2019-12-27 23:32:11,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:12,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835746752] [2019-12-27 23:32:12,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160947574] [2019-12-27 23:32:12,114 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:12,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-12-27 23:32:12,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:12,217 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-27 23:32:12,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:12,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 0 proven. 1333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:12,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:12,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-12-27 23:32:12,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [610944385] [2019-12-27 23:32:12,301 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:12,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:13,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 640 states and 1104 transitions. [2019-12-27 23:32:13,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:13,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 116 times. [2019-12-27 23:32:13,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 23:32:13,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 23:32:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 23:32:13,263 INFO L87 Difference]: Start difference. First operand 877 states and 1887 transitions. Second operand 43 states. [2019-12-27 23:32:14,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:14,597 INFO L93 Difference]: Finished difference Result 1635 states and 3452 transitions. [2019-12-27 23:32:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 23:32:14,597 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 174 [2019-12-27 23:32:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:14,599 INFO L225 Difference]: With dead ends: 1635 [2019-12-27 23:32:14,599 INFO L226 Difference]: Without dead ends: 1504 [2019-12-27 23:32:14,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2093, Invalid=4879, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 23:32:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2019-12-27 23:32:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1504. [2019-12-27 23:32:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2019-12-27 23:32:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 3141 transitions. [2019-12-27 23:32:14,616 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 3141 transitions. Word has length 174 [2019-12-27 23:32:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:14,617 INFO L462 AbstractCegarLoop]: Abstraction has 1504 states and 3141 transitions. [2019-12-27 23:32:14,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 23:32:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 3141 transitions. [2019-12-27 23:32:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-27 23:32:14,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:14,620 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 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:32:14,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:14,824 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash -382536802, now seen corresponding path program 58 times [2019-12-27 23:32:14,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:14,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600255466] [2019-12-27 23:32:14,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:15,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600255466] [2019-12-27 23:32:15,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505615684] [2019-12-27 23:32:15,473 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:15,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 23:32:15,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:15,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-27 23:32:15,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:15,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:15,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-12-27 23:32:15,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360569703] [2019-12-27 23:32:15,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:15,657 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:16,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 644 states and 1108 transitions. [2019-12-27 23:32:16,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:16,504 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 116 times. [2019-12-27 23:32:16,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-27 23:32:16,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:16,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-27 23:32:16,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=1511, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:32:16,506 INFO L87 Difference]: Start difference. First operand 1504 states and 3141 transitions. Second operand 44 states. [2019-12-27 23:32:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:17,875 INFO L93 Difference]: Finished difference Result 1651 states and 3484 transitions. [2019-12-27 23:32:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 23:32:17,875 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 178 [2019-12-27 23:32:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:17,877 INFO L225 Difference]: With dead ends: 1651 [2019-12-27 23:32:17,877 INFO L226 Difference]: Without dead ends: 1520 [2019-12-27 23:32:17,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2277, Invalid=5205, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 23:32:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-12-27 23:32:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 893. [2019-12-27 23:32:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-12-27 23:32:17,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1919 transitions. [2019-12-27 23:32:17,889 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1919 transitions. Word has length 178 [2019-12-27 23:32:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:17,889 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1919 transitions. [2019-12-27 23:32:17,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-27 23:32:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1919 transitions. [2019-12-27 23:32:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-27 23:32:17,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:17,891 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 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:32:18,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:18,091 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:18,092 INFO L82 PathProgramCache]: Analyzing trace with hash -166276022, now seen corresponding path program 59 times [2019-12-27 23:32:18,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:18,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958482912] [2019-12-27 23:32:18,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:18,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958482912] [2019-12-27 23:32:18,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44706050] [2019-12-27 23:32:18,734 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:18,832 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-12-27 23:32:18,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:18,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-27 23:32:18,836 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:18,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:18,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:18,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 23:32:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:18,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 23:32:18,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-12-27 23:32:18,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700129746] [2019-12-27 23:32:18,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:18,953 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:19,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 656 states and 1132 transitions. [2019-12-27 23:32:19,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:19,828 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 119 times. [2019-12-27 23:32:19,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-27 23:32:19,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-27 23:32:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=1511, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:32:19,829 INFO L87 Difference]: Start difference. First operand 893 states and 1919 transitions. Second operand 44 states. [2019-12-27 23:32:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:21,236 INFO L93 Difference]: Finished difference Result 1667 states and 3516 transitions. [2019-12-27 23:32:21,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 23:32:21,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 178 [2019-12-27 23:32:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:21,238 INFO L225 Difference]: With dead ends: 1667 [2019-12-27 23:32:21,239 INFO L226 Difference]: Without dead ends: 1536 [2019-12-27 23:32:21,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2196, Invalid=5114, Unknown=0, NotChecked=0, Total=7310 [2019-12-27 23:32:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2019-12-27 23:32:21,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1536. [2019-12-27 23:32:21,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2019-12-27 23:32:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 3205 transitions. [2019-12-27 23:32:21,253 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 3205 transitions. Word has length 178 [2019-12-27 23:32:21,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:21,253 INFO L462 AbstractCegarLoop]: Abstraction has 1536 states and 3205 transitions. [2019-12-27 23:32:21,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-27 23:32:21,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 3205 transitions. [2019-12-27 23:32:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-27 23:32:21,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:21,255 INFO L411 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 19, 19, 19, 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:32:21,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:21,456 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:21,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash -468568217, now seen corresponding path program 60 times [2019-12-27 23:32:21,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:21,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348893145] [2019-12-27 23:32:21,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 1425 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:22,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348893145] [2019-12-27 23:32:22,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704770491] [2019-12-27 23:32:22,419 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:22,518 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-12-27 23:32:22,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 23:32:22,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 23:32:22,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 1483 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:22,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 23:32:22,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2019-12-27 23:32:22,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [390732546] [2019-12-27 23:32:22,631 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:22,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:23,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 660 states and 1136 transitions. [2019-12-27 23:32:23,706 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:23,712 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 66 times. [2019-12-27 23:32:23,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 23:32:23,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 23:32:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:32:23,713 INFO L87 Difference]: Start difference. First operand 1536 states and 3205 transitions. Second operand 43 states. [2019-12-27 23:32:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:24,909 INFO L93 Difference]: Finished difference Result 13620 states and 27027 transitions. [2019-12-27 23:32:24,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 23:32:24,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 182 [2019-12-27 23:32:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:24,911 INFO L225 Difference]: With dead ends: 13620 [2019-12-27 23:32:24,911 INFO L226 Difference]: Without dead ends: 888 [2019-12-27 23:32:24,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2209, Invalid=4931, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 23:32:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-12-27 23:32:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2019-12-27 23:32:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-12-27 23:32:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1798 transitions. [2019-12-27 23:32:24,923 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1798 transitions. Word has length 182 [2019-12-27 23:32:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:24,923 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1798 transitions. [2019-12-27 23:32:24,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 23:32:24,923 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1798 transitions. [2019-12-27 23:32:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-27 23:32:24,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:32:24,925 INFO L411 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 19, 19, 19, 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:32:25,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:25,129 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:32:25,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:32:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash -429917893, now seen corresponding path program 61 times [2019-12-27 23:32:25,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:32:25,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691680992] [2019-12-27 23:32:25,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:32:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 1425 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:25,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691680992] [2019-12-27 23:32:25,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406705653] [2019-12-27 23:32:25,767 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:32:25,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-27 23:32:25,852 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 23:32:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 1483 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 23:32:25,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-27 23:32:25,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [43] total 45 [2019-12-27 23:32:25,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284164405] [2019-12-27 23:32:25,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:32:25,969 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:32:26,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 672 states and 1160 transitions. [2019-12-27 23:32:26,920 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:32:26,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 70 times. [2019-12-27 23:32:26,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-27 23:32:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:32:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-27 23:32:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=1491, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 23:32:26,924 INFO L87 Difference]: Start difference. First operand 888 states and 1798 transitions. Second operand 43 states. [2019-12-27 23:32:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:32:27,980 INFO L93 Difference]: Finished difference Result 6924 states and 12826 transitions. [2019-12-27 23:32:27,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 23:32:27,980 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 182 [2019-12-27 23:32:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:32:27,981 INFO L225 Difference]: With dead ends: 6924 [2019-12-27 23:32:27,981 INFO L226 Difference]: Without dead ends: 0 [2019-12-27 23:32:27,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2209, Invalid=4931, Unknown=0, NotChecked=0, Total=7140 [2019-12-27 23:32:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-27 23:32:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-27 23:32:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-27 23:32:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-27 23:32:27,983 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2019-12-27 23:32:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:32:27,983 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-27 23:32:27,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-27 23:32:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-27 23:32:27,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-27 23:32:28,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 23:32:28,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:32:28 BasicIcfg [2019-12-27 23:32:28,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:32:28,194 INFO L168 Benchmark]: Toolchain (without parser) took 112840.89 ms. Allocated memory was 147.8 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 104.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 23:32:28,194 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 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:32:28,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.81 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.9 MB in the beginning and 164.0 MB in the end (delta: -60.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:28,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.83 ms. Allocated memory is still 203.9 MB. Free memory was 164.0 MB in the beginning and 162.0 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:32:28,195 INFO L168 Benchmark]: Boogie Preprocessor took 28.19 ms. Allocated memory is still 203.9 MB. Free memory was 162.0 MB in the beginning and 160.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:28,196 INFO L168 Benchmark]: RCFGBuilder took 450.47 ms. Allocated memory is still 203.9 MB. Free memory was 160.1 MB in the beginning and 140.9 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:32:28,196 INFO L168 Benchmark]: TraceAbstraction took 111593.91 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 140.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 23:32:28,198 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.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 124.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 696.81 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.9 MB in the beginning and 164.0 MB in the end (delta: -60.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.83 ms. Allocated memory is still 203.9 MB. Free memory was 164.0 MB in the beginning and 162.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.19 ms. Allocated memory is still 203.9 MB. Free memory was 162.0 MB in the beginning and 160.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 450.47 ms. Allocated memory is still 203.9 MB. Free memory was 160.1 MB in the beginning and 140.9 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111593.91 ms. Allocated memory was 203.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 140.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 703]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 111.4s, OverallIterations: 68, TraceHistogramMax: 21, AutomataDifference: 43.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4093 SDtfs, 20211 SDslu, 37300 SDs, 0 SdLazy, 7031 SolverSat, 5252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13608 GetRequests, 10558 SyntacticMatches, 0 SemanticMatches, 3050 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33775 ImplicationChecksByTransitivity, 52.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1536occurred in iteration=66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 68 MinimizatonAttempts, 10845 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 23.8s InterpolantComputationTime, 13346 NumberOfCodeBlocks, 13346 NumberOfCodeBlocksAsserted, 472 NumberOfCheckSat, 13215 ConstructedInterpolants, 0 QuantifiedInterpolants, 4888131 SizeOfPredicates, 1553 NumberOfNonLiveVariables, 15055 ConjunctsInSsa, 1752 ConjunctsInUnsatCore, 131 InterpolantComputations, 7 PerfectInterpolantSequences, 5816/63824 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 correct! Received shutdown request...