/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:11:51,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:11:51,964 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:11:51,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:11:51,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:11:51,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:11:51,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:11:52,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:11:52,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:11:52,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:11:52,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:11:52,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:11:52,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:11:52,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:11:52,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:11:52,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:11:52,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:11:52,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:11:52,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:11:52,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:11:52,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:11:52,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:11:52,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:11:52,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:11:52,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:11:52,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:11:52,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:11:52,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:11:52,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:11:52,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:11:52,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:11:52,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:11:52,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:11:52,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:11:52,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:11:52,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:11:52,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:11:52,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:11:52,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:11:52,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:11:52,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:11:52,052 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 19:11:52,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:11:52,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:11:52,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:11:52,083 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:11:52,083 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:11:52,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:11:52,083 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:11:52,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:11:52,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:11:52,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:11:52,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:11:52,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:11:52,084 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:11:52,085 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:11:52,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:11:52,085 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:11:52,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:11:52,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:11:52,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:11:52,086 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:11:52,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:11:52,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:11:52,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:11:52,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:11:52,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:11:52,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:11:52,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:11:52,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:11:52,088 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:11:52,356 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:11:52,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:11:52,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:11:52,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:11:52,374 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:11:52,375 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-18 19:11:52,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8e55a67/40ce84a624244f5690c9a56fd15e5b95/FLAGfe8b34438 [2019-12-18 19:11:52,982 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:11:52,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-2.i [2019-12-18 19:11:52,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8e55a67/40ce84a624244f5690c9a56fd15e5b95/FLAGfe8b34438 [2019-12-18 19:11:53,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8e55a67/40ce84a624244f5690c9a56fd15e5b95 [2019-12-18 19:11:53,305 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:11:53,307 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:11:53,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:11:53,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:11:53,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:11:53,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2045420d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:53, skipping insertion in model container [2019-12-18 19:11:53,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:11:53" (1/1) ... [2019-12-18 19:11:53,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:11:53,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:11:53,926 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:11:53,942 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:11:54,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:11:54,097 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:11:54,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54 WrapperNode [2019-12-18 19:11:54,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:11:54,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:11:54,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:11:54,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:11:54,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:11:54,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:11:54,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:11:54,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:11:54,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (1/1) ... [2019-12-18 19:11:54,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:11:54,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:11:54,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:11:54,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:11:54,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (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-18 19:11:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-18 19:11:54,237 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-18 19:11:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-18 19:11:54,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-18 19:11:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:11:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:11:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:11:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:11:54,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:11:54,241 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 19:11:54,601 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:11:54,601 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-18 19:11:54,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:11:54 BoogieIcfgContainer [2019-12-18 19:11:54,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:11:54,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:11:54,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:11:54,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:11:54,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:11:53" (1/3) ... [2019-12-18 19:11:54,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5a398f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:11:54, skipping insertion in model container [2019-12-18 19:11:54,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:11:54" (2/3) ... [2019-12-18 19:11:54,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5a398f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:11:54, skipping insertion in model container [2019-12-18 19:11:54,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:11:54" (3/3) ... [2019-12-18 19:11:54,610 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-2.i [2019-12-18 19:11:54,618 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:11:54,618 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:11:54,625 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 19:11:54,626 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:11:54,654 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,654 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,654 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,655 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,656 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,656 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,657 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,657 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,657 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,658 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,658 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,658 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,658 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,659 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,659 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,659 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,660 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,660 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,664 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,664 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,665 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,665 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,665 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,673 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,674 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,674 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,674 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,674 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,675 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:54,688 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-18 19:11:54,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:54,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:54,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:54,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:54,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:54,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:54,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:54,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:54,720 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-18 19:11:54,722 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 19:11:54,763 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 19:11:54,764 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:54,770 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 8/63 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 19:11:54,774 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-18 19:11:54,792 INFO L126 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-18 19:11:54,792 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:54,794 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 8/63 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-18 19:11:54,797 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-18 19:11:54,798 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:11:56,024 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 19:11:56,194 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-18 19:11:56,194 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-18 19:11:56,200 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-18 19:11:56,216 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-18 19:11:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-18 19:11:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:11:56,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:56,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:11:56,225 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:56,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:56,229 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-18 19:11:56,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:56,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959234352] [2019-12-18 19:11:56,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:56,406 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-18 19:11:56,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959234352] [2019-12-18 19:11:56,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:56,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:11:56,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073964789] [2019-12-18 19:11:56,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:11:56,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:56,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:11:56,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:56,429 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-18 19:11:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:56,461 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-18 19:11:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:11:56,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:11:56,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:56,476 INFO L225 Difference]: With dead ends: 35 [2019-12-18 19:11:56,476 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 19:11:56,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 19:11:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-18 19:11:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 19:11:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-18 19:11:56,524 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-18 19:11:56,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:56,525 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-18 19:11:56,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:11:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-18 19:11:56,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:11:56,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:56,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:56,526 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:56,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:56,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-18 19:11:56,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:56,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85695937] [2019-12-18 19:11:56,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:56,639 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-18 19:11:56,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85695937] [2019-12-18 19:11:56,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:56,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:11:56,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762053857] [2019-12-18 19:11:56,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:11:56,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:56,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:11:56,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:11:56,643 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-18 19:11:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:56,657 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-18 19:11:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:11:56,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 19:11:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:56,659 INFO L225 Difference]: With dead ends: 26 [2019-12-18 19:11:56,659 INFO L226 Difference]: Without dead ends: 24 [2019-12-18 19:11:56,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:11:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-18 19:11:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-18 19:11:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 19:11:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-18 19:11:56,664 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-18 19:11:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:56,665 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-18 19:11:56,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:11:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-18 19:11:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-18 19:11:56,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:56,666 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:56,666 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:11:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:56,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-18 19:11:56,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:56,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968342916] [2019-12-18 19:11:56,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:56,759 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:11:56,760 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:11:56,760 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:11:56,760 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-18 19:11:56,773 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,774 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,774 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,775 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,775 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,775 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,775 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,775 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,776 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,776 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,777 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,777 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,777 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,777 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,781 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,781 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,782 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,782 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,783 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,783 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,784 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,785 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,785 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,786 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,786 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,786 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,786 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,786 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,786 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,787 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,788 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,791 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,792 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,793 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,793 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,796 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,797 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,798 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,798 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,802 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,802 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,806 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,806 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:56,808 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 19:11:56,808 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:56,808 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:56,808 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:56,809 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:56,809 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:56,809 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:56,809 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:56,809 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:56,811 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-18 19:11:56,813 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 19:11:56,845 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 19:11:56,845 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:56,847 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 20/95 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-18 19:11:56,851 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-18 19:11:56,866 INFO L126 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-18 19:11:56,867 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:56,868 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 20/95 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-18 19:11:56,872 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-18 19:11:56,872 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:11:57,987 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 19:11:58,301 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-18 19:11:58,301 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-18 19:11:58,301 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-18 19:11:58,315 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-18 19:11:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-18 19:11:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:11:58,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:58,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:11:58,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-18 19:11:58,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:58,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212180898] [2019-12-18 19:11:58,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:58,393 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-18 19:11:58,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212180898] [2019-12-18 19:11:58,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:58,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:11:58,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583481491] [2019-12-18 19:11:58,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:11:58,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:58,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:11:58,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:58,395 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-18 19:11:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:58,421 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-18 19:11:58,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:11:58,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:11:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:58,427 INFO L225 Difference]: With dead ends: 185 [2019-12-18 19:11:58,427 INFO L226 Difference]: Without dead ends: 171 [2019-12-18 19:11:58,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:11:58,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-18 19:11:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-18 19:11:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-18 19:11:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-18 19:11:58,456 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-18 19:11:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:58,456 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-18 19:11:58,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:11:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-18 19:11:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:11:58,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:58,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:58,457 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:58,458 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-18 19:11:58,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:58,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305878918] [2019-12-18 19:11:58,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:58,502 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-18 19:11:58,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305878918] [2019-12-18 19:11:58,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:58,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:11:58,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257424208] [2019-12-18 19:11:58,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:11:58,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:11:58,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:11:58,504 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-18 19:11:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:58,559 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-18 19:11:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:11:58,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:11:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:58,562 INFO L225 Difference]: With dead ends: 204 [2019-12-18 19:11:58,562 INFO L226 Difference]: Without dead ends: 201 [2019-12-18 19:11:58,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:11:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-18 19:11:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-18 19:11:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 19:11:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-18 19:11:58,581 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-18 19:11:58,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:58,581 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-18 19:11:58,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:11:58,582 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-18 19:11:58,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:11:58,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:58,583 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:58,583 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:58,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:58,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-18 19:11:58,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:58,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311325096] [2019-12-18 19:11:58,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:11:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:11:58,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311325096] [2019-12-18 19:11:58,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:11:58,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:11:58,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099935483] [2019-12-18 19:11:58,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:11:58,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:11:58,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:11:58,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:11:58,631 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-18 19:11:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:11:58,736 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-18 19:11:58,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:11:58,738 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:11:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:11:58,743 INFO L225 Difference]: With dead ends: 189 [2019-12-18 19:11:58,743 INFO L226 Difference]: Without dead ends: 185 [2019-12-18 19:11:58,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:11:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-18 19:11:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-18 19:11:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-18 19:11:58,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-18 19:11:58,764 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-18 19:11:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:11:58,765 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-18 19:11:58,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:11:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-18 19:11:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:11:58,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:11:58,767 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:11:58,767 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:11:58,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:11:58,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-18 19:11:58,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:11:58,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196495558] [2019-12-18 19:11:58,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:11:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:11:58,814 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:11:58,815 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:11:58,815 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:11:58,815 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-18 19:11:58,826 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,826 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,827 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,827 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,832 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,832 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,833 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,833 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,833 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,833 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,833 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,833 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,834 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,834 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,834 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,834 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,834 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,834 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,841 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,841 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,842 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,842 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,842 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,842 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,842 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,842 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,843 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,843 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,843 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,843 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,844 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,846 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,846 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,846 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,848 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,848 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,848 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,848 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,850 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,850 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,850 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,851 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,851 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,851 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,851 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,851 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,853 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,853 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,853 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,858 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,858 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,858 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,859 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,859 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,859 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,860 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:11:58,865 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 19:11:58,865 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:11:58,865 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:11:58,865 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:11:58,865 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:11:58,866 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:11:58,866 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:11:58,866 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:11:58,866 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:11:58,871 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-18 19:11:58,871 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 19:11:58,898 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 19:11:58,898 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:58,903 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 19:11:58,907 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-18 19:11:58,924 INFO L126 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-18 19:11:58,924 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:11:58,925 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 173 event pairs. 36/131 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-18 19:11:58,928 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-18 19:11:58,929 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:12:00,471 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 19:12:00,536 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-18 19:12:00,537 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-18 19:12:00,537 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-18 19:12:00,563 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-18 19:12:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-18 19:12:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:12:00,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:00,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:12:00,564 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:00,564 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-18 19:12:00,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:00,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270465551] [2019-12-18 19:12:00,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:00,593 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-18 19:12:00,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270465551] [2019-12-18 19:12:00,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:00,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:12:00,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725934265] [2019-12-18 19:12:00,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:12:00,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:12:00,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:00,595 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-18 19:12:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:00,640 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-18 19:12:00,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:12:00,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:12:00,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:00,651 INFO L225 Difference]: With dead ends: 600 [2019-12-18 19:12:00,651 INFO L226 Difference]: Without dead ends: 559 [2019-12-18 19:12:00,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:00,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-18 19:12:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-18 19:12:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-18 19:12:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-18 19:12:00,692 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-18 19:12:00,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:00,692 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-18 19:12:00,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:12:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-18 19:12:00,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:12:00,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:00,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:00,693 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:00,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-18 19:12:00,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:00,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358362574] [2019-12-18 19:12:00,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:00,738 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-18 19:12:00,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358362574] [2019-12-18 19:12:00,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:00,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:00,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625393058] [2019-12-18 19:12:00,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:00,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:00,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:00,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:00,741 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-18 19:12:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:00,829 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-18 19:12:00,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:00,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:12:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:00,835 INFO L225 Difference]: With dead ends: 802 [2019-12-18 19:12:00,836 INFO L226 Difference]: Without dead ends: 799 [2019-12-18 19:12:00,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-18 19:12:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-18 19:12:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-18 19:12:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-18 19:12:00,861 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-18 19:12:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:00,862 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-18 19:12:00,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-18 19:12:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:12:00,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:00,863 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:00,863 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-18 19:12:00,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:00,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784577619] [2019-12-18 19:12:00,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:00,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784577619] [2019-12-18 19:12:00,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:00,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:00,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841296177] [2019-12-18 19:12:00,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:00,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:00,899 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-18 19:12:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:00,974 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-18 19:12:00,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:00,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:00,981 INFO L225 Difference]: With dead ends: 832 [2019-12-18 19:12:00,981 INFO L226 Difference]: Without dead ends: 828 [2019-12-18 19:12:00,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:00,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-18 19:12:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-18 19:12:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-18 19:12:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-18 19:12:01,005 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-18 19:12:01,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:01,006 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-18 19:12:01,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-18 19:12:01,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:01,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:01,007 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:01,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:01,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-18 19:12:01,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:01,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650901203] [2019-12-18 19:12:01,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:01,065 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-18 19:12:01,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650901203] [2019-12-18 19:12:01,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279182717] [2019-12-18 19:12:01,066 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-18 19:12:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:01,135 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:01,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:01,168 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-18 19:12:01,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:01,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:01,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061746711] [2019-12-18 19:12:01,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:01,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:01,171 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-18 19:12:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:01,369 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-18 19:12:01,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:01,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 19:12:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:01,378 INFO L225 Difference]: With dead ends: 1052 [2019-12-18 19:12:01,378 INFO L226 Difference]: Without dead ends: 1048 [2019-12-18 19:12:01,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-18 19:12:01,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-18 19:12:01,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-18 19:12:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-18 19:12:01,403 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-18 19:12:01,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:01,403 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-18 19:12:01,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:01,404 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-18 19:12:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:01,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:01,405 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:01,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:01,610 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:01,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:01,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-18 19:12:01,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:01,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476901312] [2019-12-18 19:12:01,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:01,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476901312] [2019-12-18 19:12:01,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:01,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:01,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609448556] [2019-12-18 19:12:01,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:01,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:01,666 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-18 19:12:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:01,875 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-18 19:12:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:01,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:12:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:01,886 INFO L225 Difference]: With dead ends: 1050 [2019-12-18 19:12:01,886 INFO L226 Difference]: Without dead ends: 1045 [2019-12-18 19:12:01,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:01,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-18 19:12:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-18 19:12:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-18 19:12:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-18 19:12:01,942 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-18 19:12:01,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:01,943 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-18 19:12:01,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:01,943 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-18 19:12:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:01,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:01,948 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:01,948 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-18 19:12:01,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:01,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003730696] [2019-12-18 19:12:01,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:02,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003730696] [2019-12-18 19:12:02,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:02,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569595941] [2019-12-18 19:12:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:02,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:02,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:02,034 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-18 19:12:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:02,103 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-18 19:12:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:02,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:02,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:02,109 INFO L225 Difference]: With dead ends: 736 [2019-12-18 19:12:02,109 INFO L226 Difference]: Without dead ends: 728 [2019-12-18 19:12:02,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:02,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-18 19:12:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-18 19:12:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-18 19:12:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-18 19:12:02,129 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-18 19:12:02,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:02,130 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-18 19:12:02,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-18 19:12:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 19:12:02,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:02,131 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:02,132 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:02,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-18 19:12:02,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:02,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353012398] [2019-12-18 19:12:02,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:02,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:12:02,185 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:12:02,186 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:12:02,186 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-18 19:12:02,202 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,202 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,202 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,202 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,202 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,203 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,203 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,203 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,203 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,204 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,204 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,204 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,204 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,205 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,205 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,205 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,205 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,205 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,205 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,206 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,206 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,206 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,206 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,206 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,206 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,206 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,207 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,208 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,208 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,208 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,208 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,208 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,208 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,208 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,209 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,209 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,209 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,210 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,210 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,211 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,211 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,212 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,212 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,212 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,213 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,213 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,214 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,214 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,215 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,215 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,216 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,217 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,217 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,217 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,217 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,217 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,219 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,219 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,219 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,220 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,220 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,221 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,221 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,222 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,222 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,222 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,224 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,224 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,224 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,225 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,225 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,226 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,227 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,227 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,227 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,227 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,227 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,229 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,230 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,230 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,230 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,230 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,232 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,232 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,233 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,233 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,235 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,235 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,236 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,236 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:02,239 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 19:12:02,239 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:12:02,239 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:12:02,240 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:12:02,240 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:12:02,240 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:12:02,240 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:12:02,240 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:12:02,240 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:12:02,242 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-18 19:12:02,242 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 19:12:02,272 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 19:12:02,272 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:02,275 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 56/171 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-18 19:12:02,281 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-18 19:12:02,302 INFO L126 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-18 19:12:02,302 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:02,304 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 56/171 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-18 19:12:02,309 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-18 19:12:02,309 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:12:03,820 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 19:12:04,230 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-18 19:12:04,230 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-18 19:12:04,230 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-18 19:12:04,361 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-18 19:12:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-18 19:12:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:12:04,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:04,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:12:04,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-18 19:12:04,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:04,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711349749] [2019-12-18 19:12:04,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:04,384 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-18 19:12:04,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711349749] [2019-12-18 19:12:04,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:04,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:12:04,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581542025] [2019-12-18 19:12:04,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:12:04,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:04,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:12:04,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:04,386 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-18 19:12:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:04,428 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-18 19:12:04,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:12:04,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:12:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:04,445 INFO L225 Difference]: With dead ends: 1889 [2019-12-18 19:12:04,445 INFO L226 Difference]: Without dead ends: 1767 [2019-12-18 19:12:04,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-18 19:12:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-18 19:12:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-18 19:12:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-18 19:12:04,510 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-18 19:12:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:04,511 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-18 19:12:04,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:12:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-18 19:12:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:12:04,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:04,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:04,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:04,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:04,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-18 19:12:04,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:04,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613554113] [2019-12-18 19:12:04,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:04,557 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-18 19:12:04,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613554113] [2019-12-18 19:12:04,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:04,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:04,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064125450] [2019-12-18 19:12:04,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:04,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:04,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:04,560 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-18 19:12:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:04,632 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-18 19:12:04,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:04,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:12:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:04,656 INFO L225 Difference]: With dead ends: 2826 [2019-12-18 19:12:04,657 INFO L226 Difference]: Without dead ends: 2823 [2019-12-18 19:12:04,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-18 19:12:04,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-18 19:12:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-18 19:12:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-18 19:12:04,737 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-18 19:12:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:04,737 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-18 19:12:04,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-18 19:12:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:12:04,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:04,738 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:04,738 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:04,739 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-18 19:12:04,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:04,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160439795] [2019-12-18 19:12:04,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:04,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160439795] [2019-12-18 19:12:04,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:04,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:04,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29865773] [2019-12-18 19:12:04,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:04,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:04,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:04,777 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-18 19:12:04,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:04,879 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-18 19:12:04,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:04,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:04,908 INFO L225 Difference]: With dead ends: 3124 [2019-12-18 19:12:04,909 INFO L226 Difference]: Without dead ends: 3120 [2019-12-18 19:12:04,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:04,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-18 19:12:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-18 19:12:04,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-18 19:12:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-18 19:12:05,003 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-18 19:12:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:05,003 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-18 19:12:05,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-18 19:12:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:05,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:05,004 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:05,005 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-18 19:12:05,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:05,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892949240] [2019-12-18 19:12:05,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,050 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-18 19:12:05,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892949240] [2019-12-18 19:12:05,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108095382] [2019-12-18 19:12:05,051 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-18 19:12:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,181 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:05,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:05,205 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-18 19:12:05,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:05,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:05,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772848187] [2019-12-18 19:12:05,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:05,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:05,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:05,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:05,207 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-18 19:12:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:05,431 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-18 19:12:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:05,431 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 19:12:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:05,456 INFO L225 Difference]: With dead ends: 4460 [2019-12-18 19:12:05,456 INFO L226 Difference]: Without dead ends: 4456 [2019-12-18 19:12:05,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-18 19:12:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-18 19:12:05,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-18 19:12:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-18 19:12:05,554 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-18 19:12:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:05,554 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-18 19:12:05,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-18 19:12:05,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:05,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:05,555 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:05,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:05,759 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:05,759 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-18 19:12:05,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:05,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585357557] [2019-12-18 19:12:05,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:05,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585357557] [2019-12-18 19:12:05,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:05,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:05,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905270462] [2019-12-18 19:12:05,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:05,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:05,817 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-18 19:12:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:06,074 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-18 19:12:06,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:06,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:12:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:06,092 INFO L225 Difference]: With dead ends: 4522 [2019-12-18 19:12:06,092 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 19:12:06,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 19:12:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-18 19:12:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-18 19:12:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-18 19:12:06,184 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-18 19:12:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:06,184 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-18 19:12:06,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:06,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-18 19:12:06,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:06,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:06,186 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:06,186 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-18 19:12:06,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:06,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137426224] [2019-12-18 19:12:06,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:06,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137426224] [2019-12-18 19:12:06,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:06,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:06,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435827185] [2019-12-18 19:12:06,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:06,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:06,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:06,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:06,219 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-18 19:12:06,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:06,305 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-18 19:12:06,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:06,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:06,319 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 19:12:06,319 INFO L226 Difference]: Without dead ends: 3200 [2019-12-18 19:12:06,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-18 19:12:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-18 19:12:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-18 19:12:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-18 19:12:06,433 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-18 19:12:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:06,433 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-18 19:12:06,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-18 19:12:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:06,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:06,435 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:06,435 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:06,436 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-18 19:12:06,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:06,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240701339] [2019-12-18 19:12:06,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:12:06,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240701339] [2019-12-18 19:12:06,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032133258] [2019-12-18 19:12:06,503 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-18 19:12:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:06,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:06,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:12:06,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:06,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:06,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576624262] [2019-12-18 19:12:06,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:06,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:06,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:06,593 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 9 states. [2019-12-18 19:12:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:06,785 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-18 19:12:06,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:06,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:06,801 INFO L225 Difference]: With dead ends: 4759 [2019-12-18 19:12:06,802 INFO L226 Difference]: Without dead ends: 4753 [2019-12-18 19:12:06,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-18 19:12:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-18 19:12:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-18 19:12:06,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-18 19:12:06,895 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-18 19:12:06,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:06,896 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-18 19:12:06,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:06,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-18 19:12:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:06,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:06,897 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:07,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:07,101 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:07,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:07,101 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-18 19:12:07,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:07,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015469633] [2019-12-18 19:12:07,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:07,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015469633] [2019-12-18 19:12:07,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267039101] [2019-12-18 19:12:07,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:07,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:07,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:07,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:07,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:07,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241148076] [2019-12-18 19:12:07,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:07,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:07,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:07,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:07,261 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-18 19:12:07,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:07,572 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-18 19:12:07,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:07,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:07,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:07,589 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 19:12:07,589 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 19:12:07,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 19:12:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-18 19:12:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-18 19:12:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-18 19:12:07,691 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-18 19:12:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:07,691 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-18 19:12:07,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-18 19:12:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:07,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:07,693 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:07,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:07,897 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:07,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:07,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-18 19:12:07,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:07,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289731650] [2019-12-18 19:12:07,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:07,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289731650] [2019-12-18 19:12:07,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:07,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:07,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217180856] [2019-12-18 19:12:07,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:07,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:07,951 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-18 19:12:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:08,182 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-18 19:12:08,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:08,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:08,199 INFO L225 Difference]: With dead ends: 4884 [2019-12-18 19:12:08,199 INFO L226 Difference]: Without dead ends: 4875 [2019-12-18 19:12:08,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-18 19:12:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-18 19:12:08,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-18 19:12:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-18 19:12:08,276 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-18 19:12:08,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:08,276 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-18 19:12:08,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-18 19:12:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:08,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:08,278 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:08,278 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-18 19:12:08,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:08,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43935951] [2019-12-18 19:12:08,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:08,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43935951] [2019-12-18 19:12:08,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:08,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:08,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701791891] [2019-12-18 19:12:08,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:08,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:08,324 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-18 19:12:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:08,523 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-18 19:12:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:08,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:08,535 INFO L225 Difference]: With dead ends: 4737 [2019-12-18 19:12:08,535 INFO L226 Difference]: Without dead ends: 4728 [2019-12-18 19:12:08,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-18 19:12:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-18 19:12:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-18 19:12:08,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-18 19:12:08,608 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-18 19:12:08,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:08,608 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-18 19:12:08,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-18 19:12:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:08,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:08,610 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:08,610 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-18 19:12:08,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:08,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052042520] [2019-12-18 19:12:08,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:12:08,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052042520] [2019-12-18 19:12:08,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037608023] [2019-12-18 19:12:08,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:08,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:08,840 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:12:08,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:08,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:08,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597285977] [2019-12-18 19:12:08,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:08,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:08,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:08,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:08,863 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 11 states. [2019-12-18 19:12:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:09,476 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-18 19:12:09,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:09,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:09,490 INFO L225 Difference]: With dead ends: 5995 [2019-12-18 19:12:09,491 INFO L226 Difference]: Without dead ends: 5991 [2019-12-18 19:12:09,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-18 19:12:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-18 19:12:09,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-18 19:12:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-18 19:12:09,574 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-18 19:12:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:09,574 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-18 19:12:09,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-18 19:12:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:09,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:09,577 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:09,780 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:09,781 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-18 19:12:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236584428] [2019-12-18 19:12:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:12:09,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236584428] [2019-12-18 19:12:09,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459419099] [2019-12-18 19:12:09,838 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:09,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:09,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:09,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:09,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-18 19:12:09,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:09,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:09,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38009645] [2019-12-18 19:12:09,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:09,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:09,930 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 11 states. [2019-12-18 19:12:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:10,521 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-18 19:12:10,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:10,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:10,530 INFO L225 Difference]: With dead ends: 5889 [2019-12-18 19:12:10,531 INFO L226 Difference]: Without dead ends: 5883 [2019-12-18 19:12:10,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-18 19:12:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-18 19:12:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-18 19:12:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-18 19:12:10,603 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-18 19:12:10,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:10,604 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-18 19:12:10,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-18 19:12:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:10,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:10,607 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:10,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:10,820 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:10,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-18 19:12:10,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:10,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165366399] [2019-12-18 19:12:10,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:10,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165366399] [2019-12-18 19:12:10,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469884331] [2019-12-18 19:12:10,883 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:10,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:12:10,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:10,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:10,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:10,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:10,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:10,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379970879] [2019-12-18 19:12:10,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:10,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:10,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:10,986 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 11 states. [2019-12-18 19:12:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:11,537 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-18 19:12:11,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:11,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:11,551 INFO L225 Difference]: With dead ends: 5888 [2019-12-18 19:12:11,551 INFO L226 Difference]: Without dead ends: 5884 [2019-12-18 19:12:11,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-18 19:12:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-18 19:12:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-18 19:12:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-18 19:12:11,628 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-18 19:12:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:11,628 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-18 19:12:11,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-18 19:12:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:11,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:11,631 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:11,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:11,836 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-18 19:12:11,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:11,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567719466] [2019-12-18 19:12:11,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:11,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567719466] [2019-12-18 19:12:11,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691379919] [2019-12-18 19:12:11,900 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:11,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:11,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:11,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:11,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:11,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:11,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:11,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865155805] [2019-12-18 19:12:11,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:11,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:11,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:11,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:11,998 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-18 19:12:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:12,648 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-18 19:12:12,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:12,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:12,658 INFO L225 Difference]: With dead ends: 5819 [2019-12-18 19:12:12,658 INFO L226 Difference]: Without dead ends: 5813 [2019-12-18 19:12:12,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-18 19:12:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-18 19:12:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-18 19:12:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-18 19:12:12,710 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-18 19:12:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:12,710 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-18 19:12:12,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-18 19:12:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:12,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:12,712 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:12,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:12,916 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:12,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-18 19:12:12,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:12,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853796116] [2019-12-18 19:12:12,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:12,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:12,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853796116] [2019-12-18 19:12:12,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:12,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:12,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12070043] [2019-12-18 19:12:12,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:12,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:12,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:12,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:12,960 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-18 19:12:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:13,039 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-18 19:12:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:13,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:12:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:13,049 INFO L225 Difference]: With dead ends: 3010 [2019-12-18 19:12:13,049 INFO L226 Difference]: Without dead ends: 2994 [2019-12-18 19:12:13,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-18 19:12:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-18 19:12:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-18 19:12:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-18 19:12:13,108 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-18 19:12:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:13,109 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-18 19:12:13,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-18 19:12:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:13,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:13,110 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:13,110 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:13,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-18 19:12:13,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:13,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263068060] [2019-12-18 19:12:13,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:13,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263068060] [2019-12-18 19:12:13,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:13,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:13,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084462209] [2019-12-18 19:12:13,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:13,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:13,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:13,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:13,175 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-18 19:12:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:13,703 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-18 19:12:13,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:13,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:13,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:13,714 INFO L225 Difference]: With dead ends: 6140 [2019-12-18 19:12:13,715 INFO L226 Difference]: Without dead ends: 6133 [2019-12-18 19:12:13,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-18 19:12:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-18 19:12:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-18 19:12:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-18 19:12:13,835 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-18 19:12:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:13,835 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-18 19:12:13,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-18 19:12:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:13,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:13,837 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:13,837 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-18 19:12:13,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:13,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397363952] [2019-12-18 19:12:13,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:13,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397363952] [2019-12-18 19:12:13,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:13,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:13,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617377305] [2019-12-18 19:12:13,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:13,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:13,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:13,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:13,903 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-18 19:12:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:14,386 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-18 19:12:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:14,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:14,396 INFO L225 Difference]: With dead ends: 6012 [2019-12-18 19:12:14,396 INFO L226 Difference]: Without dead ends: 6002 [2019-12-18 19:12:14,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-18 19:12:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-18 19:12:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-18 19:12:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-18 19:12:14,477 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-18 19:12:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:14,478 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-18 19:12:14,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-18 19:12:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 19:12:14,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:14,480 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:14,480 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 19:12:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:14,481 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-18 19:12:14,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:14,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424704646] [2019-12-18 19:12:14,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:12:14,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:12:14,523 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:12:14,524 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:12:14,524 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-18 19:12:14,536 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,537 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,537 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,537 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,537 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,537 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,537 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,538 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,538 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,538 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,539 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,539 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,539 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,543 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,543 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,543 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,543 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,543 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,543 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,543 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,544 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,544 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,544 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,545 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,546 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,546 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,546 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,546 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,546 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,546 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,547 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,547 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,548 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,548 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,548 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,550 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,550 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,550 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,551 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,551 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,552 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,552 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,552 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,552 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,553 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,553 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,553 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,555 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,555 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,556 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,557 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,557 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,558 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,558 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,559 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,559 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,560 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,560 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,561 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,562 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,562 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,562 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,562 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,563 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,563 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,565 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,565 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,565 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,565 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,566 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,566 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,568 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,568 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,568 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,568 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,569 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,571 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,571 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,572 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,572 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,574 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,574 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,574 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,574 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,575 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,575 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:12:14,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-18 19:12:14,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:12:14,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:12:14,577 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:12:14,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:12:14,578 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:12:14,578 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:12:14,578 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:12:14,578 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:12:14,579 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-18 19:12:14,580 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 19:12:14,596 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 19:12:14,597 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:14,599 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 80/215 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-18 19:12:14,606 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-18 19:12:14,622 INFO L126 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-18 19:12:14,623 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:12:14,625 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 80/215 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-18 19:12:14,632 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-18 19:12:14,632 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:12:16,311 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-18 19:12:16,776 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-18 19:12:16,776 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-18 19:12:16,776 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-18 19:12:17,159 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-18 19:12:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-18 19:12:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:12:17,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:17,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:12:17,160 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-18 19:12:17,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:17,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49863] [2019-12-18 19:12:17,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:17,172 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-18 19:12:17,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49863] [2019-12-18 19:12:17,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:17,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:12:17,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660225302] [2019-12-18 19:12:17,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:12:17,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:17,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:12:17,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:17,174 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-18 19:12:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:17,238 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-18 19:12:17,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:12:17,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:12:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:17,258 INFO L225 Difference]: With dead ends: 5844 [2019-12-18 19:12:17,258 INFO L226 Difference]: Without dead ends: 5479 [2019-12-18 19:12:17,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:12:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-18 19:12:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-18 19:12:17,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-18 19:12:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-18 19:12:17,509 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-18 19:12:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:17,509 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-18 19:12:17,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:12:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-18 19:12:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:12:17,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:17,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:17,510 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-18 19:12:17,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:17,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350679064] [2019-12-18 19:12:17,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:17,532 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-18 19:12:17,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350679064] [2019-12-18 19:12:17,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:17,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:17,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431096136] [2019-12-18 19:12:17,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:17,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:17,534 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-18 19:12:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:17,681 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-18 19:12:17,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:17,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:12:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:17,714 INFO L225 Difference]: With dead ends: 9358 [2019-12-18 19:12:17,714 INFO L226 Difference]: Without dead ends: 9355 [2019-12-18 19:12:17,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-18 19:12:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-18 19:12:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-18 19:12:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-18 19:12:17,921 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-18 19:12:17,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:17,922 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-18 19:12:17,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:17,922 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-18 19:12:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:12:17,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:17,922 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:17,923 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:17,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:17,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-18 19:12:17,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:17,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189780897] [2019-12-18 19:12:17,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:17,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189780897] [2019-12-18 19:12:17,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:17,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:17,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116921049] [2019-12-18 19:12:17,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:17,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:17,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:17,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:17,948 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-18 19:12:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:18,108 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-18 19:12:18,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:18,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:12:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:18,147 INFO L225 Difference]: With dead ends: 10720 [2019-12-18 19:12:18,148 INFO L226 Difference]: Without dead ends: 10716 [2019-12-18 19:12:18,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-18 19:12:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-18 19:12:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 19:12:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-18 19:12:18,397 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-18 19:12:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:18,397 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-18 19:12:18,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-18 19:12:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:18,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:18,398 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:18,398 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:18,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-18 19:12:18,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:18,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312429385] [2019-12-18 19:12:18,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:18,441 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-18 19:12:18,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312429385] [2019-12-18 19:12:18,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931854394] [2019-12-18 19:12:18,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:19,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:19,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:19,170 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-18 19:12:19,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:19,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:19,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561731916] [2019-12-18 19:12:19,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:19,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:19,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:19,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:19,172 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-18 19:12:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:19,431 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-18 19:12:19,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:19,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-18 19:12:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:19,468 INFO L225 Difference]: With dead ends: 16250 [2019-12-18 19:12:19,469 INFO L226 Difference]: Without dead ends: 16246 [2019-12-18 19:12:19,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-18 19:12:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-18 19:12:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-18 19:12:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-18 19:12:19,722 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-18 19:12:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:19,723 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-18 19:12:19,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-18 19:12:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:12:19,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:19,723 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:19,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:19,924 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:19,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:19,925 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-18 19:12:19,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:19,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160109079] [2019-12-18 19:12:19,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:19,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160109079] [2019-12-18 19:12:19,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:19,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:19,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590429282] [2019-12-18 19:12:19,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:19,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:19,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:19,962 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-18 19:12:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:20,215 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-18 19:12:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:20,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:12:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:20,253 INFO L225 Difference]: With dead ends: 16584 [2019-12-18 19:12:20,253 INFO L226 Difference]: Without dead ends: 16579 [2019-12-18 19:12:20,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-18 19:12:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-18 19:12:20,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-18 19:12:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-18 19:12:20,590 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-18 19:12:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:20,590 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-18 19:12:20,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-18 19:12:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:12:20,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:20,591 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:20,592 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-18 19:12:20,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:20,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448815349] [2019-12-18 19:12:20,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:20,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:20,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448815349] [2019-12-18 19:12:20,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:20,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:20,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120992427] [2019-12-18 19:12:20,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:20,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:20,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:20,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:20,626 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-18 19:12:20,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:20,752 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-18 19:12:20,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:20,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:12:20,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:20,780 INFO L225 Difference]: With dead ends: 11876 [2019-12-18 19:12:20,780 INFO L226 Difference]: Without dead ends: 11868 [2019-12-18 19:12:20,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-18 19:12:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-18 19:12:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-18 19:12:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-18 19:12:20,953 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-18 19:12:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:20,953 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-18 19:12:20,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-18 19:12:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:20,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:20,954 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:20,955 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:20,955 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-18 19:12:20,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:20,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735253421] [2019-12-18 19:12:20,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:20,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735253421] [2019-12-18 19:12:20,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777947263] [2019-12-18 19:12:20,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:21,096 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:21,097 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:21,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:21,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:21,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638162786] [2019-12-18 19:12:21,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:21,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:21,119 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 9 states. [2019-12-18 19:12:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:21,435 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-18 19:12:21,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:21,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:21,475 INFO L225 Difference]: With dead ends: 18509 [2019-12-18 19:12:21,476 INFO L226 Difference]: Without dead ends: 18503 [2019-12-18 19:12:21,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-18 19:12:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-18 19:12:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-18 19:12:21,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-18 19:12:21,802 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-18 19:12:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:21,803 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-18 19:12:21,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-18 19:12:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:21,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:21,804 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:22,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:22,007 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:22,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:22,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-18 19:12:22,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:22,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588286078] [2019-12-18 19:12:22,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:22,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588286078] [2019-12-18 19:12:22,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907189888] [2019-12-18 19:12:22,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:22,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:22,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:22,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:22,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:22,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975223133] [2019-12-18 19:12:22,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:22,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:22,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:22,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:22,145 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 9 states. [2019-12-18 19:12:22,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:22,522 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-18 19:12:22,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:22,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-18 19:12:22,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:22,605 INFO L225 Difference]: With dead ends: 19158 [2019-12-18 19:12:22,606 INFO L226 Difference]: Without dead ends: 19149 [2019-12-18 19:12:22,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-18 19:12:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-18 19:12:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-18 19:12:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-18 19:12:22,977 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-18 19:12:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:22,977 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-18 19:12:22,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:22,977 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-18 19:12:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:22,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:22,978 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:23,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:23,179 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:23,179 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-18 19:12:23,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:23,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733462626] [2019-12-18 19:12:23,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:23,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733462626] [2019-12-18 19:12:23,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:23,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:23,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507018529] [2019-12-18 19:12:23,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:23,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:23,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:23,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:23,217 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-18 19:12:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:23,671 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-18 19:12:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:23,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:23,740 INFO L225 Difference]: With dead ends: 19350 [2019-12-18 19:12:23,740 INFO L226 Difference]: Without dead ends: 19341 [2019-12-18 19:12:23,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-18 19:12:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-18 19:12:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-18 19:12:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-18 19:12:24,002 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-18 19:12:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:24,003 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-18 19:12:24,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-18 19:12:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:12:24,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:24,004 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:24,004 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:24,004 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-18 19:12:24,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:24,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66506745] [2019-12-18 19:12:24,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:24,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66506745] [2019-12-18 19:12:24,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:24,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:24,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32719069] [2019-12-18 19:12:24,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:24,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:24,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:24,040 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-18 19:12:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:24,332 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-18 19:12:24,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:24,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:12:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:24,372 INFO L225 Difference]: With dead ends: 19087 [2019-12-18 19:12:24,372 INFO L226 Difference]: Without dead ends: 19078 [2019-12-18 19:12:24,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-18 19:12:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-18 19:12:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-18 19:12:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-18 19:12:24,626 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-18 19:12:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:24,626 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-18 19:12:24,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-18 19:12:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:24,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:24,628 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:24,628 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:24,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-18 19:12:24,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:24,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138535790] [2019-12-18 19:12:24,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:24,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138535790] [2019-12-18 19:12:24,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813697485] [2019-12-18 19:12:24,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:24,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:24,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:24,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:24,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:24,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666516554] [2019-12-18 19:12:24,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:24,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:24,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:24,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:24,889 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 11 states. [2019-12-18 19:12:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:25,575 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-18 19:12:25,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:25,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:25,635 INFO L225 Difference]: With dead ends: 26399 [2019-12-18 19:12:25,635 INFO L226 Difference]: Without dead ends: 26395 [2019-12-18 19:12:25,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-18 19:12:25,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 7999. [2019-12-18 19:12:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-18 19:12:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-18 19:12:25,934 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-18 19:12:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:25,934 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-18 19:12:25,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-18 19:12:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:25,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:25,935 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:26,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:26,136 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:26,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-18 19:12:26,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:26,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024292106] [2019-12-18 19:12:26,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:26,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024292106] [2019-12-18 19:12:26,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009669011] [2019-12-18 19:12:26,198 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:26,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:26,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:26,280 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:26,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:26,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:26,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:26,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75338254] [2019-12-18 19:12:26,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:26,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:26,302 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 11 states. [2019-12-18 19:12:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:27,294 INFO L93 Difference]: Finished difference Result 26109 states and 99244 transitions. [2019-12-18 19:12:27,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:27,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:27,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:27,380 INFO L225 Difference]: With dead ends: 26109 [2019-12-18 19:12:27,381 INFO L226 Difference]: Without dead ends: 26103 [2019-12-18 19:12:27,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:27,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2019-12-18 19:12:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 7893. [2019-12-18 19:12:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-18 19:12:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-18 19:12:27,669 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-18 19:12:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:27,669 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-18 19:12:27,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-18 19:12:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:27,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:27,671 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:27,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:27,871 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:27,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-18 19:12:27,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:27,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508325433] [2019-12-18 19:12:27,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:27,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508325433] [2019-12-18 19:12:27,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147027426] [2019-12-18 19:12:27,929 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:28,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:12:28,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:28,012 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:28,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:28,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:28,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:28,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749838064] [2019-12-18 19:12:28,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:28,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:28,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:28,038 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 11 states. [2019-12-18 19:12:28,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:28,730 INFO L93 Difference]: Finished difference Result 26144 states and 99382 transitions. [2019-12-18 19:12:28,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:28,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:28,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:28,792 INFO L225 Difference]: With dead ends: 26144 [2019-12-18 19:12:28,792 INFO L226 Difference]: Without dead ends: 26140 [2019-12-18 19:12:28,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26140 states. [2019-12-18 19:12:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26140 to 7675. [2019-12-18 19:12:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-18 19:12:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-18 19:12:29,087 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-18 19:12:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:29,087 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-18 19:12:29,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-18 19:12:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:29,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:29,088 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:29,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:29,289 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-18 19:12:29,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:29,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680042998] [2019-12-18 19:12:29,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:29,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:29,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680042998] [2019-12-18 19:12:29,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572873017] [2019-12-18 19:12:29,352 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:29,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:29,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:29,549 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:29,551 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:12:29,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:29,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:29,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766931502] [2019-12-18 19:12:29,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:29,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:29,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:29,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:29,589 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 11 states. [2019-12-18 19:12:30,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:30,287 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-18 19:12:30,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:30,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-18 19:12:30,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:30,350 INFO L225 Difference]: With dead ends: 25959 [2019-12-18 19:12:30,350 INFO L226 Difference]: Without dead ends: 25953 [2019-12-18 19:12:30,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-18 19:12:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-18 19:12:30,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-18 19:12:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-18 19:12:30,637 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-18 19:12:30,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:30,638 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-18 19:12:30,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-18 19:12:30,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:30,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:30,639 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:30,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:30,840 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:30,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-18 19:12:30,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:30,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876660336] [2019-12-18 19:12:30,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:30,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876660336] [2019-12-18 19:12:30,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:30,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:30,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81982588] [2019-12-18 19:12:30,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:30,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:30,868 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-18 19:12:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:31,019 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-18 19:12:31,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:31,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:12:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:31,062 INFO L225 Difference]: With dead ends: 12952 [2019-12-18 19:12:31,062 INFO L226 Difference]: Without dead ends: 12936 [2019-12-18 19:12:31,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-18 19:12:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-18 19:12:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-18 19:12:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-18 19:12:31,266 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-18 19:12:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:31,267 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-18 19:12:31,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-18 19:12:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:31,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:31,268 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:31,268 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-18 19:12:31,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:31,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743808507] [2019-12-18 19:12:31,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:31,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743808507] [2019-12-18 19:12:31,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:31,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:31,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262020723] [2019-12-18 19:12:31,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:31,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:31,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:31,321 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-18 19:12:32,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:32,195 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-18 19:12:32,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:32,195 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:32,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:32,288 INFO L225 Difference]: With dead ends: 29252 [2019-12-18 19:12:32,288 INFO L226 Difference]: Without dead ends: 29245 [2019-12-18 19:12:32,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-18 19:12:32,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-18 19:12:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 19:12:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-18 19:12:32,635 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-18 19:12:32,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:32,635 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-18 19:12:32,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-18 19:12:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:12:32,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:32,637 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:32,637 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:32,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-18 19:12:32,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:32,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54093019] [2019-12-18 19:12:32,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:32,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54093019] [2019-12-18 19:12:32,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:32,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:32,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076688503] [2019-12-18 19:12:32,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:32,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:32,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:32,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:32,702 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-18 19:12:33,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:33,396 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-18 19:12:33,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:33,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:12:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:33,460 INFO L225 Difference]: With dead ends: 28866 [2019-12-18 19:12:33,460 INFO L226 Difference]: Without dead ends: 28856 [2019-12-18 19:12:33,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:33,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-18 19:12:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-18 19:12:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-18 19:12:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-18 19:12:33,790 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-18 19:12:33,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:33,791 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-18 19:12:33,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:33,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-18 19:12:33,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:33,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:33,793 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:33,793 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:33,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:33,793 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-18 19:12:33,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:33,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300475439] [2019-12-18 19:12:33,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:33,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300475439] [2019-12-18 19:12:33,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532559018] [2019-12-18 19:12:33,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:33,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:33,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:34,069 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-18 19:12:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:34,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:34,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:34,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945917562] [2019-12-18 19:12:34,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:34,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:34,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:34,073 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 9 states. [2019-12-18 19:12:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:34,380 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-18 19:12:34,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:34,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-18 19:12:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:34,423 INFO L225 Difference]: With dead ends: 19371 [2019-12-18 19:12:34,423 INFO L226 Difference]: Without dead ends: 19359 [2019-12-18 19:12:34,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-18 19:12:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-18 19:12:34,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-18 19:12:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-18 19:12:34,671 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-18 19:12:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:34,671 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-18 19:12:34,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-18 19:12:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:34,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:34,673 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:34,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:34,874 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-18 19:12:34,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:34,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546055453] [2019-12-18 19:12:34,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:34,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546055453] [2019-12-18 19:12:34,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318042835] [2019-12-18 19:12:34,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:35,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:12:35,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:35,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:35,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-18 19:12:35,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299301446] [2019-12-18 19:12:35,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:35,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:35,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:35,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:35,055 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 9 states. [2019-12-18 19:12:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:35,374 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-18 19:12:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:35,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-18 19:12:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:35,420 INFO L225 Difference]: With dead ends: 20331 [2019-12-18 19:12:35,421 INFO L226 Difference]: Without dead ends: 20317 [2019-12-18 19:12:35,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-18 19:12:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-18 19:12:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-18 19:12:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-18 19:12:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-18 19:12:35,673 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-18 19:12:35,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:35,673 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-18 19:12:35,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:35,673 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-18 19:12:35,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:35,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:35,675 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:35,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:35,876 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:35,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-18 19:12:35,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:35,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441985069] [2019-12-18 19:12:35,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:35,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441985069] [2019-12-18 19:12:35,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:35,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:35,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111857986] [2019-12-18 19:12:35,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:35,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:35,917 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-18 19:12:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:36,275 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-18 19:12:36,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:36,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:36,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:36,359 INFO L225 Difference]: With dead ends: 20594 [2019-12-18 19:12:36,360 INFO L226 Difference]: Without dead ends: 20575 [2019-12-18 19:12:36,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:36,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-18 19:12:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-18 19:12:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-18 19:12:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-18 19:12:36,907 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-18 19:12:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:36,908 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-18 19:12:36,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-18 19:12:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:36,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:36,910 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:36,910 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:36,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:36,910 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-18 19:12:36,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:36,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825821433] [2019-12-18 19:12:36,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:36,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825821433] [2019-12-18 19:12:36,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:36,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:36,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485055564] [2019-12-18 19:12:36,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:36,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:36,947 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-18 19:12:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:37,225 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-18 19:12:37,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:37,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:37,270 INFO L225 Difference]: With dead ends: 20360 [2019-12-18 19:12:37,270 INFO L226 Difference]: Without dead ends: 20341 [2019-12-18 19:12:37,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-18 19:12:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-18 19:12:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-18 19:12:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-18 19:12:37,521 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-18 19:12:37,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:37,521 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-18 19:12:37,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-18 19:12:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:37,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:37,523 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:37,524 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:37,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:37,524 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-18 19:12:37,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:37,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757818838] [2019-12-18 19:12:37,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:37,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757818838] [2019-12-18 19:12:37,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:37,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:37,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113100694] [2019-12-18 19:12:37,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:37,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:37,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:37,560 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-18 19:12:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:37,852 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-18 19:12:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:37,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:37,899 INFO L225 Difference]: With dead ends: 20740 [2019-12-18 19:12:37,899 INFO L226 Difference]: Without dead ends: 20721 [2019-12-18 19:12:37,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-18 19:12:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-18 19:12:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-18 19:12:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-18 19:12:38,168 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-18 19:12:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:38,169 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-18 19:12:38,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-18 19:12:38,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:12:38,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:38,171 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:38,171 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:38,171 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-18 19:12:38,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:38,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692032254] [2019-12-18 19:12:38,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:38,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692032254] [2019-12-18 19:12:38,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:38,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:12:38,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618702083] [2019-12-18 19:12:38,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:12:38,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:38,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:12:38,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:38,216 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 7 states. [2019-12-18 19:12:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:38,509 INFO L93 Difference]: Finished difference Result 20896 states and 85782 transitions. [2019-12-18 19:12:38,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:12:38,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:12:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:38,556 INFO L225 Difference]: With dead ends: 20896 [2019-12-18 19:12:38,556 INFO L226 Difference]: Without dead ends: 20877 [2019-12-18 19:12:38,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:12:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-18 19:12:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 9286. [2019-12-18 19:12:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-18 19:12:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-18 19:12:39,045 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-18 19:12:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:39,045 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-18 19:12:39,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:12:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-18 19:12:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:39,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:39,049 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:39,049 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:39,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-18 19:12:39,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:39,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240426100] [2019-12-18 19:12:39,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:39,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240426100] [2019-12-18 19:12:39,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35016252] [2019-12-18 19:12:39,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:39,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:39,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:39,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:39,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:39,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889356690] [2019-12-18 19:12:39,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:39,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:39,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:39,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:39,206 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 11 states. [2019-12-18 19:12:39,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:39,924 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-18 19:12:39,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:39,924 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:39,997 INFO L225 Difference]: With dead ends: 29793 [2019-12-18 19:12:39,997 INFO L226 Difference]: Without dead ends: 29783 [2019-12-18 19:12:39,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-18 19:12:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9200. [2019-12-18 19:12:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-18 19:12:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-18 19:12:40,341 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-18 19:12:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:40,342 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-18 19:12:40,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-18 19:12:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:40,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:40,345 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:40,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:40,546 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:40,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:40,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-18 19:12:40,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:40,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664875726] [2019-12-18 19:12:40,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:40,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:40,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664875726] [2019-12-18 19:12:40,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98456115] [2019-12-18 19:12:40,593 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:40,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:40,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:40,675 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:40,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:40,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:40,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:40,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807202869] [2019-12-18 19:12:40,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:40,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:40,697 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 11 states. [2019-12-18 19:12:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:41,407 INFO L93 Difference]: Finished difference Result 29319 states and 113201 transitions. [2019-12-18 19:12:41,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:41,407 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:41,471 INFO L225 Difference]: With dead ends: 29319 [2019-12-18 19:12:41,471 INFO L226 Difference]: Without dead ends: 29308 [2019-12-18 19:12:41,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:41,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29308 states. [2019-12-18 19:12:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29308 to 9197. [2019-12-18 19:12:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-18 19:12:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-18 19:12:41,801 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-18 19:12:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:41,802 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-18 19:12:41,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-18 19:12:41,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:41,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:41,805 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:42,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:42,006 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-18 19:12:42,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:42,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269762271] [2019-12-18 19:12:42,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:42,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269762271] [2019-12-18 19:12:42,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249534517] [2019-12-18 19:12:42,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:42,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:42,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:42,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:42,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:42,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784896354] [2019-12-18 19:12:42,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:42,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:42,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:42,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:42,303 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 11 states. [2019-12-18 19:12:43,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:43,058 INFO L93 Difference]: Finished difference Result 28997 states and 111934 transitions. [2019-12-18 19:12:43,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:43,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:43,122 INFO L225 Difference]: With dead ends: 28997 [2019-12-18 19:12:43,122 INFO L226 Difference]: Without dead ends: 28987 [2019-12-18 19:12:43,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:43,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28987 states. [2019-12-18 19:12:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28987 to 9121. [2019-12-18 19:12:43,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-18 19:12:43,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-18 19:12:43,478 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-18 19:12:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:43,478 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-18 19:12:43,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-18 19:12:43,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:43,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:43,481 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:43,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:43,682 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:43,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-18 19:12:43,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:43,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121364070] [2019-12-18 19:12:43,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:43,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:43,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121364070] [2019-12-18 19:12:43,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185374704] [2019-12-18 19:12:43,745 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:43,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:43,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:43,827 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:43,828 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:43,844 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:12:43,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:43,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:43,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182932581] [2019-12-18 19:12:43,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:43,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:43,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:43,846 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 11 states. [2019-12-18 19:12:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:44,511 INFO L93 Difference]: Finished difference Result 28781 states and 111002 transitions. [2019-12-18 19:12:44,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:44,511 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:44,574 INFO L225 Difference]: With dead ends: 28781 [2019-12-18 19:12:44,574 INFO L226 Difference]: Without dead ends: 28770 [2019-12-18 19:12:44,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-18 19:12:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 9044. [2019-12-18 19:12:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-18 19:12:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-18 19:12:44,905 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-18 19:12:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:44,905 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-18 19:12:44,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-18 19:12:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:44,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:44,909 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:45,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:45,110 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:45,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:45,110 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-18 19:12:45,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:45,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347307131] [2019-12-18 19:12:45,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 19:12:45,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347307131] [2019-12-18 19:12:45,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458048072] [2019-12-18 19:12:45,168 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:45,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-18 19:12:45,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:45,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:45,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:45,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-18 19:12:45,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:45,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:45,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592388939] [2019-12-18 19:12:45,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:45,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:45,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:45,266 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 11 states. [2019-12-18 19:12:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:46,069 INFO L93 Difference]: Finished difference Result 28747 states and 110799 transitions. [2019-12-18 19:12:46,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:46,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:46,131 INFO L225 Difference]: With dead ends: 28747 [2019-12-18 19:12:46,131 INFO L226 Difference]: Without dead ends: 28737 [2019-12-18 19:12:46,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-18 19:12:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 8874. [2019-12-18 19:12:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-18 19:12:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-18 19:12:46,447 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-18 19:12:46,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:46,447 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-18 19:12:46,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-18 19:12:46,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:46,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:46,450 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:46,651 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:46,651 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-18 19:12:46,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:46,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753446178] [2019-12-18 19:12:46,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:46,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753446178] [2019-12-18 19:12:46,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068978376] [2019-12-18 19:12:46,722 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:46,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:12:46,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:46,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:46,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:46,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:46,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:46,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:46,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51537577] [2019-12-18 19:12:46,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:46,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:46,831 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 11 states. [2019-12-18 19:12:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:47,491 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-18 19:12:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:47,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:47,554 INFO L225 Difference]: With dead ends: 28993 [2019-12-18 19:12:47,554 INFO L226 Difference]: Without dead ends: 28982 [2019-12-18 19:12:47,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:47,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-18 19:12:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-18 19:12:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-18 19:12:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-18 19:12:47,878 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-18 19:12:47,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:47,878 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-18 19:12:47,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:47,878 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-18 19:12:47,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:47,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:47,881 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:48,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:48,082 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:48,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-18 19:12:48,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:48,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540500535] [2019-12-18 19:12:48,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:48,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540500535] [2019-12-18 19:12:48,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4070478] [2019-12-18 19:12:48,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:48,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:48,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:48,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:48,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:48,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097301638] [2019-12-18 19:12:48,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:48,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:48,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:48,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:48,236 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 11 states. [2019-12-18 19:12:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:48,926 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-18 19:12:48,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:48,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:48,989 INFO L225 Difference]: With dead ends: 28840 [2019-12-18 19:12:48,989 INFO L226 Difference]: Without dead ends: 28830 [2019-12-18 19:12:48,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:49,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-18 19:12:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-18 19:12:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-18 19:12:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-18 19:12:49,459 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-18 19:12:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:49,460 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-18 19:12:49,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:49,460 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-18 19:12:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:49,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:49,463 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:49,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:49,664 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-18 19:12:49,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:49,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009028273] [2019-12-18 19:12:49,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:49,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009028273] [2019-12-18 19:12:49,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013681555] [2019-12-18 19:12:49,723 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:49,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:12:49,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:12:49,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:12:49,804 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:12:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-18 19:12:49,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:12:49,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-18 19:12:49,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757702822] [2019-12-18 19:12:49,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:12:49,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:12:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:12:49,823 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 11 states. [2019-12-18 19:12:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:50,644 INFO L93 Difference]: Finished difference Result 28552 states and 110204 transitions. [2019-12-18 19:12:50,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:50,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-18 19:12:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:50,707 INFO L225 Difference]: With dead ends: 28552 [2019-12-18 19:12:50,707 INFO L226 Difference]: Without dead ends: 28538 [2019-12-18 19:12:50,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 19:12:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-18 19:12:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8722. [2019-12-18 19:12:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-18 19:12:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-18 19:12:51,022 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-18 19:12:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:51,022 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-18 19:12:51,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:12:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-18 19:12:51,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:51,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:51,027 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:51,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:12:51,230 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:51,231 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-18 19:12:51,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:51,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014352836] [2019-12-18 19:12:51,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:51,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014352836] [2019-12-18 19:12:51,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:51,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:51,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961624519] [2019-12-18 19:12:51,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:51,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:51,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:51,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:51,307 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-18 19:12:51,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:51,956 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-18 19:12:51,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:51,956 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:52,017 INFO L225 Difference]: With dead ends: 28362 [2019-12-18 19:12:52,018 INFO L226 Difference]: Without dead ends: 28352 [2019-12-18 19:12:52,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-18 19:12:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-18 19:12:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-18 19:12:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-18 19:12:52,329 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-18 19:12:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:52,330 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-18 19:12:52,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-18 19:12:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:52,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:52,333 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:52,333 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:52,333 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-18 19:12:52,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:52,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839992422] [2019-12-18 19:12:52,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:52,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839992422] [2019-12-18 19:12:52,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:52,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:52,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355025811] [2019-12-18 19:12:52,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:52,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:52,389 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-18 19:12:53,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:53,006 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-18 19:12:53,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:53,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:53,068 INFO L225 Difference]: With dead ends: 28156 [2019-12-18 19:12:53,068 INFO L226 Difference]: Without dead ends: 28146 [2019-12-18 19:12:53,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:53,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-18 19:12:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-18 19:12:53,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-18 19:12:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-18 19:12:53,548 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-18 19:12:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:53,549 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-18 19:12:53,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-18 19:12:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:53,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:53,552 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:53,552 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-18 19:12:53,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:53,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175191364] [2019-12-18 19:12:53,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:53,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175191364] [2019-12-18 19:12:53,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:53,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:53,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762073942] [2019-12-18 19:12:53,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:53,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:53,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:53,607 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-18 19:12:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:54,224 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-18 19:12:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:54,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:54,286 INFO L225 Difference]: With dead ends: 27714 [2019-12-18 19:12:54,286 INFO L226 Difference]: Without dead ends: 27700 [2019-12-18 19:12:54,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-18 19:12:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-18 19:12:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-18 19:12:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-18 19:12:54,587 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-18 19:12:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:54,587 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-18 19:12:54,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-18 19:12:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:54,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:54,590 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:54,590 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-18 19:12:54,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:54,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011861834] [2019-12-18 19:12:54,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:54,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:54,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011861834] [2019-12-18 19:12:54,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:54,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:54,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813205257] [2019-12-18 19:12:54,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:54,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:54,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:54,628 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-18 19:12:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:55,334 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-18 19:12:55,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:55,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:55,393 INFO L225 Difference]: With dead ends: 27553 [2019-12-18 19:12:55,394 INFO L226 Difference]: Without dead ends: 27543 [2019-12-18 19:12:55,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-18 19:12:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-18 19:12:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-18 19:12:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-18 19:12:55,686 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-18 19:12:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:55,686 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-18 19:12:55,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-18 19:12:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:55,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:55,689 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:55,689 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:55,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-18 19:12:55,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:55,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603204520] [2019-12-18 19:12:55,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:55,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603204520] [2019-12-18 19:12:55,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:55,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:55,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447228898] [2019-12-18 19:12:55,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:55,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:55,741 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-18 19:12:56,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:56,402 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-18 19:12:56,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:56,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:56,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:56,469 INFO L225 Difference]: With dead ends: 27570 [2019-12-18 19:12:56,470 INFO L226 Difference]: Without dead ends: 27556 [2019-12-18 19:12:56,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-18 19:12:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-18 19:12:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-18 19:12:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-18 19:12:56,767 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-18 19:12:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:56,767 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-18 19:12:56,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:56,767 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-18 19:12:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:56,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:56,771 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:56,771 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:56,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:56,771 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-18 19:12:56,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:56,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030687964] [2019-12-18 19:12:56,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:56,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030687964] [2019-12-18 19:12:56,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:56,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:56,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10219826] [2019-12-18 19:12:56,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:56,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:56,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:56,810 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-18 19:12:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:57,491 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-18 19:12:57,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:57,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:57,550 INFO L225 Difference]: With dead ends: 27265 [2019-12-18 19:12:57,550 INFO L226 Difference]: Without dead ends: 27251 [2019-12-18 19:12:57,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-18 19:12:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-18 19:12:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-18 19:12:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-18 19:12:57,839 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-18 19:12:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:57,840 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-18 19:12:57,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-18 19:12:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:57,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:57,843 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:57,843 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-18 19:12:57,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:57,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130555113] [2019-12-18 19:12:57,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 19:12:57,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130555113] [2019-12-18 19:12:57,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:57,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:12:57,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266837520] [2019-12-18 19:12:57,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:12:57,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:12:57,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:12:57,880 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-18 19:12:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:57,996 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-18 19:12:57,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:12:57,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 19:12:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:58,026 INFO L225 Difference]: With dead ends: 12944 [2019-12-18 19:12:58,026 INFO L226 Difference]: Without dead ends: 12912 [2019-12-18 19:12:58,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:12:58,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-18 19:12:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-18 19:12:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-18 19:12:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-18 19:12:58,217 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-18 19:12:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:58,218 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-18 19:12:58,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:12:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-18 19:12:58,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:58,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:58,221 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:58,221 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:58,221 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-18 19:12:58,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:58,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192402262] [2019-12-18 19:12:58,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:58,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192402262] [2019-12-18 19:12:58,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:58,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:58,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406323689] [2019-12-18 19:12:58,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:58,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:58,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:58,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:58,273 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 9 states. [2019-12-18 19:12:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:12:58,901 INFO L93 Difference]: Finished difference Result 30802 states and 119509 transitions. [2019-12-18 19:12:58,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:12:58,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:12:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:12:58,969 INFO L225 Difference]: With dead ends: 30802 [2019-12-18 19:12:58,969 INFO L226 Difference]: Without dead ends: 30786 [2019-12-18 19:12:58,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:12:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30786 states. [2019-12-18 19:12:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30786 to 9188. [2019-12-18 19:12:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-18 19:12:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-18 19:12:59,311 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-18 19:12:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:12:59,312 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-18 19:12:59,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:12:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-18 19:12:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:12:59,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:12:59,315 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:12:59,315 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:12:59,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:12:59,315 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-18 19:12:59,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:12:59,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84897404] [2019-12-18 19:12:59,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:12:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:12:59,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:12:59,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84897404] [2019-12-18 19:12:59,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:12:59,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:12:59,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792594953] [2019-12-18 19:12:59,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:12:59,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:12:59,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:12:59,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:12:59,365 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 9 states. [2019-12-18 19:13:00,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:00,016 INFO L93 Difference]: Finished difference Result 30412 states and 117823 transitions. [2019-12-18 19:13:00,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:00,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:13:00,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:00,083 INFO L225 Difference]: With dead ends: 30412 [2019-12-18 19:13:00,083 INFO L226 Difference]: Without dead ends: 30392 [2019-12-18 19:13:00,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30392 states. [2019-12-18 19:13:00,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30392 to 8937. [2019-12-18 19:13:00,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-18 19:13:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-18 19:13:00,420 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-18 19:13:00,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:00,420 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-18 19:13:00,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-18 19:13:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:13:00,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:00,424 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:00,424 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:00,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-18 19:13:00,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:00,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209008872] [2019-12-18 19:13:00,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:13:00,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209008872] [2019-12-18 19:13:00,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:00,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:00,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402835593] [2019-12-18 19:13:00,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:00,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:00,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:00,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:00,489 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 9 states. [2019-12-18 19:13:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:01,257 INFO L93 Difference]: Finished difference Result 30029 states and 116246 transitions. [2019-12-18 19:13:01,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:01,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:13:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:01,323 INFO L225 Difference]: With dead ends: 30029 [2019-12-18 19:13:01,323 INFO L226 Difference]: Without dead ends: 30013 [2019-12-18 19:13:01,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-18 19:13:01,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 8839. [2019-12-18 19:13:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-18 19:13:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-18 19:13:01,651 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-18 19:13:01,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:01,652 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-18 19:13:01,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-18 19:13:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:13:01,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:01,655 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:01,655 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-18 19:13:01,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:01,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224567699] [2019-12-18 19:13:01,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:13:01,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224567699] [2019-12-18 19:13:01,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:01,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:01,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733638321] [2019-12-18 19:13:01,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:01,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:01,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:01,697 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 9 states. [2019-12-18 19:13:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:02,423 INFO L93 Difference]: Finished difference Result 29761 states and 115069 transitions. [2019-12-18 19:13:02,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:02,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:13:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:02,489 INFO L225 Difference]: With dead ends: 29761 [2019-12-18 19:13:02,489 INFO L226 Difference]: Without dead ends: 29741 [2019-12-18 19:13:02,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29741 states. [2019-12-18 19:13:02,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29741 to 8516. [2019-12-18 19:13:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-18 19:13:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-18 19:13:02,808 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-18 19:13:02,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:02,808 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-18 19:13:02,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:02,809 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-18 19:13:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 19:13:02,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:02,812 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:02,812 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:02,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-18 19:13:02,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:02,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10428913] [2019-12-18 19:13:02,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:13:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:13:02,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:13:02,830 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:13:02,830 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-18 19:13:02,830 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-18 19:13:02,853 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,853 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,853 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,853 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,854 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,854 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,854 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,854 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,855 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,857 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,859 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,859 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,859 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,859 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,859 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,859 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,859 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,860 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,861 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,861 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,862 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,863 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,863 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,864 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,864 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,864 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,866 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,871 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,871 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,871 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,872 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,873 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,873 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,873 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,873 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,874 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,874 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,875 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,875 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,875 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,876 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,876 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,876 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,876 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,876 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,878 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,878 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,878 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,878 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,878 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,880 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,880 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,880 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,880 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,880 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,882 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,882 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,884 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,884 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,885 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,893 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:13:02,894 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-18 19:13:02,894 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:13:02,894 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:13:02,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:13:02,894 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:13:02,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:13:02,895 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:13:02,895 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:13:02,895 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:13:02,896 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-18 19:13:02,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 19:13:02,916 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 19:13:02,917 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:13:02,920 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 108/263 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-18 19:13:02,929 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-18 19:13:02,949 INFO L126 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-18 19:13:02,949 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:13:02,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 108/263 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-18 19:13:02,964 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-18 19:13:02,964 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 19:13:04,964 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-18 19:13:05,132 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-18 19:13:05,132 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-18 19:13:05,132 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-18 19:13:06,512 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-18 19:13:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-18 19:13:06,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 19:13:06,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:06,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 19:13:06,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:06,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-18 19:13:06,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:06,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732791214] [2019-12-18 19:13:06,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:06,520 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-18 19:13:06,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732791214] [2019-12-18 19:13:06,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:06,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:13:06,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660891249] [2019-12-18 19:13:06,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:13:06,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:13:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:13:06,522 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-18 19:13:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:06,641 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-18 19:13:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:13:06,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 19:13:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:06,689 INFO L225 Difference]: With dead ends: 17885 [2019-12-18 19:13:06,690 INFO L226 Difference]: Without dead ends: 16791 [2019-12-18 19:13:06,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:13:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-18 19:13:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-18 19:13:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-18 19:13:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-18 19:13:07,064 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-18 19:13:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:07,064 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-18 19:13:07,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:13:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-18 19:13:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:13:07,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:07,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:07,064 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:07,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-18 19:13:07,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:07,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459092812] [2019-12-18 19:13:07,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:07,080 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-18 19:13:07,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459092812] [2019-12-18 19:13:07,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:07,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:07,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764040244] [2019-12-18 19:13:07,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:07,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:07,081 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-18 19:13:07,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:07,298 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-18 19:13:07,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:07,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:13:07,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:07,385 INFO L225 Difference]: With dead ends: 29874 [2019-12-18 19:13:07,385 INFO L226 Difference]: Without dead ends: 29871 [2019-12-18 19:13:07,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-18 19:13:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-18 19:13:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-18 19:13:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-18 19:13:07,938 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-18 19:13:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:07,938 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-18 19:13:07,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-18 19:13:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:13:07,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:07,939 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:07,939 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-18 19:13:07,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:07,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981710677] [2019-12-18 19:13:07,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:13:07,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981710677] [2019-12-18 19:13:07,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:07,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:07,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23958362] [2019-12-18 19:13:07,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:07,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:07,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:07,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:07,966 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-18 19:13:08,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:08,202 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-18 19:13:08,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:08,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-18 19:13:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:08,306 INFO L225 Difference]: With dead ends: 34948 [2019-12-18 19:13:08,306 INFO L226 Difference]: Without dead ends: 34944 [2019-12-18 19:13:08,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-18 19:13:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-18 19:13:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-18 19:13:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-18 19:13:11,217 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-18 19:13:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:11,217 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-18 19:13:11,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-18 19:13:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:13:11,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:11,218 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:11,218 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-18 19:13:11,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:11,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135544297] [2019-12-18 19:13:11,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:11,260 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-18 19:13:11,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135544297] [2019-12-18 19:13:11,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61616764] [2019-12-18 19:13:11,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:11,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:11,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:11,352 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-18 19:13:11,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:11,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:11,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672825890] [2019-12-18 19:13:11,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:11,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:11,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:11,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:11,353 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-18 19:13:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:11,815 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-18 19:13:11,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:11,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:13:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:11,972 INFO L225 Difference]: With dead ends: 54752 [2019-12-18 19:13:11,972 INFO L226 Difference]: Without dead ends: 54748 [2019-12-18 19:13:11,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:13:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-18 19:13:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-18 19:13:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-18 19:13:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-18 19:13:12,806 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-18 19:13:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:12,807 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-18 19:13:12,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-18 19:13:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:13:12,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:12,807 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:13,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:13,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:13,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:13,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-18 19:13:13,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:13,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562470380] [2019-12-18 19:13:13,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-18 19:13:13,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562470380] [2019-12-18 19:13:13,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:13,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:13,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392427364] [2019-12-18 19:13:13,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:13,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:13,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:13,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:13,037 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-18 19:13:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:13,508 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-18 19:13:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:13,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-18 19:13:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:13,667 INFO L225 Difference]: With dead ends: 56062 [2019-12-18 19:13:13,667 INFO L226 Difference]: Without dead ends: 56057 [2019-12-18 19:13:13,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:13:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-18 19:13:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-18 19:13:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-18 19:13:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-18 19:13:16,627 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-18 19:13:16,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:16,627 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-18 19:13:16,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-18 19:13:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:13:16,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:16,628 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:16,628 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-18 19:13:16,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:16,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812478353] [2019-12-18 19:13:16,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:16,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:16,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812478353] [2019-12-18 19:13:16,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:16,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:16,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768192520] [2019-12-18 19:13:16,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:16,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:16,646 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-18 19:13:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:16,921 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-18 19:13:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:16,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 19:13:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:17,038 INFO L225 Difference]: With dead ends: 40360 [2019-12-18 19:13:17,038 INFO L226 Difference]: Without dead ends: 40352 [2019-12-18 19:13:17,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-18 19:13:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-18 19:13:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-18 19:13:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-18 19:13:17,790 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-18 19:13:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:17,790 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-18 19:13:17,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-18 19:13:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:17,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:17,791 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:17,791 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-18 19:13:17,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:17,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134980468] [2019-12-18 19:13:17,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:17,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 19:13:17,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134980468] [2019-12-18 19:13:17,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199669940] [2019-12-18 19:13:17,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:17,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:17,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 19:13:17,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:17,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:17,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818567817] [2019-12-18 19:13:17,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:17,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:17,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:17,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:17,915 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-18 19:13:18,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:18,435 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-18 19:13:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:18,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:18,621 INFO L225 Difference]: With dead ends: 64531 [2019-12-18 19:13:18,621 INFO L226 Difference]: Without dead ends: 64525 [2019-12-18 19:13:18,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:13:18,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-18 19:13:20,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-18 19:13:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-18 19:13:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-18 19:13:20,283 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-18 19:13:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:20,283 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-18 19:13:20,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-18 19:13:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:20,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:20,284 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:20,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:20,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:20,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-18 19:13:20,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:20,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846323753] [2019-12-18 19:13:20,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:20,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846323753] [2019-12-18 19:13:20,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:20,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:20,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249120556] [2019-12-18 19:13:20,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:20,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:20,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:20,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:20,525 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-18 19:13:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:21,082 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-18 19:13:21,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:21,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:21,276 INFO L225 Difference]: With dead ends: 66182 [2019-12-18 19:13:21,276 INFO L226 Difference]: Without dead ends: 66173 [2019-12-18 19:13:21,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:13:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-18 19:13:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-18 19:13:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-18 19:13:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-18 19:13:22,323 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-18 19:13:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:22,323 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-18 19:13:22,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-18 19:13:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:22,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:22,324 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:22,324 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-18 19:13:22,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:22,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032762440] [2019-12-18 19:13:22,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:22,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032762440] [2019-12-18 19:13:22,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:22,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:22,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899073919] [2019-12-18 19:13:22,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:22,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:22,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:22,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:22,356 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-18 19:13:22,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:22,896 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-18 19:13:22,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:22,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:23,095 INFO L225 Difference]: With dead ends: 66741 [2019-12-18 19:13:23,095 INFO L226 Difference]: Without dead ends: 66732 [2019-12-18 19:13:23,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:13:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-18 19:13:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-18 19:13:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-18 19:13:26,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-18 19:13:26,335 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-18 19:13:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:26,335 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-18 19:13:26,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-18 19:13:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 19:13:26,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:26,336 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:26,336 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-18 19:13:26,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:26,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263537190] [2019-12-18 19:13:26,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:26,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263537190] [2019-12-18 19:13:26,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:26,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:13:26,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970389944] [2019-12-18 19:13:26,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:26,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:26,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:26,369 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 7 states. [2019-12-18 19:13:26,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:26,906 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-18 19:13:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:26,906 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-18 19:13:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:27,108 INFO L225 Difference]: With dead ends: 67749 [2019-12-18 19:13:27,108 INFO L226 Difference]: Without dead ends: 67740 [2019-12-18 19:13:27,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:13:27,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-18 19:13:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-18 19:13:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-18 19:13:28,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-18 19:13:28,122 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-18 19:13:28,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:28,122 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-18 19:13:28,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:28,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-18 19:13:28,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:28,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:28,123 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:28,123 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-18 19:13:28,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:28,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598230242] [2019-12-18 19:13:28,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:28,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 19:13:28,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598230242] [2019-12-18 19:13:28,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714623585] [2019-12-18 19:13:28,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:28,261 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:13:28,262 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 19:13:28,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:28,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:13:28,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005467619] [2019-12-18 19:13:28,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:28,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:28,266 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 9 states. [2019-12-18 19:13:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:29,758 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-18 19:13:29,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:29,759 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:30,030 INFO L225 Difference]: With dead ends: 97639 [2019-12-18 19:13:30,030 INFO L226 Difference]: Without dead ends: 97635 [2019-12-18 19:13:30,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-18 19:13:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27701. [2019-12-18 19:13:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-18 19:13:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-18 19:13:31,384 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-18 19:13:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:31,384 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-18 19:13:31,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-18 19:13:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:31,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:31,385 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:31,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:31,586 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-18 19:13:31,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:31,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405600146] [2019-12-18 19:13:31,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 19:13:31,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405600146] [2019-12-18 19:13:31,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125840639] [2019-12-18 19:13:31,631 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:31,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:13:31,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:13:31,719 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:13:31,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-18 19:13:31,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:31,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:13:31,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303972657] [2019-12-18 19:13:31,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:31,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:31,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:31,725 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 9 states. [2019-12-18 19:13:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:34,886 INFO L93 Difference]: Finished difference Result 96845 states and 436549 transitions. [2019-12-18 19:13:34,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:34,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:35,163 INFO L225 Difference]: With dead ends: 96845 [2019-12-18 19:13:35,163 INFO L226 Difference]: Without dead ends: 96839 [2019-12-18 19:13:35,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96839 states. [2019-12-18 19:13:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96839 to 27343. [2019-12-18 19:13:36,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-18 19:13:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-18 19:13:36,474 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-18 19:13:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:36,474 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-18 19:13:36,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:36,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-18 19:13:36,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:36,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:36,475 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:36,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:36,676 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-18 19:13:36,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:36,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283495335] [2019-12-18 19:13:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:13:36,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283495335] [2019-12-18 19:13:36,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:36,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:13:36,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178534668] [2019-12-18 19:13:36,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:13:36,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:36,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:13:36,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:13:36,699 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-18 19:13:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:37,032 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-18 19:13:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:13:37,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 19:13:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:37,180 INFO L225 Difference]: With dead ends: 49005 [2019-12-18 19:13:37,181 INFO L226 Difference]: Without dead ends: 48989 [2019-12-18 19:13:37,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-18 19:13:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-18 19:13:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-18 19:13:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-18 19:13:38,714 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-18 19:13:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:38,714 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-18 19:13:38,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:13:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-18 19:13:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:38,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:38,715 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:38,715 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-18 19:13:38,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:38,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957835839] [2019-12-18 19:13:38,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:38,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957835839] [2019-12-18 19:13:38,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:38,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:38,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366553331] [2019-12-18 19:13:38,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:38,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:38,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:38,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:38,769 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-18 19:13:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:39,869 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-18 19:13:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:39,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:40,188 INFO L225 Difference]: With dead ends: 112418 [2019-12-18 19:13:40,188 INFO L226 Difference]: Without dead ends: 112411 [2019-12-18 19:13:40,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-18 19:13:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-18 19:13:42,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-18 19:13:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-18 19:13:42,644 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-18 19:13:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:42,644 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-18 19:13:42,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-18 19:13:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:42,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:42,645 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:42,645 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:42,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:42,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-18 19:13:42,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:42,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864988635] [2019-12-18 19:13:42,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:42,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864988635] [2019-12-18 19:13:42,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:42,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:42,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960725276] [2019-12-18 19:13:42,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:42,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:42,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:42,695 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-18 19:13:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:43,859 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-18 19:13:43,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:43,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:43,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:44,187 INFO L225 Difference]: With dead ends: 111816 [2019-12-18 19:13:44,187 INFO L226 Difference]: Without dead ends: 111807 [2019-12-18 19:13:44,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-18 19:13:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-18 19:13:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-18 19:13:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-18 19:13:46,565 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-18 19:13:46,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:46,566 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-18 19:13:46,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:46,566 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-18 19:13:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:46,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:46,567 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:46,567 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:46,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:46,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-18 19:13:46,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:46,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946902598] [2019-12-18 19:13:46,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:46,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946902598] [2019-12-18 19:13:46,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:46,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:46,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208690013] [2019-12-18 19:13:46,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:46,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:46,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:46,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:46,608 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 9 states. [2019-12-18 19:13:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:47,727 INFO L93 Difference]: Finished difference Result 112148 states and 515023 transitions. [2019-12-18 19:13:47,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:47,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:48,061 INFO L225 Difference]: With dead ends: 112148 [2019-12-18 19:13:48,061 INFO L226 Difference]: Without dead ends: 112141 [2019-12-18 19:13:48,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:48,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112141 states. [2019-12-18 19:13:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112141 to 31950. [2019-12-18 19:13:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-18 19:13:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-18 19:13:52,502 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-18 19:13:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:52,502 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-18 19:13:52,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-18 19:13:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 19:13:52,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:52,503 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:52,504 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-18 19:13:52,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:52,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745803456] [2019-12-18 19:13:52,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-18 19:13:52,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745803456] [2019-12-18 19:13:52,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:13:52,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:13:52,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824111483] [2019-12-18 19:13:52,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:13:52,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:13:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:13:52,555 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 9 states. [2019-12-18 19:13:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:53,635 INFO L93 Difference]: Finished difference Result 111038 states and 509212 transitions. [2019-12-18 19:13:53,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:13:53,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-18 19:13:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:53,964 INFO L225 Difference]: With dead ends: 111038 [2019-12-18 19:13:53,964 INFO L226 Difference]: Without dead ends: 111028 [2019-12-18 19:13:53,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:13:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111028 states. [2019-12-18 19:13:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111028 to 30899. [2019-12-18 19:13:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-18 19:13:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-18 19:13:56,152 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-18 19:13:56,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:56,152 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-18 19:13:56,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:13:56,152 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-18 19:13:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:13:56,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:56,154 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:56,154 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:56,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-18 19:13:56,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:56,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972001124] [2019-12-18 19:13:56,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:13:56,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972001124] [2019-12-18 19:13:56,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935034564] [2019-12-18 19:13:56,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:56,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:56,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:13:56,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:56,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:56,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169952082] [2019-12-18 19:13:56,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:56,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:56,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:56,279 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-18 19:13:56,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:56,876 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-18 19:13:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:56,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:13:56,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:13:57,092 INFO L225 Difference]: With dead ends: 73073 [2019-12-18 19:13:57,092 INFO L226 Difference]: Without dead ends: 73061 [2019-12-18 19:13:57,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:13:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-18 19:13:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-18 19:13:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-18 19:13:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-18 19:13:58,929 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-18 19:13:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:13:58,929 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-18 19:13:58,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:13:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-18 19:13:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:13:58,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:13:58,931 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:13:59,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:59,132 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:13:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:13:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-18 19:13:59,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:13:59,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204487093] [2019-12-18 19:13:59,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:13:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:13:59,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204487093] [2019-12-18 19:13:59,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592793846] [2019-12-18 19:13:59,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:13:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:13:59,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-18 19:13:59,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:13:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:13:59,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:13:59,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-18 19:13:59,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519587093] [2019-12-18 19:13:59,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:13:59,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:13:59,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:13:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:13:59,258 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-18 19:13:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:13:59,859 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-18 19:13:59,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:13:59,860 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:13:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:00,092 INFO L225 Difference]: With dead ends: 77025 [2019-12-18 19:14:00,093 INFO L226 Difference]: Without dead ends: 77011 [2019-12-18 19:14:00,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:14:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-18 19:14:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-18 19:14:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-18 19:14:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-18 19:14:01,792 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-18 19:14:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:01,793 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-18 19:14:01,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:01,793 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-18 19:14:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:01,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:01,795 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:01,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:01,996 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-18 19:14:01,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:01,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146595955] [2019-12-18 19:14:01,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:14:02,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146595955] [2019-12-18 19:14:02,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:02,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101601732] [2019-12-18 19:14:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:02,033 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-18 19:14:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:02,655 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-18 19:14:02,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:02,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:02,894 INFO L225 Difference]: With dead ends: 78384 [2019-12-18 19:14:02,894 INFO L226 Difference]: Without dead ends: 78365 [2019-12-18 19:14:02,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:14:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-18 19:14:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-18 19:14:04,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-18 19:14:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-18 19:14:04,706 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-18 19:14:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:04,706 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-18 19:14:04,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-18 19:14:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:04,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:04,708 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:04,708 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-18 19:14:04,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:04,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536963213] [2019-12-18 19:14:04,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:14:04,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536963213] [2019-12-18 19:14:04,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:04,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:04,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415689818] [2019-12-18 19:14:04,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:04,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:04,743 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-18 19:14:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:05,318 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-18 19:14:05,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:05,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:05,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:05,557 INFO L225 Difference]: With dead ends: 78506 [2019-12-18 19:14:05,557 INFO L226 Difference]: Without dead ends: 78487 [2019-12-18 19:14:05,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:14:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-18 19:14:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-18 19:14:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-18 19:14:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-18 19:14:07,565 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-18 19:14:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:07,565 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-18 19:14:07,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-18 19:14:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:07,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:07,567 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:07,567 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:07,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:07,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-18 19:14:07,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:07,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263137071] [2019-12-18 19:14:07,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:14:07,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263137071] [2019-12-18 19:14:07,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:07,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:07,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018931074] [2019-12-18 19:14:07,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:07,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:07,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:07,600 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-18 19:14:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:08,215 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-18 19:14:08,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:08,216 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:08,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:08,466 INFO L225 Difference]: With dead ends: 80886 [2019-12-18 19:14:08,466 INFO L226 Difference]: Without dead ends: 80867 [2019-12-18 19:14:08,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:14:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-18 19:14:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-18 19:14:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-18 19:14:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-18 19:14:09,743 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-18 19:14:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:09,743 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-18 19:14:09,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-18 19:14:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 19:14:09,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:09,745 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:09,745 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:09,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:09,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-18 19:14:09,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:09,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103649705] [2019-12-18 19:14:09,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:14:09,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103649705] [2019-12-18 19:14:09,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:09,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 19:14:09,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322714224] [2019-12-18 19:14:09,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:14:09,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:09,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:14:09,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:09,789 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 7 states. [2019-12-18 19:14:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:11,586 INFO L93 Difference]: Finished difference Result 81926 states and 399875 transitions. [2019-12-18 19:14:11,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 19:14:11,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-18 19:14:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:11,841 INFO L225 Difference]: With dead ends: 81926 [2019-12-18 19:14:11,841 INFO L226 Difference]: Without dead ends: 81907 [2019-12-18 19:14:11,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-18 19:14:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81907 states. [2019-12-18 19:14:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81907 to 35912. [2019-12-18 19:14:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-18 19:14:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-18 19:14:13,161 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-18 19:14:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:13,161 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-18 19:14:13,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:14:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-18 19:14:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:13,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:13,164 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:13,165 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:13,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:13,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-18 19:14:13,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:13,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901764948] [2019-12-18 19:14:13,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:13,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:13,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901764948] [2019-12-18 19:14:13,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519636329] [2019-12-18 19:14:13,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:13,304 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:13,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:13,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:13,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:13,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026006041] [2019-12-18 19:14:13,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:13,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:13,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:13,307 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 9 states. [2019-12-18 19:14:14,145 WARN L192 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-18 19:14:15,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:15,049 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-18 19:14:15,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:15,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:15,395 INFO L225 Difference]: With dead ends: 119601 [2019-12-18 19:14:15,396 INFO L226 Difference]: Without dead ends: 119591 [2019-12-18 19:14:15,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-18 19:14:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35598. [2019-12-18 19:14:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-18 19:14:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-18 19:14:20,359 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-18 19:14:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:20,359 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-18 19:14:20,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:20,359 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-18 19:14:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:20,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:20,362 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:20,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:20,563 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:20,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-18 19:14:20,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:20,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293010984] [2019-12-18 19:14:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:20,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293010984] [2019-12-18 19:14:20,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453513661] [2019-12-18 19:14:20,605 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:20,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:20,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:20,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:20,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:20,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:20,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:20,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596179294] [2019-12-18 19:14:20,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:20,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:20,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:20,702 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 9 states. [2019-12-18 19:14:21,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:21,914 INFO L93 Difference]: Finished difference Result 118295 states and 546185 transitions. [2019-12-18 19:14:21,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:21,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:21,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:22,258 INFO L225 Difference]: With dead ends: 118295 [2019-12-18 19:14:22,258 INFO L226 Difference]: Without dead ends: 118284 [2019-12-18 19:14:22,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118284 states. [2019-12-18 19:14:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118284 to 35531. [2019-12-18 19:14:24,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-18 19:14:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-18 19:14:24,581 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-18 19:14:24,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:24,581 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-18 19:14:24,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:24,581 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-18 19:14:24,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:24,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:24,585 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:24,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:24,786 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:24,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-18 19:14:24,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:24,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44239870] [2019-12-18 19:14:24,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:24,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44239870] [2019-12-18 19:14:24,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676476833] [2019-12-18 19:14:24,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:24,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:24,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:24,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:24,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:24,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145984920] [2019-12-18 19:14:24,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:24,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:24,928 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 9 states. [2019-12-18 19:14:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:26,033 INFO L93 Difference]: Finished difference Result 117353 states and 541624 transitions. [2019-12-18 19:14:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:26,034 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:26,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:27,267 INFO L225 Difference]: With dead ends: 117353 [2019-12-18 19:14:27,267 INFO L226 Difference]: Without dead ends: 117343 [2019-12-18 19:14:27,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117343 states. [2019-12-18 19:14:28,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117343 to 35223. [2019-12-18 19:14:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-18 19:14:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-18 19:14:28,809 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-18 19:14:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:28,809 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-18 19:14:28,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-18 19:14:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:28,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:28,812 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:29,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:29,013 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:29,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-18 19:14:29,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:29,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249674696] [2019-12-18 19:14:29,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:29,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249674696] [2019-12-18 19:14:29,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226324190] [2019-12-18 19:14:29,058 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:29,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:29,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:29,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:29,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:29,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:29,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:29,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:29,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752559661] [2019-12-18 19:14:29,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:29,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:29,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:29,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:29,154 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 9 states. [2019-12-18 19:14:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:30,660 INFO L93 Difference]: Finished difference Result 116621 states and 537886 transitions. [2019-12-18 19:14:30,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:30,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:30,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:31,005 INFO L225 Difference]: With dead ends: 116621 [2019-12-18 19:14:31,005 INFO L226 Difference]: Without dead ends: 116610 [2019-12-18 19:14:31,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116610 states. [2019-12-18 19:14:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116610 to 34934. [2019-12-18 19:14:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-18 19:14:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-18 19:14:36,406 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-18 19:14:36,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:36,406 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-18 19:14:36,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-18 19:14:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:36,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:36,409 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:36,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:36,612 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:36,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-18 19:14:36,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:36,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852694715] [2019-12-18 19:14:36,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:36,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852694715] [2019-12-18 19:14:36,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102722319] [2019-12-18 19:14:36,658 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:36,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:14:36,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:36,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:36,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:36,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:36,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:36,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195158246] [2019-12-18 19:14:36,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:36,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:36,805 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 9 states. [2019-12-18 19:14:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:37,996 INFO L93 Difference]: Finished difference Result 116675 states and 538001 transitions. [2019-12-18 19:14:37,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:37,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:38,333 INFO L225 Difference]: With dead ends: 116675 [2019-12-18 19:14:38,333 INFO L226 Difference]: Without dead ends: 116665 [2019-12-18 19:14:38,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116665 states. [2019-12-18 19:14:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116665 to 34396. [2019-12-18 19:14:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-18 19:14:40,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-18 19:14:40,440 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-18 19:14:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:40,440 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-18 19:14:40,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:40,440 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-18 19:14:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:40,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:40,443 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:40,643 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:40,643 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:40,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-18 19:14:40,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:40,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13003] [2019-12-18 19:14:40,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:40,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13003] [2019-12-18 19:14:40,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247661147] [2019-12-18 19:14:40,689 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:40,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:14:40,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:40,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:40,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:40,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:40,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:40,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399288085] [2019-12-18 19:14:40,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:40,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:40,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:40,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:40,780 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-18 19:14:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:41,887 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-18 19:14:41,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:41,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:42,226 INFO L225 Difference]: With dead ends: 117673 [2019-12-18 19:14:42,227 INFO L226 Difference]: Without dead ends: 117662 [2019-12-18 19:14:42,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-18 19:14:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-18 19:14:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-18 19:14:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-18 19:14:44,548 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-18 19:14:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:44,549 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-18 19:14:44,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-18 19:14:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:44,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:44,551 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:44,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:44,752 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-18 19:14:44,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:44,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336270236] [2019-12-18 19:14:44,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:44,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336270236] [2019-12-18 19:14:44,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783025537] [2019-12-18 19:14:44,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:44,895 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:44,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:44,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:44,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:44,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571805456] [2019-12-18 19:14:44,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:44,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:44,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:44,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:44,900 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-18 19:14:46,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:46,025 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-18 19:14:46,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:46,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:46,369 INFO L225 Difference]: With dead ends: 117232 [2019-12-18 19:14:46,369 INFO L226 Difference]: Without dead ends: 117222 [2019-12-18 19:14:46,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-18 19:14:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-18 19:14:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-18 19:14:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-18 19:14:48,490 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-18 19:14:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:48,490 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-18 19:14:48,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-18 19:14:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:48,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:48,492 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:48,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:48,693 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:48,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-18 19:14:48,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:48,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071896218] [2019-12-18 19:14:48,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:48,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071896218] [2019-12-18 19:14:48,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797043838] [2019-12-18 19:14:48,738 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:48,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:14:48,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:14:48,829 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:14:48,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:14:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-18 19:14:48,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:14:48,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-18 19:14:48,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834951293] [2019-12-18 19:14:48,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:48,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:48,834 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 9 states. [2019-12-18 19:14:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:50,453 INFO L93 Difference]: Finished difference Result 116256 states and 536656 transitions. [2019-12-18 19:14:50,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:50,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:50,811 INFO L225 Difference]: With dead ends: 116256 [2019-12-18 19:14:50,811 INFO L226 Difference]: Without dead ends: 116242 [2019-12-18 19:14:50,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116242 states. [2019-12-18 19:14:52,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116242 to 33768. [2019-12-18 19:14:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-18 19:14:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-18 19:14:52,415 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-18 19:14:52,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:52,415 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-18 19:14:52,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:52,415 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-18 19:14:52,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:52,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:52,418 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:52,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:14:52,621 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:52,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:52,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-18 19:14:52,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:52,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652849983] [2019-12-18 19:14:52,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-18 19:14:52,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652849983] [2019-12-18 19:14:52,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:52,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:14:52,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240156690] [2019-12-18 19:14:52,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:14:52,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:52,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:14:52,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:14:52,643 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-18 19:14:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:53,445 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-18 19:14:53,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:14:53,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 19:14:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:53,644 INFO L225 Difference]: With dead ends: 59584 [2019-12-18 19:14:53,644 INFO L226 Difference]: Without dead ends: 59552 [2019-12-18 19:14:53,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:14:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-18 19:14:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-18 19:14:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-18 19:14:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-18 19:14:54,753 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-18 19:14:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:54,753 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-18 19:14:54,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:14:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-18 19:14:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:54,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:54,756 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:54,756 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-18 19:14:54,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:54,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655759173] [2019-12-18 19:14:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:14:54,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655759173] [2019-12-18 19:14:54,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:54,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:14:54,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983819094] [2019-12-18 19:14:54,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:54,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:54,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:54,817 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-18 19:14:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:14:56,010 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-18 19:14:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:14:56,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:14:56,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:14:57,135 INFO L225 Difference]: With dead ends: 137478 [2019-12-18 19:14:57,135 INFO L226 Difference]: Without dead ends: 137462 [2019-12-18 19:14:57,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:14:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-18 19:14:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-18 19:14:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-18 19:14:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-18 19:14:59,079 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-18 19:14:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:14:59,079 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-18 19:14:59,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:14:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-18 19:14:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:14:59,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:14:59,082 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:14:59,082 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:14:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:14:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-18 19:14:59,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:14:59,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80014686] [2019-12-18 19:14:59,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:14:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:14:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:14:59,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80014686] [2019-12-18 19:14:59,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:14:59,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:14:59,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396318260] [2019-12-18 19:14:59,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:14:59,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:14:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:14:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:14:59,130 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-18 19:15:00,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:00,665 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-18 19:15:00,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:00,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:01,074 INFO L225 Difference]: With dead ends: 136774 [2019-12-18 19:15:01,074 INFO L226 Difference]: Without dead ends: 136758 [2019-12-18 19:15:01,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:15:01,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. [2019-12-18 19:15:03,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-18 19:15:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-18 19:15:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41129 states to 41129 states and 222593 transitions. [2019-12-18 19:15:03,797 INFO L78 Accepts]: Start accepts. Automaton has 41129 states and 222593 transitions. Word has length 25 [2019-12-18 19:15:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:03,797 INFO L462 AbstractCegarLoop]: Abstraction has 41129 states and 222593 transitions. [2019-12-18 19:15:03,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 41129 states and 222593 transitions. [2019-12-18 19:15:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:03,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:03,800 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:03,800 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:15:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash -61078994, now seen corresponding path program 6 times [2019-12-18 19:15:03,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:03,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479022150] [2019-12-18 19:15:03,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:15:03,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479022150] [2019-12-18 19:15:03,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:03,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:03,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184465345] [2019-12-18 19:15:03,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:03,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:03,848 INFO L87 Difference]: Start difference. First operand 41129 states and 222593 transitions. Second operand 9 states. [2019-12-18 19:15:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:05,047 INFO L93 Difference]: Finished difference Result 134734 states and 630461 transitions. [2019-12-18 19:15:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:05,048 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:05,443 INFO L225 Difference]: With dead ends: 134734 [2019-12-18 19:15:05,444 INFO L226 Difference]: Without dead ends: 134714 [2019-12-18 19:15:05,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:15:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134714 states. [2019-12-18 19:15:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134714 to 39950. [2019-12-18 19:15:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2019-12-18 19:15:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 216201 transitions. [2019-12-18 19:15:11,082 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 216201 transitions. Word has length 25 [2019-12-18 19:15:11,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:11,083 INFO L462 AbstractCegarLoop]: Abstraction has 39950 states and 216201 transitions. [2019-12-18 19:15:11,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:11,083 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 216201 transitions. [2019-12-18 19:15:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:11,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:11,085 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:11,085 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:15:11,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:11,085 INFO L82 PathProgramCache]: Analyzing trace with hash -61103236, now seen corresponding path program 3 times [2019-12-18 19:15:11,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:11,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146258831] [2019-12-18 19:15:11,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:15:11,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146258831] [2019-12-18 19:15:11,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:11,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:11,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056868974] [2019-12-18 19:15:11,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:11,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:11,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:11,141 INFO L87 Difference]: Start difference. First operand 39950 states and 216201 transitions. Second operand 9 states. [2019-12-18 19:15:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:12,384 INFO L93 Difference]: Finished difference Result 134487 states and 629694 transitions. [2019-12-18 19:15:12,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:12,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:12,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:13,631 INFO L225 Difference]: With dead ends: 134487 [2019-12-18 19:15:13,631 INFO L226 Difference]: Without dead ends: 134471 [2019-12-18 19:15:13,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:15:13,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134471 states. [2019-12-18 19:15:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134471 to 39586. [2019-12-18 19:15:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-18 19:15:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 214214 transitions. [2019-12-18 19:15:15,420 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 214214 transitions. Word has length 25 [2019-12-18 19:15:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:15,421 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 214214 transitions. [2019-12-18 19:15:15,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 214214 transitions. [2019-12-18 19:15:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:15,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:15,423 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:15,423 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:15:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash -69926921, now seen corresponding path program 4 times [2019-12-18 19:15:15,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:15,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516144062] [2019-12-18 19:15:15,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:15,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:15,481 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:15:15,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516144062] [2019-12-18 19:15:15,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:15,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:15,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217959172] [2019-12-18 19:15:15,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:15,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:15,483 INFO L87 Difference]: Start difference. First operand 39586 states and 214214 transitions. Second operand 9 states. [2019-12-18 19:15:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:17,342 INFO L93 Difference]: Finished difference Result 134693 states and 630836 transitions. [2019-12-18 19:15:17,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:17,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:17,756 INFO L225 Difference]: With dead ends: 134693 [2019-12-18 19:15:17,756 INFO L226 Difference]: Without dead ends: 134673 [2019-12-18 19:15:17,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:15:18,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134673 states. [2019-12-18 19:15:22,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134673 to 39511. [2019-12-18 19:15:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39511 states. [2019-12-18 19:15:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39511 states to 39511 states and 213636 transitions. [2019-12-18 19:15:22,957 INFO L78 Accepts]: Start accepts. Automaton has 39511 states and 213636 transitions. Word has length 25 [2019-12-18 19:15:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:22,957 INFO L462 AbstractCegarLoop]: Abstraction has 39511 states and 213636 transitions. [2019-12-18 19:15:22,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 39511 states and 213636 transitions. [2019-12-18 19:15:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:22,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:22,959 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:22,959 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:15:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash -69941956, now seen corresponding path program 4 times [2019-12-18 19:15:22,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:22,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693489384] [2019-12-18 19:15:22,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:15:23,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693489384] [2019-12-18 19:15:23,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:23,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:23,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58882623] [2019-12-18 19:15:23,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:23,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:23,008 INFO L87 Difference]: Start difference. First operand 39511 states and 213636 transitions. Second operand 9 states. [2019-12-18 19:15:24,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:24,144 INFO L93 Difference]: Finished difference Result 133500 states and 624860 transitions. [2019-12-18 19:15:24,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:24,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:24,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:24,540 INFO L225 Difference]: With dead ends: 133500 [2019-12-18 19:15:24,540 INFO L226 Difference]: Without dead ends: 133480 [2019-12-18 19:15:24,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:15:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133480 states. [2019-12-18 19:15:27,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133480 to 39284. [2019-12-18 19:15:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39284 states. [2019-12-18 19:15:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39284 states to 39284 states and 212213 transitions. [2019-12-18 19:15:27,144 INFO L78 Accepts]: Start accepts. Automaton has 39284 states and 212213 transitions. Word has length 25 [2019-12-18 19:15:27,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:27,144 INFO L462 AbstractCegarLoop]: Abstraction has 39284 states and 212213 transitions. [2019-12-18 19:15:27,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39284 states and 212213 transitions. [2019-12-18 19:15:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:27,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:27,147 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:27,147 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:15:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1098510199, now seen corresponding path program 5 times [2019-12-18 19:15:27,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:27,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129945420] [2019-12-18 19:15:27,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:15:27,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129945420] [2019-12-18 19:15:27,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:27,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:27,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227873193] [2019-12-18 19:15:27,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:27,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:27,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:27,196 INFO L87 Difference]: Start difference. First operand 39284 states and 212213 transitions. Second operand 9 states. [2019-12-18 19:15:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:29,279 INFO L93 Difference]: Finished difference Result 134278 states and 628555 transitions. [2019-12-18 19:15:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:29,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:29,678 INFO L225 Difference]: With dead ends: 134278 [2019-12-18 19:15:29,678 INFO L226 Difference]: Without dead ends: 134262 [2019-12-18 19:15:29,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:15:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134262 states. [2019-12-18 19:15:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134262 to 38762. [2019-12-18 19:15:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38762 states. [2019-12-18 19:15:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38762 states to 38762 states and 209279 transitions. [2019-12-18 19:15:31,470 INFO L78 Accepts]: Start accepts. Automaton has 38762 states and 209279 transitions. Word has length 25 [2019-12-18 19:15:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:15:31,470 INFO L462 AbstractCegarLoop]: Abstraction has 38762 states and 209279 transitions. [2019-12-18 19:15:31,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:15:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 38762 states and 209279 transitions. [2019-12-18 19:15:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 19:15:31,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:15:31,473 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:15:31,473 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:15:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:15:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1084061564, now seen corresponding path program 5 times [2019-12-18 19:15:31,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:15:31,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666780374] [2019-12-18 19:15:31,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:15:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:15:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-18 19:15:31,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666780374] [2019-12-18 19:15:31,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:15:31,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 19:15:31,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377523319] [2019-12-18 19:15:31,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:15:31,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:15:31,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:15:31,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:15:31,558 INFO L87 Difference]: Start difference. First operand 38762 states and 209279 transitions. Second operand 9 states. [2019-12-18 19:15:32,168 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-12-18 19:15:33,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:15:33,029 INFO L93 Difference]: Finished difference Result 133154 states and 622565 transitions. [2019-12-18 19:15:33,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 19:15:33,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-18 19:15:33,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:15:33,424 INFO L225 Difference]: With dead ends: 133154 [2019-12-18 19:15:33,424 INFO L226 Difference]: Without dead ends: 133138 [2019-12-18 19:15:33,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-18 19:15:33,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133138 states. Received shutdown request... [2019-12-18 19:15:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133138 to 38386. [2019-12-18 19:15:38,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38386 states. [2019-12-18 19:15:38,337 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 19:15:38,341 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 19:15:38,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:15:38 BasicIcfg [2019-12-18 19:15:38,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:15:38,342 INFO L168 Benchmark]: Toolchain (without parser) took 225036.57 ms. Allocated memory was 146.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.5 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 19:15:38,343 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 19:15:38,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.93 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 163.4 MB in the end (delta: -62.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:38,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.42 ms. Allocated memory is still 204.5 MB. Free memory was 163.4 MB in the beginning and 161.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:38,343 INFO L168 Benchmark]: Boogie Preprocessor took 24.80 ms. Allocated memory is still 204.5 MB. Free memory was 161.5 MB in the beginning and 160.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:38,343 INFO L168 Benchmark]: RCFGBuilder took 433.73 ms. Allocated memory is still 204.5 MB. Free memory was 160.2 MB in the beginning and 141.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. [2019-12-18 19:15:38,344 INFO L168 Benchmark]: TraceAbstraction took 223737.49 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 141.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-18 19:15:38,345 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.48 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.93 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.3 MB in the beginning and 163.4 MB in the end (delta: -62.1 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.42 ms. Allocated memory is still 204.5 MB. Free memory was 163.4 MB in the beginning and 161.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.80 ms. Allocated memory is still 204.5 MB. Free memory was 161.5 MB in the beginning and 160.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 433.73 ms. Allocated memory is still 204.5 MB. Free memory was 160.2 MB in the beginning and 141.0 MB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 223737.49 ms. Allocated memory was 204.5 MB in the beginning and 3.4 GB in the end (delta: 3.1 GB). Free memory was 141.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 15 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 366 VarBasedMoverChecksPositive, 5 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 5 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 615 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 97 ProgramPointsBefore, 34 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1107 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 26 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 139 ProgramPointsBefore, 50 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.2s, 160 ProgramPointsBefore, 58 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1765 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 4276 CheckedPairsTotal, 117 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 155.4s, OverallIterations: 40, TraceHistogramMax: 5, AutomataDifference: 54.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3140 SDtfs, 9698 SDslu, 9533 SDs, 0 SdLazy, 10861 SolverSat, 772 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1150 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5303 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42643occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 91.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 2341583 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1126 ConstructedInterpolants, 0 QuantifiedInterpolants, 73644 SizeOfPredicates, 76 NumberOfNonLiveVariables, 1681 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 54 InterpolantComputations, 26 PerfectInterpolantSequences, 552/746 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown