/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-nondet/nondet-loop-bound-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:33:41,052 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:33:41,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:33:41,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:33:41,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:33:41,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:33:41,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:33:41,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:33:41,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:33:41,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:33:41,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:33:41,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:33:41,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:33:41,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:33:41,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:33:41,079 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:33:41,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:33:41,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:33:41,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:33:41,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:33:41,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:33:41,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:33:41,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:33:41,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:33:41,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:33:41,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:33:41,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:33:41,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:33:41,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:33:41,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:33:41,094 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:33:41,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:33:41,096 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:33:41,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:33:41,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:33:41,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:33:41,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:33:41,099 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:33:41,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:33:41,100 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:33:41,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:33:41,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:33:41,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:33:41,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:33:41,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:33:41,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:33:41,117 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:33:41,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:33:41,118 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:33:41,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:33:41,118 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:33:41,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:33:41,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:33:41,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:33:41,119 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:33:41,119 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:33:41,119 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:33:41,119 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:33:41,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:33:41,120 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:33:41,120 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:33:41,120 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:33:41,120 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:33:41,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:33:41,121 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:33:41,121 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:33:41,121 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:33:41,121 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:33:41,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:33:41,122 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:33:41,123 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:33:41,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:33:41,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:33:41,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:33:41,398 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:33:41,399 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:33:41,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2019-12-27 04:33:41,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adbc2f38c/6783b62f0a3543ebbbd59de701907d41/FLAG69a557ca2 [2019-12-27 04:33:41,947 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:33:41,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2019-12-27 04:33:41,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adbc2f38c/6783b62f0a3543ebbbd59de701907d41/FLAG69a557ca2 [2019-12-27 04:33:42,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adbc2f38c/6783b62f0a3543ebbbd59de701907d41 [2019-12-27 04:33:42,247 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:33:42,249 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:33:42,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:33:42,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:33:42,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:33:42,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:42,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721a3d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42, skipping insertion in model container [2019-12-27 04:33:42,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:42,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:33:42,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:33:42,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:33:42,801 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:33:42,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:33:42,951 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:33:42,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42 WrapperNode [2019-12-27 04:33:42,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:33:42,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:33:42,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:33:42,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:33:42,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:42,981 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,004 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:33:43,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:33:43,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:33:43,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:33:43,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... [2019-12-27 04:33:43,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:33:43,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:33:43,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:33:43,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:33:43,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:33:43,096 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 04:33:43,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 04:33:43,097 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 04:33:43,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 04:33:43,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:33:43,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:33:43,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:33:43,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:33:43,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:33:43,099 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:33:43,452 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:33:43,453 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 04:33:43,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:33:43 BoogieIcfgContainer [2019-12-27 04:33:43,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:33:43,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:33:43,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:33:43,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:33:43,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:33:42" (1/3) ... [2019-12-27 04:33:43,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4706de7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:33:43, skipping insertion in model container [2019-12-27 04:33:43,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:33:42" (2/3) ... [2019-12-27 04:33:43,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4706de7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:33:43, skipping insertion in model container [2019-12-27 04:33:43,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:33:43" (3/3) ... [2019-12-27 04:33:43,465 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-12-27 04:33:43,476 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:33:43,476 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:33:43,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 04:33:43,488 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:33:43,514 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,515 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,515 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,516 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,516 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,516 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,516 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,517 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,517 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,518 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,518 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,519 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,519 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,519 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,523 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,523 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,524 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,524 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,524 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,529 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,529 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,530 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,530 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,530 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,530 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:43,543 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 04:33:43,568 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:33:43,568 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:33:43,568 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:33:43,569 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:33:43,569 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:33:43,569 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:33:43,569 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:33:43,569 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:33:43,584 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions [2019-12-27 04:33:43,586 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 04:33:43,634 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 04:33:43,634 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:33:43,641 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 04:33:43,645 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 04:33:43,668 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 04:33:43,668 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:33:43,670 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 04:33:43,672 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2019-12-27 04:33:43,673 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:33:45,133 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 04:33:45,244 INFO L206 etLargeBlockEncoding]: Checked pairs total: 489 [2019-12-27 04:33:45,244 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-27 04:33:45,248 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 04:33:45,257 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 04:33:45,259 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 04:33:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:33:45,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:45,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:33:45,265 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:45,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:45,270 INFO L82 PathProgramCache]: Analyzing trace with hash 210014, now seen corresponding path program 1 times [2019-12-27 04:33:45,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:45,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469128962] [2019-12-27 04:33:45,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:45,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469128962] [2019-12-27 04:33:45,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:45,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:33:45,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097115115] [2019-12-27 04:33:45,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:33:45,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:45,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:33:45,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:45,495 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 04:33:45,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:45,533 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 04:33:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:33:45,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:33:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:45,546 INFO L225 Difference]: With dead ends: 35 [2019-12-27 04:33:45,546 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 04:33:45,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 04:33:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 04:33:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 04:33:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 04:33:45,586 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 04:33:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:45,587 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 04:33:45,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:33:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 04:33:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:33:45,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:45,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:45,588 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash 647068079, now seen corresponding path program 1 times [2019-12-27 04:33:45,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:45,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537649495] [2019-12-27 04:33:45,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:45,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537649495] [2019-12-27 04:33:45,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:45,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:33:45,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404097773] [2019-12-27 04:33:45,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:33:45,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:45,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:33:45,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:33:45,696 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 04:33:45,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:45,722 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 04:33:45,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:33:45,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 04:33:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:45,725 INFO L225 Difference]: With dead ends: 26 [2019-12-27 04:33:45,726 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 04:33:45,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:33:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 04:33:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 04:33:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 04:33:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 04:33:45,732 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 04:33:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:45,732 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 04:33:45,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:33:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 04:33:45,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:33:45,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:45,733 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:45,733 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:45,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:45,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1415732781, now seen corresponding path program 1 times [2019-12-27 04:33:45,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:45,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902877791] [2019-12-27 04:33:45,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:33:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:33:45,823 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:33:45,823 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:33:45,824 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:33:45,824 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 04:33:45,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,839 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,839 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,840 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,843 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,844 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,844 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,844 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,844 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,844 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,845 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,845 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,846 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,846 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,847 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,847 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,848 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,848 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,849 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,849 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,851 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,851 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,856 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,856 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,857 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,858 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,859 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,859 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,859 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,864 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,864 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,864 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,865 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,865 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,867 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,867 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,868 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,868 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:45,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 04:33:45,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:33:45,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:33:45,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:33:45,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:33:45,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:33:45,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:33:45,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:33:45,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:33:45,874 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 04:33:45,874 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 04:33:45,901 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 04:33:45,901 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 04:33:45,903 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 04:33:45,907 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 04:33:45,924 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 04:33:45,925 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 04:33:45,927 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 04:33:45,930 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2019-12-27 04:33:45,931 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:33:47,378 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 04:33:47,488 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-27 04:33:47,504 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1034 [2019-12-27 04:33:47,505 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 04:33:47,505 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 04:33:47,516 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 04:33:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 04:33:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:33:47,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:47,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:33:47,518 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 353600, now seen corresponding path program 1 times [2019-12-27 04:33:47,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:47,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537249423] [2019-12-27 04:33:47,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:47,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537249423] [2019-12-27 04:33:47,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:47,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:33:47,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126464106] [2019-12-27 04:33:47,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:33:47,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:33:47,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:47,555 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 04:33:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:47,586 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 04:33:47,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:33:47,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:33:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:47,591 INFO L225 Difference]: With dead ends: 185 [2019-12-27 04:33:47,591 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 04:33:47,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 04:33:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 04:33:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 04:33:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 04:33:47,616 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 04:33:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:47,616 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 04:33:47,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:33:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 04:33:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:33:47,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:47,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:47,617 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash -677960350, now seen corresponding path program 1 times [2019-12-27 04:33:47,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:47,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715672865] [2019-12-27 04:33:47,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:47,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715672865] [2019-12-27 04:33:47,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:47,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:47,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354851356] [2019-12-27 04:33:47,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:47,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:47,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:47,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:47,680 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 04:33:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:47,776 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 04:33:47,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:47,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:33:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:47,779 INFO L225 Difference]: With dead ends: 204 [2019-12-27 04:33:47,779 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 04:33:47,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 04:33:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 04:33:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 04:33:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 04:33:47,796 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 04:33:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:47,797 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 04:33:47,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 04:33:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:33:47,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:47,798 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:47,799 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:47,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:47,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1901960811, now seen corresponding path program 1 times [2019-12-27 04:33:47,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:47,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064846537] [2019-12-27 04:33:47,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:33:47,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064846537] [2019-12-27 04:33:47,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:47,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:47,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726386254] [2019-12-27 04:33:47,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:47,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:47,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:47,880 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 04:33:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:47,975 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 04:33:47,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:47,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:33:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:47,978 INFO L225 Difference]: With dead ends: 189 [2019-12-27 04:33:47,978 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 04:33:47,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 04:33:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 04:33:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 04:33:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 04:33:48,003 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 04:33:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:48,005 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 04:33:48,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 04:33:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:33:48,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:48,007 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:48,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:48,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1166778350, now seen corresponding path program 1 times [2019-12-27 04:33:48,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:48,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614945346] [2019-12-27 04:33:48,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:33:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:33:48,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:33:48,068 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:33:48,069 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:33:48,069 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 04:33:48,078 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,078 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,078 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,079 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,079 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,079 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,080 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,081 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,081 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,081 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,082 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,082 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,083 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,083 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,084 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,084 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,085 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,085 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,086 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,086 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,086 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,087 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,087 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,088 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,088 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,088 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,088 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,089 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,089 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,089 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,090 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,091 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,091 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,091 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,091 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,095 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,096 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,096 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,099 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,100 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,100 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,100 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,100 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,100 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,101 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,101 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,102 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,102 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,102 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,103 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,104 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,104 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,104 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,104 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:48,106 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:33:48,106 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:33:48,106 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:33:48,106 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:33:48,106 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:33:48,106 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:33:48,106 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:33:48,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:33:48,106 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:33:48,111 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 85 transitions [2019-12-27 04:33:48,111 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 04:33:48,130 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 04:33:48,130 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 04:33:48,132 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 04:33:48,136 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 04:33:48,160 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 04:33:48,160 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 04:33:48,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 04:33:48,169 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2019-12-27 04:33:48,169 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:33:49,689 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 04:33:49,794 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1615 [2019-12-27 04:33:49,794 INFO L214 etLargeBlockEncoding]: Total number of compositions: 69 [2019-12-27 04:33:49,794 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 04:33:49,836 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 04:33:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 04:33:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:33:49,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:49,837 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:33:49,837 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash 525945, now seen corresponding path program 1 times [2019-12-27 04:33:49,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:49,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840142308] [2019-12-27 04:33:49,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:49,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840142308] [2019-12-27 04:33:49,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:49,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:33:49,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873684548] [2019-12-27 04:33:49,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:33:49,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:49,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:33:49,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:49,870 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 04:33:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:49,915 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 04:33:49,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:33:49,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:33:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:49,921 INFO L225 Difference]: With dead ends: 600 [2019-12-27 04:33:49,922 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 04:33:49,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 04:33:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 04:33:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 04:33:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 04:33:49,960 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 04:33:49,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:49,960 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 04:33:49,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:33:49,961 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 04:33:49,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:33:49,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:49,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:49,962 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2106616436, now seen corresponding path program 1 times [2019-12-27 04:33:49,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:49,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333986009] [2019-12-27 04:33:49,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:50,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333986009] [2019-12-27 04:33:50,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:50,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:50,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126803959] [2019-12-27 04:33:50,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:50,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:50,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:50,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:50,033 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 04:33:50,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:50,132 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 04:33:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:50,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:33:50,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:50,140 INFO L225 Difference]: With dead ends: 802 [2019-12-27 04:33:50,140 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 04:33:50,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 04:33:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 04:33:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 04:33:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 04:33:50,166 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 04:33:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:50,166 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 04:33:50,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 04:33:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:33:50,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:50,167 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:50,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:50,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1813947824, now seen corresponding path program 1 times [2019-12-27 04:33:50,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:50,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410371928] [2019-12-27 04:33:50,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:33:50,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410371928] [2019-12-27 04:33:50,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:50,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:50,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281648065] [2019-12-27 04:33:50,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:50,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:50,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:50,220 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 04:33:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:50,326 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 04:33:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:50,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:33:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:50,332 INFO L225 Difference]: With dead ends: 832 [2019-12-27 04:33:50,333 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 04:33:50,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 04:33:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 04:33:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 04:33:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 04:33:50,357 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 04:33:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:50,357 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 04:33:50,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 04:33:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:33:50,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:50,359 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:50,359 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -693557262, now seen corresponding path program 1 times [2019-12-27 04:33:50,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:50,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546148809] [2019-12-27 04:33:50,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:50,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546148809] [2019-12-27 04:33:50,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940600677] [2019-12-27 04:33:50,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:33:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:50,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:33:50,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:33:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:50,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:33:50,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:33:50,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340980690] [2019-12-27 04:33:50,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:33:50,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:50,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:33:50,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:33:50,621 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 12 states. [2019-12-27 04:33:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:50,946 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 04:33:50,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:50,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:33:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:50,954 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 04:33:50,954 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 04:33:50,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:33:50,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 04:33:50,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 04:33:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 04:33:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 04:33:50,982 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 04:33:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:50,983 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 04:33:50,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:33:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 04:33:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:33:50,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:50,984 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:51,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:33:51,197 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:51,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:51,197 INFO L82 PathProgramCache]: Analyzing trace with hash -552862538, now seen corresponding path program 2 times [2019-12-27 04:33:51,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:51,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761606619] [2019-12-27 04:33:51,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:33:51,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761606619] [2019-12-27 04:33:51,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:51,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:33:51,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072060479] [2019-12-27 04:33:51,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:33:51,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:33:51,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:51,288 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 04:33:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:51,621 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 04:33:51,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:51,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 04:33:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:51,631 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 04:33:51,631 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 04:33:51,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:33:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 04:33:51,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 04:33:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 04:33:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 04:33:51,662 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 04:33:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:51,662 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 04:33:51,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:33:51,663 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 04:33:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:33:51,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:51,664 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:51,665 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:51,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:51,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1197543999, now seen corresponding path program 1 times [2019-12-27 04:33:51,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:51,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608659406] [2019-12-27 04:33:51,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:33:51,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608659406] [2019-12-27 04:33:51,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:51,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:51,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736381575] [2019-12-27 04:33:51,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:51,726 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 04:33:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:51,845 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 04:33:51,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:51,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 04:33:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:51,851 INFO L225 Difference]: With dead ends: 736 [2019-12-27 04:33:51,851 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 04:33:51,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 04:33:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 04:33:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 04:33:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 04:33:51,872 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 04:33:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:51,872 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 04:33:51,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 04:33:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:33:51,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:51,874 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:51,874 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:33:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1527881090, now seen corresponding path program 1 times [2019-12-27 04:33:51,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:51,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469176578] [2019-12-27 04:33:51,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:33:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:33:51,917 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:33:51,918 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:33:51,918 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:33:51,918 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 04:33:51,934 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,934 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,934 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,934 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,935 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,936 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,936 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,937 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,937 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,937 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,938 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,938 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,938 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,939 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,940 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,940 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,941 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,941 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,942 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,942 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,943 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,943 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,944 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,944 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,945 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,945 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,946 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,946 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,946 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,947 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,947 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,947 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,949 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,949 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,949 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,949 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,949 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,951 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,951 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,951 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,951 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,951 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,953 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,953 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,953 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,954 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,954 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,955 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,955 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,956 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,956 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,957 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,957 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,958 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,958 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,958 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,958 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,960 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,960 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,960 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,960 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,960 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,961 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,963 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,963 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,964 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,964 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:33:51,965 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 04:33:51,966 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:33:51,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:33:51,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:33:51,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:33:51,966 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:33:51,966 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:33:51,966 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:33:51,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:33:51,968 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 101 transitions [2019-12-27 04:33:51,968 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 04:33:52,010 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 04:33:52,010 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 04:33:52,013 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 04:33:52,018 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 04:33:52,048 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 04:33:52,049 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 04:33:52,051 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 04:33:52,055 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2019-12-27 04:33:52,055 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:33:53,745 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-12-27 04:33:53,986 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2111 [2019-12-27 04:33:53,986 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 04:33:53,987 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 04:33:54,097 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 04:33:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 04:33:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:33:54,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:54,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:33:54,098 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:54,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:54,098 INFO L82 PathProgramCache]: Analyzing trace with hash 729974, now seen corresponding path program 1 times [2019-12-27 04:33:54,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:54,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836342748] [2019-12-27 04:33:54,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:54,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836342748] [2019-12-27 04:33:54,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:54,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:33:54,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190489197] [2019-12-27 04:33:54,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:33:54,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:54,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:33:54,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:54,120 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 04:33:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:54,176 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 04:33:54,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:33:54,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:33:54,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:54,192 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 04:33:54,193 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 04:33:54,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:33:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 04:33:54,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 04:33:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 04:33:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 04:33:54,261 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 04:33:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:54,262 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 04:33:54,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:33:54,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 04:33:54,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:33:54,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:54,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:54,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:54,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:54,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1449000874, now seen corresponding path program 1 times [2019-12-27 04:33:54,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:54,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848896153] [2019-12-27 04:33:54,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:54,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848896153] [2019-12-27 04:33:54,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:54,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:54,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970419858] [2019-12-27 04:33:54,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:54,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:54,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:54,306 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 04:33:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:54,423 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 04:33:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:54,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:33:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:54,451 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 04:33:54,451 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 04:33:54,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:54,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 04:33:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 04:33:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 04:33:54,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 04:33:54,558 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 04:33:54,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:54,558 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 04:33:54,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:54,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 04:33:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:33:54,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:54,559 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:54,559 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:54,559 INFO L82 PathProgramCache]: Analyzing trace with hash 302089454, now seen corresponding path program 1 times [2019-12-27 04:33:54,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:54,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827776439] [2019-12-27 04:33:54,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:33:54,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827776439] [2019-12-27 04:33:54,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:54,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:54,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106698455] [2019-12-27 04:33:54,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:54,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:54,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:54,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:54,602 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 04:33:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:54,724 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 04:33:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:54,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:33:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:54,751 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 04:33:54,751 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 04:33:54,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 04:33:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 04:33:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 04:33:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 04:33:54,905 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 04:33:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 04:33:54,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 04:33:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:33:54,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:54,907 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:54,907 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005855, now seen corresponding path program 1 times [2019-12-27 04:33:54,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:54,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872664546] [2019-12-27 04:33:54,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:54,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872664546] [2019-12-27 04:33:54,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765458209] [2019-12-27 04:33:54,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:33:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:55,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:33:55,053 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:33:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:33:55,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:33:55,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:33:55,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100010870] [2019-12-27 04:33:55,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:33:55,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:55,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:33:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:33:55,119 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 12 states. [2019-12-27 04:33:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:55,533 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-27 04:33:55,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:55,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:33:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:55,577 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 04:33:55,578 INFO L226 Difference]: Without dead ends: 4456 [2019-12-27 04:33:55,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:33:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-27 04:33:55,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-27 04:33:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 04:33:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 04:33:55,685 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 04:33:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:55,685 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 04:33:55,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:33:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 04:33:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:33:55,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:55,686 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:55,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:33:55,889 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:55,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:55,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825449, now seen corresponding path program 2 times [2019-12-27 04:33:55,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:55,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417023265] [2019-12-27 04:33:55,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:33:55,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417023265] [2019-12-27 04:33:55,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:55,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:33:55,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923629361] [2019-12-27 04:33:55,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:33:55,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:33:55,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:55,947 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 04:33:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:56,209 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 04:33:56,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:56,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 04:33:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:56,227 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 04:33:56,227 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 04:33:56,229 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-27 04:33:56,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 04:33:56,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 04:33:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 04:33:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 04:33:56,370 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 04:33:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:56,373 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 04:33:56,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:33:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 04:33:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:33:56,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:56,374 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:56,374 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:56,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1726909890, now seen corresponding path program 1 times [2019-12-27 04:33:56,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:56,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603203158] [2019-12-27 04:33:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:33:56,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603203158] [2019-12-27 04:33:56,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:56,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:33:56,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467296953] [2019-12-27 04:33:56,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:33:56,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:56,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:33:56,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:33:56,420 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 04:33:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:56,521 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 04:33:56,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:33:56,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 04:33:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:56,533 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 04:33:56,533 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 04:33:56,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 04:33:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 04:33:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 04:33:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 04:33:56,610 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 04:33:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:56,610 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 04:33:56,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:33:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 04:33:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:33:56,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:56,612 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:56,612 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2140493091, now seen corresponding path program 1 times [2019-12-27 04:33:56,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:56,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946303510] [2019-12-27 04:33:56,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:33:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946303510] [2019-12-27 04:33:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403380382] [2019-12-27 04:33:56,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:33:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:56,744 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:33:56,745 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:33:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:33:56,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:33:56,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:33:56,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154577266] [2019-12-27 04:33:56,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:33:56,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:56,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:33:56,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:33:56,812 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 12 states. [2019-12-27 04:33:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:57,199 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-27 04:33:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:57,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 04:33:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:57,217 INFO L225 Difference]: With dead ends: 4759 [2019-12-27 04:33:57,217 INFO L226 Difference]: Without dead ends: 4753 [2019-12-27 04:33:57,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:33:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-27 04:33:57,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-27 04:33:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 04:33:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 04:33:57,368 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 04:33:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:57,368 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 04:33:57,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:33:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 04:33:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:33:57,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:57,372 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:57,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:33:57,576 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:57,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1012596352, now seen corresponding path program 1 times [2019-12-27 04:33:57,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:57,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848397559] [2019-12-27 04:33:57,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:57,622 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-27 04:33:57,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848397559] [2019-12-27 04:33:57,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110782544] [2019-12-27 04:33:57,622 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-27 04:33:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:57,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:33:57,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:33:57,750 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-27 04:33:57,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:33:57,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:33:57,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633019611] [2019-12-27 04:33:57,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:33:57,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:57,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:33:57,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:33:57,752 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 12 states. [2019-12-27 04:33:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:58,024 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-27 04:33:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:58,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 04:33:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:58,042 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 04:33:58,042 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 04:33:58,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:33:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 04:33:58,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-27 04:33:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 04:33:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 04:33:58,145 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 04:33:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:58,146 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 04:33:58,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:33:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 04:33:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:33:58,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:58,147 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:58,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:33:58,352 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:58,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1703029164, now seen corresponding path program 2 times [2019-12-27 04:33:58,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:58,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827533444] [2019-12-27 04:33:58,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:33:58,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827533444] [2019-12-27 04:33:58,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:58,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:33:58,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224745831] [2019-12-27 04:33:58,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:33:58,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:33:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:58,416 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 04:33:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:58,725 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 04:33:58,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:58,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:33:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:58,750 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 04:33:58,751 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 04:33:58,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:33:58,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 04:33:58,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 04:33:58,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 04:33:58,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 04:33:58,861 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 04:33:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:58,862 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 04:33:58,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:33:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 04:33:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:33:58,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:58,865 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:58,865 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1703042649, now seen corresponding path program 2 times [2019-12-27 04:33:58,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:58,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401711657] [2019-12-27 04:33:58,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:33:58,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401711657] [2019-12-27 04:33:58,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:33:58,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:33:59,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745104951] [2019-12-27 04:33:59,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:33:59,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:59,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:33:59,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:33:59,043 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 04:33:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:33:59,323 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 04:33:59,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:33:59,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:33:59,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:33:59,339 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 04:33:59,340 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 04:33:59,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:33:59,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 04:33:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 04:33:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 04:33:59,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 04:33:59,433 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 04:33:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:33:59,433 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 04:33:59,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:33:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 04:33:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:33:59,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:33:59,436 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:33:59,436 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:33:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:33:59,437 INFO L82 PathProgramCache]: Analyzing trace with hash 269937843, now seen corresponding path program 1 times [2019-12-27 04:33:59,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:33:59,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017550351] [2019-12-27 04:33:59,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:33:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:33:59,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017550351] [2019-12-27 04:33:59,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455592774] [2019-12-27 04:33:59,523 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-27 04:33:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:33:59,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:33:59,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:33:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:33:59,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:33:59,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:33:59,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428768554] [2019-12-27 04:33:59,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:33:59,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:33:59,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:33:59,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:33:59,695 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 04:34:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:00,769 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-27 04:34:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:00,770 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:34:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:00,791 INFO L225 Difference]: With dead ends: 5995 [2019-12-27 04:34:00,792 INFO L226 Difference]: Without dead ends: 5991 [2019-12-27 04:34:00,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-27 04:34:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-27 04:34:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 04:34:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 04:34:00,882 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 04:34:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:00,883 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 04:34:00,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:00,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 04:34:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:00,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:00,885 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:01,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:01,097 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:34:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:01,098 INFO L82 PathProgramCache]: Analyzing trace with hash 275473203, now seen corresponding path program 2 times [2019-12-27 04:34:01,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:01,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917565175] [2019-12-27 04:34:01,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:01,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:01,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917565175] [2019-12-27 04:34:01,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882534411] [2019-12-27 04:34:01,170 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-27 04:34:01,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:34:01,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:01,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:01,255 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:01,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:01,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:01,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020883145] [2019-12-27 04:34:01,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:01,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:01,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:01,357 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 16 states. [2019-12-27 04:34:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:02,179 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-27 04:34:02,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:02,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:34:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:02,194 INFO L225 Difference]: With dead ends: 5889 [2019-12-27 04:34:02,194 INFO L226 Difference]: Without dead ends: 5883 [2019-12-27 04:34:02,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-27 04:34:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-27 04:34:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 04:34:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 04:34:02,283 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 04:34:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:02,283 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 04:34:02,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 04:34:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:02,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:02,286 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:02,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:02,490 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:34:02,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:02,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1870977495, now seen corresponding path program 3 times [2019-12-27 04:34:02,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:02,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298173258] [2019-12-27 04:34:02,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:02,562 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-27 04:34:02,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298173258] [2019-12-27 04:34:02,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53384637] [2019-12-27 04:34:02,563 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-27 04:34:02,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:34:02,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:02,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:02,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:02,826 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-27 04:34:02,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:02,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:02,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964575649] [2019-12-27 04:34:02,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:02,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:02,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:02,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:02,827 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 16 states. [2019-12-27 04:34:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:03,635 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-27 04:34:03,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:03,635 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:34:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:03,645 INFO L225 Difference]: With dead ends: 5888 [2019-12-27 04:34:03,645 INFO L226 Difference]: Without dead ends: 5884 [2019-12-27 04:34:03,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-27 04:34:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-27 04:34:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 04:34:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 04:34:03,734 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 04:34:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:03,734 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 04:34:03,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 04:34:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:03,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:03,739 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:03,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:03,944 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:34:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1852496535, now seen corresponding path program 4 times [2019-12-27 04:34:03,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:03,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937039968] [2019-12-27 04:34:03,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:04,045 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-27 04:34:04,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937039968] [2019-12-27 04:34:04,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515095961] [2019-12-27 04:34:04,046 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-27 04:34:04,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:34:04,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:04,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:04,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:04,256 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-27 04:34:04,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:04,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:04,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943454823] [2019-12-27 04:34:04,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:04,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:04,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:04,258 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 16 states. [2019-12-27 04:34:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:05,149 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-27 04:34:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:05,150 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:34:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:05,158 INFO L225 Difference]: With dead ends: 5819 [2019-12-27 04:34:05,158 INFO L226 Difference]: Without dead ends: 5813 [2019-12-27 04:34:05,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=394, Invalid=1088, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-27 04:34:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-27 04:34:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 04:34:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 04:34:05,234 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 04:34:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:05,234 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 04:34:05,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 04:34:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:05,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:05,236 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:05,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:05,440 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:34:05,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:05,440 INFO L82 PathProgramCache]: Analyzing trace with hash -748339188, now seen corresponding path program 1 times [2019-12-27 04:34:05,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:05,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77282765] [2019-12-27 04:34:05,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:05,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77282765] [2019-12-27 04:34:05,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:05,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:34:05,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22470995] [2019-12-27 04:34:05,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:34:05,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:05,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:34:05,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:34:05,484 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 04:34:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:05,580 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 04:34:05,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:34:05,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 04:34:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:05,585 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 04:34:05,585 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 04:34:05,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 04:34:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 04:34:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 04:34:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 04:34:05,627 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 04:34:05,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:05,627 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 04:34:05,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:34:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 04:34:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:05,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:05,629 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:05,630 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:34:05,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash -228501443, now seen corresponding path program 5 times [2019-12-27 04:34:05,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:05,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124996398] [2019-12-27 04:34:05,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:05,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124996398] [2019-12-27 04:34:05,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:05,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:05,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324939264] [2019-12-27 04:34:05,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:05,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:05,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:05,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:05,726 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 04:34:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:06,412 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 04:34:06,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:06,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:34:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:06,421 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 04:34:06,421 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 04:34:06,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 04:34:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 04:34:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 04:34:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 04:34:06,485 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 04:34:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:06,486 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 04:34:06,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 04:34:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:06,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:06,488 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:06,488 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:34:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash -241447043, now seen corresponding path program 6 times [2019-12-27 04:34:06,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:06,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622041341] [2019-12-27 04:34:06,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:06,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622041341] [2019-12-27 04:34:06,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:06,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:06,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430444028] [2019-12-27 04:34:06,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:06,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:06,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:06,546 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 04:34:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:07,295 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 04:34:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:07,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:34:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:07,307 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 04:34:07,308 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 04:34:07,308 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-27 04:34:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 04:34:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 04:34:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 04:34:07,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 04:34:07,381 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 04:34:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:07,381 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 04:34:07,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 04:34:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 04:34:07,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:07,383 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:07,384 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 04:34:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1727522141, now seen corresponding path program 1 times [2019-12-27 04:34:07,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:07,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161737690] [2019-12-27 04:34:07,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:34:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:34:07,407 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:34:07,407 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:34:07,407 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:34:07,407 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 04:34:07,419 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,420 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,420 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,420 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,420 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,420 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,420 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,421 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,421 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,421 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,421 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,421 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,421 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,422 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,422 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,422 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,423 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,423 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,423 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,423 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,423 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,423 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,424 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,424 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,424 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,425 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,425 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,425 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,425 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,425 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,425 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,426 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,426 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,426 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,427 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,428 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,428 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,429 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,429 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,430 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,431 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,432 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,432 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,432 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,433 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,433 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,433 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,435 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,435 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,435 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,435 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,436 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,437 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,437 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,437 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,437 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,438 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,439 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,439 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,439 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,439 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,440 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,441 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,441 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,441 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,441 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,441 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,443 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,443 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,444 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,445 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,445 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,445 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,445 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,445 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,446 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,447 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,447 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,447 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,447 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,447 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,448 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,449 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,449 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,449 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,449 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,450 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,450 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,451 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,451 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,451 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,451 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,452 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:34:07,453 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 04:34:07,453 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:34:07,453 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:34:07,453 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:34:07,454 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:34:07,454 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:34:07,454 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:34:07,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:34:07,454 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:34:07,455 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 117 transitions [2019-12-27 04:34:07,456 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 04:34:07,474 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 04:34:07,475 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 04:34:07,477 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 04:34:07,483 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 04:34:07,502 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 04:34:07,502 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 04:34:07,504 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 04:34:07,510 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2019-12-27 04:34:07,510 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:34:09,087 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 04:34:09,329 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2604 [2019-12-27 04:34:09,329 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 04:34:09,329 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 04:34:09,624 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 04:34:09,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 04:34:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:34:09,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:09,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:34:09,625 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:09,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash 963853, now seen corresponding path program 1 times [2019-12-27 04:34:09,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:09,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848813228] [2019-12-27 04:34:09,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:09,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848813228] [2019-12-27 04:34:09,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:09,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:34:09,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235063527] [2019-12-27 04:34:09,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:34:09,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:09,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:34:09,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:34:09,652 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 04:34:09,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:09,734 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 04:34:09,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:34:09,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:34:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:09,752 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 04:34:09,752 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 04:34:09,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:34:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 04:34:09,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 04:34:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 04:34:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 04:34:09,887 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 04:34:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:09,888 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 04:34:09,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:34:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 04:34:09,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:34:09,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:09,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:09,888 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:09,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:09,889 INFO L82 PathProgramCache]: Analyzing trace with hash 91439009, now seen corresponding path program 1 times [2019-12-27 04:34:09,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:09,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082554689] [2019-12-27 04:34:09,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:09,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082554689] [2019-12-27 04:34:09,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:09,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:34:09,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805062236] [2019-12-27 04:34:09,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:34:09,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:09,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:34:09,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:34:09,928 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 04:34:10,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:10,071 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 04:34:10,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:34:10,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:34:10,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:10,095 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 04:34:10,095 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 04:34:10,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 04:34:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 04:34:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 04:34:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 04:34:10,869 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 04:34:10,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:10,869 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 04:34:10,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:34:10,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 04:34:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:34:10,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:10,869 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:10,870 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:10,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:10,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1001063187, now seen corresponding path program 1 times [2019-12-27 04:34:10,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:10,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804591978] [2019-12-27 04:34:10,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:34:10,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804591978] [2019-12-27 04:34:10,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:10,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:34:10,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709007635] [2019-12-27 04:34:10,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:34:10,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:10,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:34:10,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:34:10,917 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 04:34:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:11,084 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 04:34:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:34:11,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:34:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:11,120 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 04:34:11,120 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 04:34:11,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 04:34:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 04:34:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 04:34:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 04:34:11,301 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 04:34:11,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:11,302 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 04:34:11,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:34:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 04:34:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:34:11,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:11,303 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:11,303 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1798371701, now seen corresponding path program 1 times [2019-12-27 04:34:11,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:11,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457165151] [2019-12-27 04:34:11,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:11,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457165151] [2019-12-27 04:34:11,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403470511] [2019-12-27 04:34:11,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:11,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:34:11,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:34:11,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:11,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:34:11,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587302090] [2019-12-27 04:34:11,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:34:11,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:34:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:34:11,495 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 12 states. [2019-12-27 04:34:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:11,907 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-27 04:34:11,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:11,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:34:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:11,950 INFO L225 Difference]: With dead ends: 16250 [2019-12-27 04:34:11,950 INFO L226 Difference]: Without dead ends: 16246 [2019-12-27 04:34:11,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:34:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-27 04:34:12,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-27 04:34:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 04:34:12,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 04:34:12,325 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 04:34:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:12,326 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 04:34:12,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:34:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 04:34:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:34:12,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:12,327 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:12,528 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:12,529 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:12,530 INFO L82 PathProgramCache]: Analyzing trace with hash -50954293, now seen corresponding path program 2 times [2019-12-27 04:34:12,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:12,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457863898] [2019-12-27 04:34:12,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:34:12,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457863898] [2019-12-27 04:34:12,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:12,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:12,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753527457] [2019-12-27 04:34:12,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:12,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:12,584 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 04:34:12,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:12,933 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 04:34:12,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:12,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 04:34:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:12,973 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 04:34:12,973 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 04:34:12,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 04:34:13,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 04:34:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 04:34:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 04:34:13,162 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 04:34:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:13,162 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 04:34:13,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 04:34:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:34:13,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:13,164 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:13,164 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2086390321, now seen corresponding path program 1 times [2019-12-27 04:34:13,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:13,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122541063] [2019-12-27 04:34:13,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:13,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122541063] [2019-12-27 04:34:13,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:13,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:34:13,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724723265] [2019-12-27 04:34:13,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:34:13,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:13,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:34:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:34:13,208 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 04:34:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:13,336 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 04:34:13,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:34:13,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 04:34:13,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:13,362 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 04:34:13,363 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 04:34:13,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 04:34:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 04:34:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 04:34:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 04:34:13,664 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 04:34:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:13,664 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 04:34:13,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:34:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 04:34:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:34:13,665 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:13,665 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:13,665 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:13,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:13,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2036081631, now seen corresponding path program 1 times [2019-12-27 04:34:13,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:13,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115671964] [2019-12-27 04:34:13,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:13,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115671964] [2019-12-27 04:34:13,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455477657] [2019-12-27 04:34:13,708 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-27 04:34:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:13,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:34:13,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:13,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:13,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:34:13,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026174685] [2019-12-27 04:34:13,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:34:13,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:13,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:34:13,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:34:13,850 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 12 states. [2019-12-27 04:34:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:14,186 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-27 04:34:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:14,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 04:34:14,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:14,225 INFO L225 Difference]: With dead ends: 18509 [2019-12-27 04:34:14,225 INFO L226 Difference]: Without dead ends: 18503 [2019-12-27 04:34:14,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:34:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-27 04:34:14,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-27 04:34:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 04:34:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 04:34:14,439 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 04:34:14,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:14,439 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 04:34:14,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:34:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 04:34:14,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:34:14,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:14,440 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:14,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:14,641 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:14,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:14,642 INFO L82 PathProgramCache]: Analyzing trace with hash -728631447, now seen corresponding path program 2 times [2019-12-27 04:34:14,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:14,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517421730] [2019-12-27 04:34:14,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:14,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517421730] [2019-12-27 04:34:14,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:14,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:14,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110578743] [2019-12-27 04:34:14,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:14,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:14,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:14,698 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 04:34:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:15,117 INFO L93 Difference]: Finished difference Result 18912 states and 76848 transitions. [2019-12-27 04:34:15,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:15,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:34:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:15,192 INFO L225 Difference]: With dead ends: 18912 [2019-12-27 04:34:15,193 INFO L226 Difference]: Without dead ends: 18903 [2019-12-27 04:34:15,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-12-27 04:34:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 7911. [2019-12-27 04:34:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7911 states. [2019-12-27 04:34:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 36783 transitions. [2019-12-27 04:34:15,769 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 36783 transitions. Word has length 19 [2019-12-27 04:34:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:15,769 INFO L462 AbstractCegarLoop]: Abstraction has 7911 states and 36783 transitions. [2019-12-27 04:34:15,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 36783 transitions. [2019-12-27 04:34:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:34:15,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:15,771 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:15,771 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash -728623232, now seen corresponding path program 1 times [2019-12-27 04:34:15,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:15,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558126107] [2019-12-27 04:34:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:15,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:15,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558126107] [2019-12-27 04:34:15,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:15,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:15,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327411741] [2019-12-27 04:34:15,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:15,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:15,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:15,844 INFO L87 Difference]: Start difference. First operand 7911 states and 36783 transitions. Second operand 7 states. [2019-12-27 04:34:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:16,208 INFO L93 Difference]: Finished difference Result 18895 states and 76839 transitions. [2019-12-27 04:34:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:16,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:34:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:16,257 INFO L225 Difference]: With dead ends: 18895 [2019-12-27 04:34:16,257 INFO L226 Difference]: Without dead ends: 18886 [2019-12-27 04:34:16,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18886 states. [2019-12-27 04:34:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18886 to 8150. [2019-12-27 04:34:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8150 states. [2019-12-27 04:34:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 37871 transitions. [2019-12-27 04:34:16,501 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 37871 transitions. Word has length 19 [2019-12-27 04:34:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:16,502 INFO L462 AbstractCegarLoop]: Abstraction has 8150 states and 37871 transitions. [2019-12-27 04:34:16,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 37871 transitions. [2019-12-27 04:34:16,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:34:16,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:16,503 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:16,503 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash -718028672, now seen corresponding path program 2 times [2019-12-27 04:34:16,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:16,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810861411] [2019-12-27 04:34:16,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:16,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:16,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810861411] [2019-12-27 04:34:16,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:16,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:16,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618776405] [2019-12-27 04:34:16,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:16,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:16,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:16,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:16,567 INFO L87 Difference]: Start difference. First operand 8150 states and 37871 transitions. Second operand 7 states. [2019-12-27 04:34:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:16,897 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 04:34:16,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:16,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:34:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:16,938 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 04:34:16,938 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 04:34:16,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 04:34:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 04:34:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 04:34:17,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 04:34:17,314 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 04:34:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:17,314 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 04:34:17,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 04:34:17,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:17,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:17,316 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:17,317 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:17,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1830634066, now seen corresponding path program 1 times [2019-12-27 04:34:17,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:17,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445666907] [2019-12-27 04:34:17,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:17,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445666907] [2019-12-27 04:34:17,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418033501] [2019-12-27 04:34:17,378 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-27 04:34:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:17,468 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:17,475 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:17,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:17,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:17,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378530361] [2019-12-27 04:34:17,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:17,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:17,571 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 16 states. [2019-12-27 04:34:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:18,521 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-27 04:34:18,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:18,522 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:34:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:18,577 INFO L225 Difference]: With dead ends: 26399 [2019-12-27 04:34:18,577 INFO L226 Difference]: Without dead ends: 26395 [2019-12-27 04:34:18,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:18,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-27 04:34:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 8003. [2019-12-27 04:34:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-12-27 04:34:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 37166 transitions. [2019-12-27 04:34:19,109 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 37166 transitions. Word has length 21 [2019-12-27 04:34:19,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:19,109 INFO L462 AbstractCegarLoop]: Abstraction has 8003 states and 37166 transitions. [2019-12-27 04:34:19,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:19,109 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 37166 transitions. [2019-12-27 04:34:19,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:19,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:19,111 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:19,311 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:19,315 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:19,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:19,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1820039506, now seen corresponding path program 2 times [2019-12-27 04:34:19,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:19,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161680590] [2019-12-27 04:34:19,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:19,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161680590] [2019-12-27 04:34:19,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189813478] [2019-12-27 04:34:19,385 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:19,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:34:19,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:19,459 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:19,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 04:34:19,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:19,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:19,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721898326] [2019-12-27 04:34:19,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:19,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:19,553 INFO L87 Difference]: Start difference. First operand 8003 states and 37166 transitions. Second operand 16 states. [2019-12-27 04:34:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:20,529 INFO L93 Difference]: Finished difference Result 26117 states and 99264 transitions. [2019-12-27 04:34:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:20,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:34:20,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:20,584 INFO L225 Difference]: With dead ends: 26117 [2019-12-27 04:34:20,584 INFO L226 Difference]: Without dead ends: 26111 [2019-12-27 04:34:20,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26111 states. [2019-12-27 04:34:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26111 to 7893. [2019-12-27 04:34:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 04:34:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 04:34:20,859 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 04:34:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:20,860 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 04:34:20,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:20,860 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 04:34:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:20,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:20,861 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:21,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:21,062 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:34:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -135145800, now seen corresponding path program 3 times [2019-12-27 04:34:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:21,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264569930] [2019-12-27 04:34:21,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:21,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264569930] [2019-12-27 04:34:21,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:21,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:21,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196716741] [2019-12-27 04:34:21,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:21,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:21,141 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-27 04:34:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:22,038 INFO L93 Difference]: Finished difference Result 26136 states and 99362 transitions. [2019-12-27 04:34:22,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:22,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:34:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:22,105 INFO L225 Difference]: With dead ends: 26136 [2019-12-27 04:34:22,105 INFO L226 Difference]: Without dead ends: 26132 [2019-12-27 04:34:22,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26132 states. [2019-12-27 04:34:22,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26132 to 7683. [2019-12-27 04:34:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-12-27 04:34:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 35650 transitions. [2019-12-27 04:34:22,565 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 35650 transitions. Word has length 21 [2019-12-27 04:34:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:22,566 INFO L462 AbstractCegarLoop]: Abstraction has 7683 states and 35650 transitions. [2019-12-27 04:34:22,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 35650 transitions. [2019-12-27 04:34:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:22,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:22,568 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:22,568 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-27 04:34:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash -127259400, now seen corresponding path program 4 times [2019-12-27 04:34:22,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:22,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3676634] [2019-12-27 04:34:22,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:22,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:22,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3676634] [2019-12-27 04:34:22,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:22,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:22,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28567833] [2019-12-27 04:34:22,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:22,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:22,635 INFO L87 Difference]: Start difference. First operand 7683 states and 35650 transitions. Second operand 9 states. [2019-12-27 04:34:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:23,480 INFO L93 Difference]: Finished difference Result 25967 states and 98669 transitions. [2019-12-27 04:34:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:23,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:34:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:23,569 INFO L225 Difference]: With dead ends: 25967 [2019-12-27 04:34:23,569 INFO L226 Difference]: Without dead ends: 25961 [2019-12-27 04:34:23,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:23,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2019-12-27 04:34:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 7577. [2019-12-27 04:34:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2019-12-27 04:34:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 35112 transitions. [2019-12-27 04:34:23,969 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 35112 transitions. Word has length 21 [2019-12-27 04:34:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:23,969 INFO L462 AbstractCegarLoop]: Abstraction has 7577 states and 35112 transitions. [2019-12-27 04:34:23,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:23,969 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 35112 transitions. [2019-12-27 04:34:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:23,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:23,970 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:23,971 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-27 04:34:23,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash 980776630, now seen corresponding path program 1 times [2019-12-27 04:34:23,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:23,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019404001] [2019-12-27 04:34:23,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:24,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019404001] [2019-12-27 04:34:24,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:24,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:34:24,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17570695] [2019-12-27 04:34:24,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:34:24,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:24,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:34:24,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:34:24,018 INFO L87 Difference]: Start difference. First operand 7577 states and 35112 transitions. Second operand 5 states. [2019-12-27 04:34:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:24,154 INFO L93 Difference]: Finished difference Result 12960 states and 56912 transitions. [2019-12-27 04:34:24,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:34:24,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 04:34:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:24,186 INFO L225 Difference]: With dead ends: 12960 [2019-12-27 04:34:24,186 INFO L226 Difference]: Without dead ends: 12944 [2019-12-27 04:34:24,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-27 04:34:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 9056. [2019-12-27 04:34:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-12-27 04:34:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 41951 transitions. [2019-12-27 04:34:24,500 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 41951 transitions. Word has length 21 [2019-12-27 04:34:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:24,500 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 41951 transitions. [2019-12-27 04:34:24,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:34:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 41951 transitions. [2019-12-27 04:34:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:24,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:24,501 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:24,502 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-27 04:34:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1464178168, now seen corresponding path program 5 times [2019-12-27 04:34:24,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:24,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866924189] [2019-12-27 04:34:24,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:24,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866924189] [2019-12-27 04:34:24,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:24,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:24,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304088555] [2019-12-27 04:34:24,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:24,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:24,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:24,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:24,577 INFO L87 Difference]: Start difference. First operand 9056 states and 41951 transitions. Second operand 9 states. [2019-12-27 04:34:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:25,387 INFO L93 Difference]: Finished difference Result 29260 states and 112921 transitions. [2019-12-27 04:34:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:25,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:34:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:25,470 INFO L225 Difference]: With dead ends: 29260 [2019-12-27 04:34:25,470 INFO L226 Difference]: Without dead ends: 29253 [2019-12-27 04:34:25,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29253 states. [2019-12-27 04:34:25,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29253 to 8780. [2019-12-27 04:34:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2019-12-27 04:34:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 40645 transitions. [2019-12-27 04:34:25,827 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 40645 transitions. Word has length 21 [2019-12-27 04:34:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:25,827 INFO L462 AbstractCegarLoop]: Abstraction has 8780 states and 40645 transitions. [2019-12-27 04:34:25,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 40645 transitions. [2019-12-27 04:34:25,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:34:25,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:25,829 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:25,829 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-27 04:34:25,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:25,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1466886328, now seen corresponding path program 6 times [2019-12-27 04:34:25,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:25,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248503592] [2019-12-27 04:34:25,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:34:25,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248503592] [2019-12-27 04:34:25,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:25,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:25,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665433785] [2019-12-27 04:34:25,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:25,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:25,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:25,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:25,930 INFO L87 Difference]: Start difference. First operand 8780 states and 40645 transitions. Second operand 9 states. [2019-12-27 04:34:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:26,792 INFO L93 Difference]: Finished difference Result 28874 states and 111219 transitions. [2019-12-27 04:34:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:26,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:34:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:26,851 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 04:34:26,852 INFO L226 Difference]: Without dead ends: 28864 [2019-12-27 04:34:26,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28864 states. [2019-12-27 04:34:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28864 to 8405. [2019-12-27 04:34:27,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 04:34:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 04:34:27,306 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 04:34:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:27,306 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 04:34:27,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 04:34:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:34:27,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:27,308 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:27,308 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-27 04:34:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash 792940754, now seen corresponding path program 1 times [2019-12-27 04:34:27,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:27,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955606597] [2019-12-27 04:34:27,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:27,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955606597] [2019-12-27 04:34:27,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804872350] [2019-12-27 04:34:27,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:27,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:34:27,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:27,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:27,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:34:27,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601256231] [2019-12-27 04:34:27,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:34:27,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:27,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:34:27,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:34:27,501 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 12 states. [2019-12-27 04:34:27,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:27,915 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-27 04:34:27,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:27,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 04:34:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:27,954 INFO L225 Difference]: With dead ends: 19371 [2019-12-27 04:34:27,955 INFO L226 Difference]: Without dead ends: 19359 [2019-12-27 04:34:27,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:34:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-27 04:34:28,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-27 04:34:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 04:34:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 04:34:28,173 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 04:34:28,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:28,173 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 04:34:28,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:34:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 04:34:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:34:28,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:28,176 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:28,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:28,378 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-27 04:34:28,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:28,378 INFO L82 PathProgramCache]: Analyzing trace with hash 568712663, now seen corresponding path program 1 times [2019-12-27 04:34:28,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:28,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133763979] [2019-12-27 04:34:28,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:28,425 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-27 04:34:28,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133763979] [2019-12-27 04:34:28,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475410583] [2019-12-27 04:34:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:28,502 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:34:28,503 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:28,569 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-27 04:34:28,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:28,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:34:28,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3468486] [2019-12-27 04:34:28,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:34:28,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:28,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:34:28,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:34:28,570 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 12 states. [2019-12-27 04:34:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:29,027 INFO L93 Difference]: Finished difference Result 20307 states and 83553 transitions. [2019-12-27 04:34:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:29,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 04:34:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:29,075 INFO L225 Difference]: With dead ends: 20307 [2019-12-27 04:34:29,076 INFO L226 Difference]: Without dead ends: 20293 [2019-12-27 04:34:29,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:34:29,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20293 states. [2019-12-27 04:34:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20293 to 8934. [2019-12-27 04:34:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 04:34:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 41293 transitions. [2019-12-27 04:34:29,336 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 41293 transitions. Word has length 23 [2019-12-27 04:34:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:29,336 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 41293 transitions. [2019-12-27 04:34:29,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:34:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 41293 transitions. [2019-12-27 04:34:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:34:29,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:29,339 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:29,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:29,539 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-27 04:34:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1942317765, now seen corresponding path program 1 times [2019-12-27 04:34:29,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:29,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872810672] [2019-12-27 04:34:29,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:29,715 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 04:34:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:29,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872810672] [2019-12-27 04:34:29,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:29,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:29,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513101112] [2019-12-27 04:34:29,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:29,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:29,744 INFO L87 Difference]: Start difference. First operand 8934 states and 41293 transitions. Second operand 7 states. [2019-12-27 04:34:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:30,096 INFO L93 Difference]: Finished difference Result 21050 states and 86745 transitions. [2019-12-27 04:34:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:30,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 04:34:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:30,147 INFO L225 Difference]: With dead ends: 21050 [2019-12-27 04:34:30,147 INFO L226 Difference]: Without dead ends: 21031 [2019-12-27 04:34:30,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21031 states. [2019-12-27 04:34:30,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21031 to 9143. [2019-12-27 04:34:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 04:34:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-27 04:34:30,398 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-27 04:34:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:30,398 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-27 04:34:30,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-27 04:34:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:34:30,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:30,400 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:30,400 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-27 04:34:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1928498089, now seen corresponding path program 2 times [2019-12-27 04:34:30,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:30,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568196021] [2019-12-27 04:34:30,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:30,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568196021] [2019-12-27 04:34:30,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:30,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:30,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534794618] [2019-12-27 04:34:30,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:30,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:30,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:30,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:30,448 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 7 states. [2019-12-27 04:34:30,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:30,800 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-27 04:34:30,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:30,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 04:34:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:30,845 INFO L225 Difference]: With dead ends: 21118 [2019-12-27 04:34:30,845 INFO L226 Difference]: Without dead ends: 21099 [2019-12-27 04:34:30,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-27 04:34:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-27 04:34:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 04:34:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-27 04:34:31,095 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-27 04:34:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:31,096 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-27 04:34:31,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-27 04:34:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:34:31,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:31,098 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:31,098 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-27 04:34:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1928500910, now seen corresponding path program 2 times [2019-12-27 04:34:31,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:31,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770382372] [2019-12-27 04:34:31,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:31,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770382372] [2019-12-27 04:34:31,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:31,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:31,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710631065] [2019-12-27 04:34:31,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:31,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:31,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:31,163 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 7 states. [2019-12-27 04:34:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:31,631 INFO L93 Difference]: Finished difference Result 20904 states and 85935 transitions. [2019-12-27 04:34:31,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:31,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 04:34:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:31,695 INFO L225 Difference]: With dead ends: 20904 [2019-12-27 04:34:31,695 INFO L226 Difference]: Without dead ends: 20885 [2019-12-27 04:34:31,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20885 states. [2019-12-27 04:34:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20885 to 9243. [2019-12-27 04:34:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-27 04:34:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-27 04:34:32,049 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-27 04:34:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:32,050 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-27 04:34:32,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-27 04:34:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:34:32,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:32,053 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:32,053 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-27 04:34:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1928509125, now seen corresponding path program 2 times [2019-12-27 04:34:32,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:32,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909229971] [2019-12-27 04:34:32,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:32,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909229971] [2019-12-27 04:34:32,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:32,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:34:32,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184903209] [2019-12-27 04:34:32,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:34:32,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:34:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:32,100 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 7 states. [2019-12-27 04:34:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:32,467 INFO L93 Difference]: Finished difference Result 20784 states and 85269 transitions. [2019-12-27 04:34:32,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:34:32,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 04:34:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:32,626 INFO L225 Difference]: With dead ends: 20784 [2019-12-27 04:34:32,626 INFO L226 Difference]: Without dead ends: 20765 [2019-12-27 04:34:32,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:34:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20765 states. [2019-12-27 04:34:32,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20765 to 9286. [2019-12-27 04:34:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 04:34:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 04:34:32,867 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 04:34:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:32,868 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 04:34:32,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:34:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 04:34:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:32,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:32,871 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-27 04:34:32,871 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-27 04:34:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1810061765, now seen corresponding path program 1 times [2019-12-27 04:34:32,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:32,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311677239] [2019-12-27 04:34:32,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:32,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:32,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311677239] [2019-12-27 04:34:32,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865760534] [2019-12-27 04:34:32,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:33,019 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:33,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:33,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:33,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:33,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341019215] [2019-12-27 04:34:33,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:33,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:33,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:33,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:33,131 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 16 states. [2019-12-27 04:34:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:34,094 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-27 04:34:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:34,095 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:34,155 INFO L225 Difference]: With dead ends: 29793 [2019-12-27 04:34:34,156 INFO L226 Difference]: Without dead ends: 29783 [2019-12-27 04:34:34,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-27 04:34:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9208. [2019-12-27 04:34:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9208 states. [2019-12-27 04:34:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 42351 transitions. [2019-12-27 04:34:34,467 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 42351 transitions. Word has length 25 [2019-12-27 04:34:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:34,468 INFO L462 AbstractCegarLoop]: Abstraction has 9208 states and 42351 transitions. [2019-12-27 04:34:34,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 42351 transitions. [2019-12-27 04:34:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:34,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:34,472 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-27 04:34:34,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:34,676 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-27 04:34:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:34,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1820667361, now seen corresponding path program 1 times [2019-12-27 04:34:34,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:34,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493612827] [2019-12-27 04:34:34,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:34,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493612827] [2019-12-27 04:34:34,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549538219] [2019-12-27 04:34:34,735 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-27 04:34:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:34,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:34,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:34,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:34,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:34,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:34,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101498078] [2019-12-27 04:34:34,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:34,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:34,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:34,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:34,929 INFO L87 Difference]: Start difference. First operand 9208 states and 42351 transitions. Second operand 16 states. [2019-12-27 04:34:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:35,936 INFO L93 Difference]: Finished difference Result 29371 states and 113449 transitions. [2019-12-27 04:34:35,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:35,937 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:35,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:36,174 INFO L225 Difference]: With dead ends: 29371 [2019-12-27 04:34:36,175 INFO L226 Difference]: Without dead ends: 29361 [2019-12-27 04:34:36,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:36,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29361 states. [2019-12-27 04:34:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29361 to 9154. [2019-12-27 04:34:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-12-27 04:34:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 42049 transitions. [2019-12-27 04:34:36,492 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 42049 transitions. Word has length 25 [2019-12-27 04:34:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:36,492 INFO L462 AbstractCegarLoop]: Abstraction has 9154 states and 42049 transitions. [2019-12-27 04:34:36,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 42049 transitions. [2019-12-27 04:34:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:36,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:36,496 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-27 04:34:36,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:36,697 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-27 04:34:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1806847685, now seen corresponding path program 2 times [2019-12-27 04:34:36,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:36,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608642467] [2019-12-27 04:34:36,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:36,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608642467] [2019-12-27 04:34:36,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980590826] [2019-12-27 04:34:36,771 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:36,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:34:36,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:36,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:36,870 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:36,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:36,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:36,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839889455] [2019-12-27 04:34:36,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:36,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:36,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:36,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:36,979 INFO L87 Difference]: Start difference. First operand 9154 states and 42049 transitions. Second operand 16 states. [2019-12-27 04:34:37,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:37,944 INFO L93 Difference]: Finished difference Result 28955 states and 111688 transitions. [2019-12-27 04:34:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:37,944 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:38,008 INFO L225 Difference]: With dead ends: 28955 [2019-12-27 04:34:38,008 INFO L226 Difference]: Without dead ends: 28944 [2019-12-27 04:34:38,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:38,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28944 states. [2019-12-27 04:34:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28944 to 9151. [2019-12-27 04:34:38,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-27 04:34:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 41998 transitions. [2019-12-27 04:34:38,370 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 41998 transitions. Word has length 25 [2019-12-27 04:34:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:38,370 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 41998 transitions. [2019-12-27 04:34:38,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 41998 transitions. [2019-12-27 04:34:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:38,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:38,373 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-27 04:34:38,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:38,574 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-27 04:34:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1806858721, now seen corresponding path program 2 times [2019-12-27 04:34:38,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:38,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632794129] [2019-12-27 04:34:38,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:38,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:38,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632794129] [2019-12-27 04:34:38,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099041154] [2019-12-27 04:34:38,640 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:38,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:34:38,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:38,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:38,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 04:34:38,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:38,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:38,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210684509] [2019-12-27 04:34:38,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:38,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:38,834 INFO L87 Difference]: Start difference. First operand 9151 states and 41998 transitions. Second operand 16 states. [2019-12-27 04:34:39,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:39,805 INFO L93 Difference]: Finished difference Result 28625 states and 110367 transitions. [2019-12-27 04:34:39,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:39,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:39,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:39,863 INFO L225 Difference]: With dead ends: 28625 [2019-12-27 04:34:39,864 INFO L226 Difference]: Without dead ends: 28614 [2019-12-27 04:34:39,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28614 states. [2019-12-27 04:34:40,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28614 to 9044. [2019-12-27 04:34:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 04:34:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 04:34:40,354 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 04:34:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:40,354 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 04:34:40,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:40,354 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 04:34:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:40,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:40,357 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-27 04:34:40,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:40,558 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-27 04:34:40,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1077942095, now seen corresponding path program 3 times [2019-12-27 04:34:40,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:40,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829556978] [2019-12-27 04:34:40,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:40,623 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-27 04:34:40,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829556978] [2019-12-27 04:34:40,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147325285] [2019-12-27 04:34:40,624 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:40,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:34:40,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:40,699 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:40,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:40,797 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-27 04:34:40,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:40,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:40,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766273446] [2019-12-27 04:34:40,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:40,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:40,799 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 16 states. [2019-12-27 04:34:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:41,763 INFO L93 Difference]: Finished difference Result 28739 states and 110779 transitions. [2019-12-27 04:34:41,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:41,764 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:41,831 INFO L225 Difference]: With dead ends: 28739 [2019-12-27 04:34:41,831 INFO L226 Difference]: Without dead ends: 28729 [2019-12-27 04:34:41,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28729 states. [2019-12-27 04:34:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28729 to 8878. [2019-12-27 04:34:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-27 04:34:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 40685 transitions. [2019-12-27 04:34:42,128 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 40685 transitions. Word has length 25 [2019-12-27 04:34:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:42,128 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 40685 transitions. [2019-12-27 04:34:42,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 40685 transitions. [2019-12-27 04:34:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:42,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:42,131 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-27 04:34:42,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:42,332 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-27 04:34:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1085836710, now seen corresponding path program 1 times [2019-12-27 04:34:42,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:42,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187670488] [2019-12-27 04:34:42,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:42,400 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-27 04:34:42,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187670488] [2019-12-27 04:34:42,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570778445] [2019-12-27 04:34:42,401 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-27 04:34:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:42,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:42,477 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:42,573 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-27 04:34:42,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:42,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:42,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312330493] [2019-12-27 04:34:42,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:42,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:42,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:42,574 INFO L87 Difference]: Start difference. First operand 8878 states and 40685 transitions. Second operand 16 states. [2019-12-27 04:34:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:43,665 INFO L93 Difference]: Finished difference Result 29134 states and 112632 transitions. [2019-12-27 04:34:43,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:43,665 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:43,724 INFO L225 Difference]: With dead ends: 29134 [2019-12-27 04:34:43,724 INFO L226 Difference]: Without dead ends: 29124 [2019-12-27 04:34:43,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29124 states. [2019-12-27 04:34:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29124 to 8860. [2019-12-27 04:34:44,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2019-12-27 04:34:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 40559 transitions. [2019-12-27 04:34:44,033 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 40559 transitions. Word has length 25 [2019-12-27 04:34:44,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:44,034 INFO L462 AbstractCegarLoop]: Abstraction has 8860 states and 40559 transitions. [2019-12-27 04:34:44,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 40559 transitions. [2019-12-27 04:34:44,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:44,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:44,037 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-27 04:34:44,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:44,237 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-27 04:34:44,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:44,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1072019855, now seen corresponding path program 4 times [2019-12-27 04:34:44,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:44,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052047698] [2019-12-27 04:34:44,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:44,298 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-27 04:34:44,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052047698] [2019-12-27 04:34:44,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613308101] [2019-12-27 04:34:44,298 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:44,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:34:44,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:44,381 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:44,382 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:44,472 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-27 04:34:44,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:44,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:44,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963778310] [2019-12-27 04:34:44,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:44,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:44,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:44,474 INFO L87 Difference]: Start difference. First operand 8860 states and 40559 transitions. Second operand 16 states. [2019-12-27 04:34:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:45,509 INFO L93 Difference]: Finished difference Result 28595 states and 110187 transitions. [2019-12-27 04:34:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:45,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:45,567 INFO L225 Difference]: With dead ends: 28595 [2019-12-27 04:34:45,567 INFO L226 Difference]: Without dead ends: 28584 [2019-12-27 04:34:45,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28584 states. [2019-12-27 04:34:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28584 to 8857. [2019-12-27 04:34:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2019-12-27 04:34:45,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 40508 transitions. [2019-12-27 04:34:45,868 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 40508 transitions. Word has length 25 [2019-12-27 04:34:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:45,868 INFO L462 AbstractCegarLoop]: Abstraction has 8857 states and 40508 transitions. [2019-12-27 04:34:45,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 40508 transitions. [2019-12-27 04:34:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:45,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:45,872 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-27 04:34:46,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:46,073 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-27 04:34:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:46,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1072028070, now seen corresponding path program 2 times [2019-12-27 04:34:46,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:46,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015049813] [2019-12-27 04:34:46,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:46,154 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-27 04:34:46,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015049813] [2019-12-27 04:34:46,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106435399] [2019-12-27 04:34:46,155 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:46,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:34:46,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:34:46,234 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:34:46,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:34:46,312 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-27 04:34:46,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:34:46,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:34:46,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051452564] [2019-12-27 04:34:46,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:34:46,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:46,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:34:46,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:34:46,315 INFO L87 Difference]: Start difference. First operand 8857 states and 40508 transitions. Second operand 16 states. [2019-12-27 04:34:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:47,374 INFO L93 Difference]: Finished difference Result 28468 states and 109859 transitions. [2019-12-27 04:34:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:47,375 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:34:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:47,443 INFO L225 Difference]: With dead ends: 28468 [2019-12-27 04:34:47,444 INFO L226 Difference]: Without dead ends: 28454 [2019-12-27 04:34:47,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:34:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28454 states. [2019-12-27 04:34:47,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28454 to 8722. [2019-12-27 04:34:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 04:34:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39857 transitions. [2019-12-27 04:34:47,769 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39857 transitions. Word has length 25 [2019-12-27 04:34:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:47,769 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39857 transitions. [2019-12-27 04:34:47,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:34:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39857 transitions. [2019-12-27 04:34:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:47,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:47,774 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:34:47,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:34:47,975 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-27 04:34:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2071430200, now seen corresponding path program 1 times [2019-12-27 04:34:47,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:47,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269245604] [2019-12-27 04:34:47,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:48,011 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-27 04:34:48,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269245604] [2019-12-27 04:34:48,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:48,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:34:48,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827269237] [2019-12-27 04:34:48,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:34:48,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:34:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:34:48,013 INFO L87 Difference]: Start difference. First operand 8722 states and 39857 transitions. Second operand 5 states. [2019-12-27 04:34:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:48,171 INFO L93 Difference]: Finished difference Result 14188 states and 62117 transitions. [2019-12-27 04:34:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:34:48,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 04:34:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:48,205 INFO L225 Difference]: With dead ends: 14188 [2019-12-27 04:34:48,206 INFO L226 Difference]: Without dead ends: 14156 [2019-12-27 04:34:48,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:34:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-27 04:34:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 10325. [2019-12-27 04:34:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10325 states. [2019-12-27 04:34:48,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 46869 transitions. [2019-12-27 04:34:48,403 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 46869 transitions. Word has length 25 [2019-12-27 04:34:48,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:48,404 INFO L462 AbstractCegarLoop]: Abstraction has 10325 states and 46869 transitions. [2019-12-27 04:34:48,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:34:48,404 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 46869 transitions. [2019-12-27 04:34:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:48,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:48,407 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-27 04:34:48,407 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-27 04:34:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193032, now seen corresponding path program 3 times [2019-12-27 04:34:48,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:48,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880497698] [2019-12-27 04:34:48,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:48,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880497698] [2019-12-27 04:34:48,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:48,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:48,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162105791] [2019-12-27 04:34:48,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:48,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:48,466 INFO L87 Difference]: Start difference. First operand 10325 states and 46869 transitions. Second operand 9 states. [2019-12-27 04:34:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:49,366 INFO L93 Difference]: Finished difference Result 31989 states and 124702 transitions. [2019-12-27 04:34:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:49,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:49,626 INFO L225 Difference]: With dead ends: 31989 [2019-12-27 04:34:49,626 INFO L226 Difference]: Without dead ends: 31973 [2019-12-27 04:34:49,626 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-27 04:34:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31973 states. [2019-12-27 04:34:49,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31973 to 10175. [2019-12-27 04:34:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10175 states. [2019-12-27 04:34:49,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 46142 transitions. [2019-12-27 04:34:49,993 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 46142 transitions. Word has length 25 [2019-12-27 04:34:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:49,993 INFO L462 AbstractCegarLoop]: Abstraction has 10175 states and 46142 transitions. [2019-12-27 04:34:49,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 46142 transitions. [2019-12-27 04:34:49,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:49,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:49,997 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-27 04:34:49,998 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-27 04:34:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1737482051, now seen corresponding path program 3 times [2019-12-27 04:34:49,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:49,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74308350] [2019-12-27 04:34:49,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:50,076 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:50,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74308350] [2019-12-27 04:34:50,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:50,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:50,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536533759] [2019-12-27 04:34:50,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:50,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:50,078 INFO L87 Difference]: Start difference. First operand 10175 states and 46142 transitions. Second operand 9 states. [2019-12-27 04:34:50,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:50,908 INFO L93 Difference]: Finished difference Result 31605 states and 123025 transitions. [2019-12-27 04:34:50,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:50,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:50,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:50,974 INFO L225 Difference]: With dead ends: 31605 [2019-12-27 04:34:50,974 INFO L226 Difference]: Without dead ends: 31589 [2019-12-27 04:34:50,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31589 states. [2019-12-27 04:34:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31589 to 10057. [2019-12-27 04:34:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2019-12-27 04:34:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 45612 transitions. [2019-12-27 04:34:51,310 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 45612 transitions. Word has length 25 [2019-12-27 04:34:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:51,310 INFO L462 AbstractCegarLoop]: Abstraction has 10057 states and 45612 transitions. [2019-12-27 04:34:51,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 45612 transitions. [2019-12-27 04:34:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:51,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:51,313 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-27 04:34:51,313 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-27 04:34:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1743407112, now seen corresponding path program 4 times [2019-12-27 04:34:51,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:51,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255943493] [2019-12-27 04:34:51,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:51,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255943493] [2019-12-27 04:34:51,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:51,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:51,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21849554] [2019-12-27 04:34:51,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:51,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:51,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:51,386 INFO L87 Difference]: Start difference. First operand 10057 states and 45612 transitions. Second operand 9 states. [2019-12-27 04:34:52,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:52,289 INFO L93 Difference]: Finished difference Result 31999 states and 124705 transitions. [2019-12-27 04:34:52,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:52,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:52,355 INFO L225 Difference]: With dead ends: 31999 [2019-12-27 04:34:52,355 INFO L226 Difference]: Without dead ends: 31979 [2019-12-27 04:34:52,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31979 states. [2019-12-27 04:34:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31979 to 10010. [2019-12-27 04:34:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10010 states. [2019-12-27 04:34:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 45376 transitions. [2019-12-27 04:34:52,720 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 45376 transitions. Word has length 25 [2019-12-27 04:34:52,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:52,720 INFO L462 AbstractCegarLoop]: Abstraction has 10010 states and 45376 transitions. [2019-12-27 04:34:52,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 45376 transitions. [2019-12-27 04:34:52,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:52,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:52,723 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-27 04:34:52,723 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-27 04:34:52,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:52,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1743404291, now seen corresponding path program 4 times [2019-12-27 04:34:52,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:52,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92209360] [2019-12-27 04:34:52,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:52,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92209360] [2019-12-27 04:34:52,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:52,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:52,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117445385] [2019-12-27 04:34:52,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:52,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:52,801 INFO L87 Difference]: Start difference. First operand 10010 states and 45376 transitions. Second operand 9 states. [2019-12-27 04:34:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:53,835 INFO L93 Difference]: Finished difference Result 31576 states and 122968 transitions. [2019-12-27 04:34:53,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:53,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:53,900 INFO L225 Difference]: With dead ends: 31576 [2019-12-27 04:34:53,900 INFO L226 Difference]: Without dead ends: 31556 [2019-12-27 04:34:53,901 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-27 04:34:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31556 states. [2019-12-27 04:34:54,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31556 to 9827. [2019-12-27 04:34:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9827 states. [2019-12-27 04:34:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44489 transitions. [2019-12-27 04:34:54,222 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 44489 transitions. Word has length 25 [2019-12-27 04:34:54,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:54,222 INFO L462 AbstractCegarLoop]: Abstraction has 9827 states and 44489 transitions. [2019-12-27 04:34:54,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:54,222 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 44489 transitions. [2019-12-27 04:34:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:54,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:54,226 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-27 04:34:54,226 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-27 04:34:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:54,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2139211039, now seen corresponding path program 5 times [2019-12-27 04:34:54,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:54,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721592282] [2019-12-27 04:34:54,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:54,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721592282] [2019-12-27 04:34:54,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:54,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:54,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161413904] [2019-12-27 04:34:54,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:54,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:54,292 INFO L87 Difference]: Start difference. First operand 9827 states and 44489 transitions. Second operand 9 states. [2019-12-27 04:34:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:55,122 INFO L93 Difference]: Finished difference Result 31623 states and 123094 transitions. [2019-12-27 04:34:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:55,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:55,187 INFO L225 Difference]: With dead ends: 31623 [2019-12-27 04:34:55,187 INFO L226 Difference]: Without dead ends: 31607 [2019-12-27 04:34:55,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:55,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2019-12-27 04:34:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 9671. [2019-12-27 04:34:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 04:34:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 43725 transitions. [2019-12-27 04:34:55,518 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 43725 transitions. Word has length 25 [2019-12-27 04:34:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:55,518 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 43725 transitions. [2019-12-27 04:34:55,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 43725 transitions. [2019-12-27 04:34:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:55,521 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:55,521 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-27 04:34:55,521 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-27 04:34:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash -2139202824, now seen corresponding path program 5 times [2019-12-27 04:34:55,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:55,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913524840] [2019-12-27 04:34:55,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:55,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913524840] [2019-12-27 04:34:55,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:55,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:55,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234417093] [2019-12-27 04:34:55,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:55,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:55,585 INFO L87 Difference]: Start difference. First operand 9671 states and 43725 transitions. Second operand 9 states. [2019-12-27 04:34:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:56,421 INFO L93 Difference]: Finished difference Result 31103 states and 120876 transitions. [2019-12-27 04:34:56,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:56,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:56,486 INFO L225 Difference]: With dead ends: 31103 [2019-12-27 04:34:56,486 INFO L226 Difference]: Without dead ends: 31087 [2019-12-27 04:34:56,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31087 states. [2019-12-27 04:34:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31087 to 9503. [2019-12-27 04:34:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2019-12-27 04:34:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 42917 transitions. [2019-12-27 04:34:56,810 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 42917 transitions. Word has length 25 [2019-12-27 04:34:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:56,810 INFO L462 AbstractCegarLoop]: Abstraction has 9503 states and 42917 transitions. [2019-12-27 04:34:56,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 42917 transitions. [2019-12-27 04:34:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:56,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:56,813 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-27 04:34:56,813 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-27 04:34:56,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:56,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2136502879, now seen corresponding path program 6 times [2019-12-27 04:34:56,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:56,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135129496] [2019-12-27 04:34:56,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:56,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135129496] [2019-12-27 04:34:56,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:56,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:56,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699382558] [2019-12-27 04:34:56,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:56,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:56,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:56,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:56,881 INFO L87 Difference]: Start difference. First operand 9503 states and 42917 transitions. Second operand 9 states. [2019-12-27 04:34:57,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:57,715 INFO L93 Difference]: Finished difference Result 30789 states and 119448 transitions. [2019-12-27 04:34:57,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:57,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:57,778 INFO L225 Difference]: With dead ends: 30789 [2019-12-27 04:34:57,778 INFO L226 Difference]: Without dead ends: 30769 [2019-12-27 04:34:57,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30769 states. [2019-12-27 04:34:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30769 to 9172. [2019-12-27 04:34:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9172 states. [2019-12-27 04:34:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9172 states to 9172 states and 41398 transitions. [2019-12-27 04:34:58,289 INFO L78 Accepts]: Start accepts. Automaton has 9172 states and 41398 transitions. Word has length 25 [2019-12-27 04:34:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:58,289 INFO L462 AbstractCegarLoop]: Abstraction has 9172 states and 41398 transitions. [2019-12-27 04:34:58,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 9172 states and 41398 transitions. [2019-12-27 04:34:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:58,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:58,292 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-27 04:34:58,292 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-27 04:34:58,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:58,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2136491843, now seen corresponding path program 5 times [2019-12-27 04:34:58,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:58,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087221059] [2019-12-27 04:34:58,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:58,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087221059] [2019-12-27 04:34:58,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:58,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:58,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075828525] [2019-12-27 04:34:58,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:58,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:58,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:58,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:58,357 INFO L87 Difference]: Start difference. First operand 9172 states and 41398 transitions. Second operand 9 states. [2019-12-27 04:34:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:34:59,254 INFO L93 Difference]: Finished difference Result 30398 states and 117772 transitions. [2019-12-27 04:34:59,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:34:59,254 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:34:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:34:59,321 INFO L225 Difference]: With dead ends: 30398 [2019-12-27 04:34:59,321 INFO L226 Difference]: Without dead ends: 30382 [2019-12-27 04:34:59,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:34:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30382 states. [2019-12-27 04:34:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30382 to 9066. [2019-12-27 04:34:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-27 04:34:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 40900 transitions. [2019-12-27 04:34:59,648 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 40900 transitions. Word has length 25 [2019-12-27 04:34:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:34:59,648 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 40900 transitions. [2019-12-27 04:34:59,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:34:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 40900 transitions. [2019-12-27 04:34:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:34:59,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:34:59,651 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-27 04:34:59,651 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-27 04:34:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:34:59,652 INFO L82 PathProgramCache]: Analyzing trace with hash -2128608264, now seen corresponding path program 6 times [2019-12-27 04:34:59,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:34:59,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062675625] [2019-12-27 04:34:59,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:34:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:34:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:34:59,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062675625] [2019-12-27 04:34:59,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:34:59,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:34:59,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439681773] [2019-12-27 04:34:59,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:34:59,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:34:59,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:34:59,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:34:59,736 INFO L87 Difference]: Start difference. First operand 9066 states and 40900 transitions. Second operand 9 states. [2019-12-27 04:35:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:00,685 INFO L93 Difference]: Finished difference Result 30130 states and 116617 transitions. [2019-12-27 04:35:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:00,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:35:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:00,753 INFO L225 Difference]: With dead ends: 30130 [2019-12-27 04:35:00,753 INFO L226 Difference]: Without dead ends: 30110 [2019-12-27 04:35:00,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:35:00,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-27 04:35:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 8819. [2019-12-27 04:35:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8819 states. [2019-12-27 04:35:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8819 states to 8819 states and 39792 transitions. [2019-12-27 04:35:01,061 INFO L78 Accepts]: Start accepts. Automaton has 8819 states and 39792 transitions. Word has length 25 [2019-12-27 04:35:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:01,061 INFO L462 AbstractCegarLoop]: Abstraction has 8819 states and 39792 transitions. [2019-12-27 04:35:01,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:35:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 8819 states and 39792 transitions. [2019-12-27 04:35:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:35:01,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:01,064 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-27 04:35:01,064 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-27 04:35:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:01,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2128605443, now seen corresponding path program 6 times [2019-12-27 04:35:01,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:01,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768878185] [2019-12-27 04:35:01,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:01,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:35:01,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768878185] [2019-12-27 04:35:01,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:01,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:35:01,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264961772] [2019-12-27 04:35:01,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:35:01,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:35:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:35:01,128 INFO L87 Difference]: Start difference. First operand 8819 states and 39792 transitions. Second operand 9 states. [2019-12-27 04:35:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:02,086 INFO L93 Difference]: Finished difference Result 29741 states and 115009 transitions. [2019-12-27 04:35:02,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:02,087 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:35:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:02,152 INFO L225 Difference]: With dead ends: 29741 [2019-12-27 04:35:02,152 INFO L226 Difference]: Without dead ends: 29721 [2019-12-27 04:35:02,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:35:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2019-12-27 04:35:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 8516. [2019-12-27 04:35:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 04:35:02,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 04:35:02,469 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 04:35:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:02,470 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 04:35:02,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:35:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 04:35:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 04:35:02,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:02,473 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:02,473 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-27 04:35:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:02,474 INFO L82 PathProgramCache]: Analyzing trace with hash -214879977, now seen corresponding path program 1 times [2019-12-27 04:35:02,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:02,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962331513] [2019-12-27 04:35:02,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:35:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:35:02,495 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:35:02,495 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:35:02,495 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 04:35:02,495 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 04:35:02,517 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,517 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,517 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,517 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,518 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,519 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,519 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,519 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,519 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,519 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,519 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,519 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,520 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,521 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,521 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,521 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,521 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,521 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,521 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,521 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,522 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,523 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,523 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,523 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,523 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,523 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,523 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,524 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,524 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,524 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,524 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,525 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,525 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,525 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,526 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,527 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,527 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,527 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,527 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,527 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,527 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,528 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,528 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,528 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,528 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,529 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,529 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,529 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,529 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,529 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,529 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,529 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,530 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,530 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,530 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,530 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,530 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,530 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,530 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,531 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,531 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,531 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,531 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,531 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,531 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,532 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,532 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,532 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,532 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,533 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,533 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,534 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,534 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,534 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,540 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,540 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,541 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,541 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,542 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,542 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,543 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,544 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,544 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,544 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,544 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,544 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,545 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,546 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,546 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,547 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,548 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,549 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,549 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,550 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,551 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,551 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,551 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,551 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,552 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,553 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,553 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,553 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,553 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,553 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,554 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,554 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,555 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,555 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,555 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,555 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,560 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,560 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,560 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,561 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:35:02,562 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 04:35:02,562 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:35:02,562 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:35:02,562 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:35:02,563 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:35:02,563 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:35:02,563 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:35:02,563 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:35:02,563 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:35:02,565 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 133 transitions [2019-12-27 04:35:02,565 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 04:35:02,587 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 04:35:02,587 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 04:35:02,590 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 04:35:02,598 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 04:35:02,620 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 04:35:02,621 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 04:35:02,623 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 04:35:02,631 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 04:35:02,631 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:35:04,676 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 04:35:04,843 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-27 04:35:05,071 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-27 04:35:05,150 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3471 [2019-12-27 04:35:05,150 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 04:35:05,150 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 04:35:06,383 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 04:35:06,384 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 04:35:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:35:06,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:06,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:35:06,384 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-27 04:35:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1229452, now seen corresponding path program 1 times [2019-12-27 04:35:06,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:06,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829555675] [2019-12-27 04:35:06,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:35:06,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829555675] [2019-12-27 04:35:06,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:06,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:35:06,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81530000] [2019-12-27 04:35:06,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:35:06,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:35:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:35:06,398 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 04:35:06,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:06,520 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 04:35:06,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:35:06,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:35:06,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:06,565 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 04:35:06,565 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 04:35:06,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:35:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 04:35:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 04:35:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 04:35:06,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 04:35:06,927 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 04:35:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:06,927 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 04:35:06,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:35:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 04:35:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 04:35:06,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:06,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:06,928 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-27 04:35:06,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2087713608, now seen corresponding path program 1 times [2019-12-27 04:35:06,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:06,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763305340] [2019-12-27 04:35:06,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:35:06,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763305340] [2019-12-27 04:35:06,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:06,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:35:06,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265614973] [2019-12-27 04:35:06,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:35:06,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:35:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:35:06,964 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 04:35:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:07,206 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 04:35:07,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:35:07,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 04:35:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:07,287 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 04:35:07,287 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 04:35:07,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:35:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 04:35:07,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 04:35:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 04:35:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 04:35:07,808 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 04:35:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:07,808 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 04:35:07,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:35:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 04:35:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:35:07,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:07,808 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:07,809 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-27 04:35:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -973722539, now seen corresponding path program 1 times [2019-12-27 04:35:07,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:07,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625409731] [2019-12-27 04:35:07,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:35:07,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625409731] [2019-12-27 04:35:07,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:07,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:35:07,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949930621] [2019-12-27 04:35:07,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:35:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:35:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:35:07,836 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 04:35:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:09,456 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 04:35:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:35:09,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 04:35:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:09,560 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 04:35:09,561 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 04:35:09,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:35:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 04:35:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 04:35:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 04:35:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 04:35:10,184 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 04:35:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:10,184 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 04:35:10,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:35:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 04:35:10,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:35:10,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:10,185 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:10,185 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-27 04:35:10,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:10,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1543295844, now seen corresponding path program 1 times [2019-12-27 04:35:10,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:10,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041644084] [2019-12-27 04:35:10,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:35:10,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041644084] [2019-12-27 04:35:10,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492222211] [2019-12-27 04:35:10,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:10,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:35:10,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:35:10,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:10,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:35:10,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758853281] [2019-12-27 04:35:10,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:35:10,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:35:10,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:35:10,367 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 12 states. [2019-12-27 04:35:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:10,940 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 04:35:10,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:35:10,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-27 04:35:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:11,101 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 04:35:11,101 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 04:35:11,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:35:11,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 04:35:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 04:35:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 04:35:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 04:35:11,978 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 04:35:11,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:11,978 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 04:35:11,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:35:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 04:35:11,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:35:11,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:11,979 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:12,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:12,179 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-27 04:35:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash 555508526, now seen corresponding path program 2 times [2019-12-27 04:35:12,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:12,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18911999] [2019-12-27 04:35:12,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 04:35:12,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18911999] [2019-12-27 04:35:12,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:12,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:35:12,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345631992] [2019-12-27 04:35:12,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:35:12,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:35:12,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:35:12,227 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 04:35:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:13,318 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 04:35:13,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:35:13,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 04:35:13,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:13,516 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 04:35:13,517 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 04:35:13,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:35:13,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 04:35:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 04:35:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 04:35:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 04:35:14,334 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 04:35:14,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:14,334 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 04:35:14,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:35:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 04:35:14,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:35:14,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:14,335 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:14,335 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-27 04:35:14,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:14,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1552042877, now seen corresponding path program 1 times [2019-12-27 04:35:14,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:14,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262349378] [2019-12-27 04:35:14,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:35:14,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262349378] [2019-12-27 04:35:14,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:14,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:35:14,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146363089] [2019-12-27 04:35:14,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:35:14,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:14,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:35:14,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:35:14,382 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 04:35:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:14,691 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 04:35:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:35:14,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 04:35:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:14,811 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 04:35:14,812 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 04:35:14,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:35:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 04:35:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 04:35:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 04:35:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 04:35:15,589 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 04:35:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:15,590 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 04:35:15,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:35:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 04:35:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:35:15,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:15,590 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:15,591 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-27 04:35:15,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1878511684, now seen corresponding path program 1 times [2019-12-27 04:35:15,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:15,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656630821] [2019-12-27 04:35:15,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:15,632 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-27 04:35:15,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656630821] [2019-12-27 04:35:15,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161465929] [2019-12-27 04:35:15,633 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-27 04:35:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:15,724 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:35:15,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:15,780 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-27 04:35:15,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:15,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:35:15,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844623085] [2019-12-27 04:35:15,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:35:15,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:35:15,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:35:15,782 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 12 states. [2019-12-27 04:35:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:16,505 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 04:35:16,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:35:16,505 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 04:35:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:16,710 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 04:35:16,710 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 04:35:16,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:35:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 04:35:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 04:35:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 04:35:19,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 04:35:19,921 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 04:35:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:19,922 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 04:35:19,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:35:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 04:35:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:35:19,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:19,922 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:20,123 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:20,123 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-27 04:35:20,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:20,124 INFO L82 PathProgramCache]: Analyzing trace with hash -90006000, now seen corresponding path program 1 times [2019-12-27 04:35:20,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:20,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119010361] [2019-12-27 04:35:20,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:20,162 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-27 04:35:20,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119010361] [2019-12-27 04:35:20,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807256304] [2019-12-27 04:35:20,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:20,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:35:20,250 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:20,301 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-27 04:35:20,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:20,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:35:20,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504038927] [2019-12-27 04:35:20,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:35:20,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:35:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:35:20,303 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 12 states. [2019-12-27 04:35:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:21,047 INFO L93 Difference]: Finished difference Result 67092 states and 321768 transitions. [2019-12-27 04:35:21,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:35:21,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-12-27 04:35:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:21,277 INFO L225 Difference]: With dead ends: 67092 [2019-12-27 04:35:21,277 INFO L226 Difference]: Without dead ends: 67083 [2019-12-27 04:35:21,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:35:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67083 states. [2019-12-27 04:35:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67083 to 27791. [2019-12-27 04:35:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-27 04:35:22,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-27 04:35:22,315 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-27 04:35:22,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:22,315 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-27 04:35:22,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:35:22,315 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-27 04:35:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:35:22,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:22,316 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:22,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:22,519 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-27 04:35:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551062, now seen corresponding path program 2 times [2019-12-27 04:35:22,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:22,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253321257] [2019-12-27 04:35:22,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:35:22,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253321257] [2019-12-27 04:35:22,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:22,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:35:22,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608478928] [2019-12-27 04:35:22,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:35:22,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:22,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:35:22,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:35:22,560 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 7 states. [2019-12-27 04:35:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:23,822 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-27 04:35:23,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:35:23,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:35:23,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:24,027 INFO L225 Difference]: With dead ends: 68100 [2019-12-27 04:35:24,027 INFO L226 Difference]: Without dead ends: 68091 [2019-12-27 04:35:24,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:35:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-27 04:35:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-27 04:35:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 04:35:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-27 04:35:25,064 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-27 04:35:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:25,064 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-27 04:35:25,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:35:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-27 04:35:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:35:25,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:25,065 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:25,065 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-27 04:35:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:25,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551992, now seen corresponding path program 2 times [2019-12-27 04:35:25,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:25,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240622349] [2019-12-27 04:35:25,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:35:25,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240622349] [2019-12-27 04:35:25,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:25,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:35:25,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879918085] [2019-12-27 04:35:25,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:35:25,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:35:25,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:35:25,103 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 7 states. [2019-12-27 04:35:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:25,711 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 04:35:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:35:25,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 04:35:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:25,911 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 04:35:25,911 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 04:35:25,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:35:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 04:35:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 04:35:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 04:35:29,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 04:35:29,509 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 04:35:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:29,509 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 04:35:29,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:35:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 04:35:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:35:29,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:29,510 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:29,511 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-27 04:35:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:29,511 INFO L82 PathProgramCache]: Analyzing trace with hash 113904919, now seen corresponding path program 1 times [2019-12-27 04:35:29,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:29,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66513452] [2019-12-27 04:35:29,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:35:29,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66513452] [2019-12-27 04:35:29,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489717392] [2019-12-27 04:35:29,573 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-27 04:35:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:29,664 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:35:29,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:35:29,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:29,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:35:29,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645076951] [2019-12-27 04:35:29,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:35:29,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:29,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:35:29,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:35:29,760 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 16 states. [2019-12-27 04:35:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:31,138 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-27 04:35:31,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:31,139 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:35:31,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:31,410 INFO L225 Difference]: With dead ends: 97639 [2019-12-27 04:35:31,410 INFO L226 Difference]: Without dead ends: 97635 [2019-12-27 04:35:31,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:35:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-27 04:35:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27697. [2019-12-27 04:35:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-27 04:35:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-27 04:35:32,827 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-27 04:35:32,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:32,828 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-27 04:35:32,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:35:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-27 04:35:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:35:32,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:32,829 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:33,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:33,029 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-27 04:35:33,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1363462911, now seen corresponding path program 2 times [2019-12-27 04:35:33,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:33,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038957008] [2019-12-27 04:35:33,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:33,087 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-27 04:35:33,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038957008] [2019-12-27 04:35:33,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504763288] [2019-12-27 04:35:33,088 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:33,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:35:33,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:35:33,175 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:35:33,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:33,257 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-27 04:35:33,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:33,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:35:33,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848911712] [2019-12-27 04:35:33,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:35:33,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:33,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:35:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:35:33,258 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 16 states. [2019-12-27 04:35:33,749 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 04:35:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:35,050 INFO L93 Difference]: Finished difference Result 96837 states and 436529 transitions. [2019-12-27 04:35:35,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:35,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:35:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:35,321 INFO L225 Difference]: With dead ends: 96837 [2019-12-27 04:35:35,321 INFO L226 Difference]: Without dead ends: 96831 [2019-12-27 04:35:35,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:35:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96831 states. [2019-12-27 04:35:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96831 to 27343. [2019-12-27 04:35:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 04:35:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 04:35:36,685 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 04:35:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:36,685 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 04:35:36,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:35:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 04:35:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:35:36,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:36,686 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:36,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:36,887 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-27 04:35:36,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:36,888 INFO L82 PathProgramCache]: Analyzing trace with hash -596422103, now seen corresponding path program 3 times [2019-12-27 04:35:36,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:36,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274315573] [2019-12-27 04:35:36,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:36,939 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-27 04:35:36,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274315573] [2019-12-27 04:35:36,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290574824] [2019-12-27 04:35:36,940 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:37,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:35:37,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:35:37,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:35:37,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:37,099 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-27 04:35:37,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:37,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:35:37,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988427440] [2019-12-27 04:35:37,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:35:37,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:35:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:35:37,101 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 16 states. [2019-12-27 04:35:38,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:38,991 INFO L93 Difference]: Finished difference Result 97329 states and 439144 transitions. [2019-12-27 04:35:38,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:38,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:35:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:39,270 INFO L225 Difference]: With dead ends: 97329 [2019-12-27 04:35:39,270 INFO L226 Difference]: Without dead ends: 97325 [2019-12-27 04:35:39,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:35:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97325 states. [2019-12-27 04:35:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97325 to 26991. [2019-12-27 04:35:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26991 states. [2019-12-27 04:35:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26991 states to 26991 states and 145461 transitions. [2019-12-27 04:35:40,611 INFO L78 Accepts]: Start accepts. Automaton has 26991 states and 145461 transitions. Word has length 21 [2019-12-27 04:35:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:40,612 INFO L462 AbstractCegarLoop]: Abstraction has 26991 states and 145461 transitions. [2019-12-27 04:35:40,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:35:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26991 states and 145461 transitions. [2019-12-27 04:35:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:35:40,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:40,613 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:40,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:40,814 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-27 04:35:40,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:40,814 INFO L82 PathProgramCache]: Analyzing trace with hash -607849943, now seen corresponding path program 4 times [2019-12-27 04:35:40,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:40,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616651721] [2019-12-27 04:35:40,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:40,880 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-27 04:35:40,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616651721] [2019-12-27 04:35:40,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628691801] [2019-12-27 04:35:40,880 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:40,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:35:40,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:35:40,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:35:40,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:41,053 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-27 04:35:41,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:41,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:35:41,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820335606] [2019-12-27 04:35:41,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:35:41,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:35:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:35:41,055 INFO L87 Difference]: Start difference. First operand 26991 states and 145461 transitions. Second operand 16 states. [2019-12-27 04:35:42,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:42,927 INFO L93 Difference]: Finished difference Result 96246 states and 433386 transitions. [2019-12-27 04:35:42,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:42,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 04:35:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:43,208 INFO L225 Difference]: With dead ends: 96246 [2019-12-27 04:35:43,208 INFO L226 Difference]: Without dead ends: 96240 [2019-12-27 04:35:43,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:35:43,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96240 states. [2019-12-27 04:35:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96240 to 26339. [2019-12-27 04:35:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2019-12-27 04:35:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 142000 transitions. [2019-12-27 04:35:44,538 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 142000 transitions. Word has length 21 [2019-12-27 04:35:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:44,538 INFO L462 AbstractCegarLoop]: Abstraction has 26339 states and 142000 transitions. [2019-12-27 04:35:44,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:35:44,538 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 142000 transitions. [2019-12-27 04:35:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:35:44,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:44,539 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:44,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:35:44,741 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-27 04:35:44,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:44,742 INFO L82 PathProgramCache]: Analyzing trace with hash 671564070, now seen corresponding path program 1 times [2019-12-27 04:35:44,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:44,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519212501] [2019-12-27 04:35:44,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:35:44,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519212501] [2019-12-27 04:35:44,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:44,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:35:44,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238704944] [2019-12-27 04:35:44,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:35:44,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:44,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:35:44,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:35:44,776 INFO L87 Difference]: Start difference. First operand 26339 states and 142000 transitions. Second operand 5 states. [2019-12-27 04:35:45,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:45,119 INFO L93 Difference]: Finished difference Result 47340 states and 243927 transitions. [2019-12-27 04:35:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:35:45,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 04:35:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:45,262 INFO L225 Difference]: With dead ends: 47340 [2019-12-27 04:35:45,262 INFO L226 Difference]: Without dead ends: 47324 [2019-12-27 04:35:45,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:35:45,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2019-12-27 04:35:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 32794. [2019-12-27 04:35:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32794 states. [2019-12-27 04:35:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32794 states to 32794 states and 178171 transitions. [2019-12-27 04:35:46,694 INFO L78 Accepts]: Start accepts. Automaton has 32794 states and 178171 transitions. Word has length 21 [2019-12-27 04:35:46,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:46,694 INFO L462 AbstractCegarLoop]: Abstraction has 32794 states and 178171 transitions. [2019-12-27 04:35:46,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:35:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32794 states and 178171 transitions. [2019-12-27 04:35:46,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:35:46,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:46,695 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:46,695 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-27 04:35:46,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:46,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1932039825, now seen corresponding path program 5 times [2019-12-27 04:35:46,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:46,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505647491] [2019-12-27 04:35:46,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:35:46,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505647491] [2019-12-27 04:35:46,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:46,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:35:46,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054024185] [2019-12-27 04:35:46,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:35:46,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:46,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:35:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:35:46,755 INFO L87 Difference]: Start difference. First operand 32794 states and 178171 transitions. Second operand 9 states. [2019-12-27 04:35:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:48,049 INFO L93 Difference]: Finished difference Result 112140 states and 515003 transitions. [2019-12-27 04:35:48,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:48,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:35:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:48,370 INFO L225 Difference]: With dead ends: 112140 [2019-12-27 04:35:48,370 INFO L226 Difference]: Without dead ends: 112133 [2019-12-27 04:35:48,371 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-27 04:35:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112133 states. [2019-12-27 04:35:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112133 to 31942. [2019-12-27 04:35:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31942 states. [2019-12-27 04:35:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31942 states to 31942 states and 173493 transitions. [2019-12-27 04:35:53,703 INFO L78 Accepts]: Start accepts. Automaton has 31942 states and 173493 transitions. Word has length 21 [2019-12-27 04:35:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:53,703 INFO L462 AbstractCegarLoop]: Abstraction has 31942 states and 173493 transitions. [2019-12-27 04:35:53,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:35:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 31942 states and 173493 transitions. [2019-12-27 04:35:53,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 04:35:53,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:53,704 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:53,704 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-27 04:35:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:53,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932625, now seen corresponding path program 6 times [2019-12-27 04:35:53,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:53,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395174850] [2019-12-27 04:35:53,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 04:35:53,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395174850] [2019-12-27 04:35:53,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:35:53,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:35:53,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914434222] [2019-12-27 04:35:53,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:35:53,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:53,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:35:53,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:35:53,768 INFO L87 Difference]: Start difference. First operand 31942 states and 173493 transitions. Second operand 9 states. [2019-12-27 04:35:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:55,070 INFO L93 Difference]: Finished difference Result 111030 states and 509192 transitions. [2019-12-27 04:35:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:35:55,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 04:35:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:55,389 INFO L225 Difference]: With dead ends: 111030 [2019-12-27 04:35:55,390 INFO L226 Difference]: Without dead ends: 111020 [2019-12-27 04:35:55,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:35:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111020 states. [2019-12-27 04:35:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111020 to 30899. [2019-12-27 04:35:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 04:35:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 04:35:57,605 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 04:35:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:57,605 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 04:35:57,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:35:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 04:35:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:35:57,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:57,606 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:35:57,606 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-27 04:35:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:35:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash -938538387, now seen corresponding path program 1 times [2019-12-27 04:35:57,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:35:57,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961212132] [2019-12-27 04:35:57,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:35:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:57,646 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-27 04:35:57,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961212132] [2019-12-27 04:35:57,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054875743] [2019-12-27 04:35:57,647 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-27 04:35:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:35:57,737 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:35:57,738 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:35:57,816 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-27 04:35:57,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:35:57,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:35:57,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853281418] [2019-12-27 04:35:57,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:35:57,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:35:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:35:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:35:57,817 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 12 states. [2019-12-27 04:35:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:35:58,500 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 04:35:58,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:35:58,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 04:35:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:35:58,721 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 04:35:58,721 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 04:35:58,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:35:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 04:35:59,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 04:35:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 04:35:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 04:35:59,911 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 04:35:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:35:59,911 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 04:35:59,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:35:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 04:35:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:35:59,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:35:59,913 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:36:00,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:00,114 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-27 04:36:00,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:00,114 INFO L82 PathProgramCache]: Analyzing trace with hash -912298617, now seen corresponding path program 1 times [2019-12-27 04:36:00,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:00,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980831445] [2019-12-27 04:36:00,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:00,161 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-27 04:36:00,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980831445] [2019-12-27 04:36:00,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616868136] [2019-12-27 04:36:00,161 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-27 04:36:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:00,253 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:36:00,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:00,305 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-27 04:36:00,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:00,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:36:00,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200498480] [2019-12-27 04:36:00,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:36:00,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:36:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:36:00,307 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 12 states. [2019-12-27 04:36:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:01,326 INFO L93 Difference]: Finished difference Result 77049 states and 375250 transitions. [2019-12-27 04:36:01,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:36:01,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 04:36:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:01,561 INFO L225 Difference]: With dead ends: 77049 [2019-12-27 04:36:01,562 INFO L226 Difference]: Without dead ends: 77035 [2019-12-27 04:36:01,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:36:01,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77035 states. [2019-12-27 04:36:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77035 to 32848. [2019-12-27 04:36:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32848 states. [2019-12-27 04:36:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32848 states to 32848 states and 178265 transitions. [2019-12-27 04:36:02,781 INFO L78 Accepts]: Start accepts. Automaton has 32848 states and 178265 transitions. Word has length 23 [2019-12-27 04:36:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:02,781 INFO L462 AbstractCegarLoop]: Abstraction has 32848 states and 178265 transitions. [2019-12-27 04:36:02,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:36:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 32848 states and 178265 transitions. [2019-12-27 04:36:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:36:02,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:02,783 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:36:02,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:02,984 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-27 04:36:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:02,985 INFO L82 PathProgramCache]: Analyzing trace with hash 475670957, now seen corresponding path program 1 times [2019-12-27 04:36:02,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:02,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486250456] [2019-12-27 04:36:02,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:03,031 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-27 04:36:03,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486250456] [2019-12-27 04:36:03,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546229319] [2019-12-27 04:36:03,032 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-27 04:36:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:03,123 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 04:36:03,124 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:03,178 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-27 04:36:03,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:03,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 04:36:03,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40680192] [2019-12-27 04:36:03,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:36:03,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:36:03,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:36:03,179 INFO L87 Difference]: Start difference. First operand 32848 states and 178265 transitions. Second operand 12 states. [2019-12-27 04:36:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:04,363 INFO L93 Difference]: Finished difference Result 80192 states and 391837 transitions. [2019-12-27 04:36:04,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:36:04,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-12-27 04:36:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:04,628 INFO L225 Difference]: With dead ends: 80192 [2019-12-27 04:36:04,629 INFO L226 Difference]: Without dead ends: 80173 [2019-12-27 04:36:04,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-12-27 04:36:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80173 states. [2019-12-27 04:36:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80173 to 33665. [2019-12-27 04:36:05,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33665 states. [2019-12-27 04:36:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33665 states to 33665 states and 182914 transitions. [2019-12-27 04:36:05,868 INFO L78 Accepts]: Start accepts. Automaton has 33665 states and 182914 transitions. Word has length 23 [2019-12-27 04:36:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:05,868 INFO L462 AbstractCegarLoop]: Abstraction has 33665 states and 182914 transitions. [2019-12-27 04:36:05,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:36:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 33665 states and 182914 transitions. [2019-12-27 04:36:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:36:05,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:05,870 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:36:06,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:06,071 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-27 04:36:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1127986751, now seen corresponding path program 2 times [2019-12-27 04:36:06,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:06,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901735413] [2019-12-27 04:36:06,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:36:06,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901735413] [2019-12-27 04:36:06,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:36:06,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:36:06,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575243747] [2019-12-27 04:36:06,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:36:06,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:06,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:36:06,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:36:06,113 INFO L87 Difference]: Start difference. First operand 33665 states and 182914 transitions. Second operand 7 states. [2019-12-27 04:36:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:06,790 INFO L93 Difference]: Finished difference Result 80956 states and 395965 transitions. [2019-12-27 04:36:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:36:06,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 04:36:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:07,041 INFO L225 Difference]: With dead ends: 80956 [2019-12-27 04:36:07,041 INFO L226 Difference]: Without dead ends: 80937 [2019-12-27 04:36:07,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:36:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80937 states. [2019-12-27 04:36:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80937 to 34532. [2019-12-27 04:36:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34532 states. [2019-12-27 04:36:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34532 states to 34532 states and 187636 transitions. [2019-12-27 04:36:08,767 INFO L78 Accepts]: Start accepts. Automaton has 34532 states and 187636 transitions. Word has length 23 [2019-12-27 04:36:08,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:08,767 INFO L462 AbstractCegarLoop]: Abstraction has 34532 states and 187636 transitions. [2019-12-27 04:36:08,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:36:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 34532 states and 187636 transitions. [2019-12-27 04:36:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:36:08,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:08,770 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:36:08,770 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-27 04:36:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1127974847, now seen corresponding path program 2 times [2019-12-27 04:36:08,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:08,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785374185] [2019-12-27 04:36:08,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:36:08,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785374185] [2019-12-27 04:36:08,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:36:08,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:36:08,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553271064] [2019-12-27 04:36:08,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:36:08,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:08,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:36:08,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:36:08,830 INFO L87 Difference]: Start difference. First operand 34532 states and 187636 transitions. Second operand 7 states. [2019-12-27 04:36:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:09,555 INFO L93 Difference]: Finished difference Result 81082 states and 396008 transitions. [2019-12-27 04:36:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:36:09,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 04:36:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:09,808 INFO L225 Difference]: With dead ends: 81082 [2019-12-27 04:36:09,808 INFO L226 Difference]: Without dead ends: 81063 [2019-12-27 04:36:09,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:36:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81063 states. [2019-12-27 04:36:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81063 to 35153. [2019-12-27 04:36:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35153 states. [2019-12-27 04:36:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35153 states to 35153 states and 191087 transitions. [2019-12-27 04:36:11,707 INFO L78 Accepts]: Start accepts. Automaton has 35153 states and 191087 transitions. Word has length 23 [2019-12-27 04:36:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:11,707 INFO L462 AbstractCegarLoop]: Abstraction has 35153 states and 191087 transitions. [2019-12-27 04:36:11,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:36:11,707 INFO L276 IsEmpty]: Start isEmpty. Operand 35153 states and 191087 transitions. [2019-12-27 04:36:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 04:36:11,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:11,710 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:36:11,710 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-27 04:36:11,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:11,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1127975777, now seen corresponding path program 2 times [2019-12-27 04:36:11,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:11,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870723947] [2019-12-27 04:36:11,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:36:11,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870723947] [2019-12-27 04:36:11,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:36:11,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:36:11,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185198281] [2019-12-27 04:36:11,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:36:11,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:11,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:36:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:36:11,752 INFO L87 Difference]: Start difference. First operand 35153 states and 191087 transitions. Second operand 7 states. [2019-12-27 04:36:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:12,452 INFO L93 Difference]: Finished difference Result 81506 states and 397808 transitions. [2019-12-27 04:36:12,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:36:12,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 04:36:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:12,702 INFO L225 Difference]: With dead ends: 81506 [2019-12-27 04:36:12,702 INFO L226 Difference]: Without dead ends: 81487 [2019-12-27 04:36:12,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:36:12,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81487 states. [2019-12-27 04:36:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81487 to 35912. [2019-12-27 04:36:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 04:36:14,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 04:36:14,612 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 04:36:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:14,612 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 04:36:14,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:36:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 04:36:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:14,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:14,615 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-27 04:36:14,615 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-27 04:36:14,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:14,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2032533234, now seen corresponding path program 1 times [2019-12-27 04:36:14,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:14,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312756812] [2019-12-27 04:36:14,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 04:36:14,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312756812] [2019-12-27 04:36:14,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383854664] [2019-12-27 04:36:14,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:14,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:14,766 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 04:36:14,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:14,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:14,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647850904] [2019-12-27 04:36:14,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:14,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:14,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:14,851 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 16 states. [2019-12-27 04:36:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:16,392 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-27 04:36:16,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:16,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:16,740 INFO L225 Difference]: With dead ends: 119601 [2019-12-27 04:36:16,741 INFO L226 Difference]: Without dead ends: 119591 [2019-12-27 04:36:16,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-27 04:36:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35590. [2019-12-27 04:36:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-12-27 04:36:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 193098 transitions. [2019-12-27 04:36:19,196 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 193098 transitions. Word has length 25 [2019-12-27 04:36:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:19,196 INFO L462 AbstractCegarLoop]: Abstraction has 35590 states and 193098 transitions. [2019-12-27 04:36:19,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 193098 transitions. [2019-12-27 04:36:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:19,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:19,199 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-27 04:36:19,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:19,400 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-27 04:36:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash -644563660, now seen corresponding path program 1 times [2019-12-27 04:36:19,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:19,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076359315] [2019-12-27 04:36:19,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:19,477 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-27 04:36:19,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076359315] [2019-12-27 04:36:19,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706680317] [2019-12-27 04:36:19,477 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-27 04:36:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:19,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:19,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:19,653 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-27 04:36:19,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:19,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:19,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739359900] [2019-12-27 04:36:19,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:19,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:19,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:19,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:19,655 INFO L87 Difference]: Start difference. First operand 35590 states and 193098 transitions. Second operand 16 states. [2019-12-27 04:36:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:21,075 INFO L93 Difference]: Finished difference Result 118371 states and 546721 transitions. [2019-12-27 04:36:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:21,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:21,422 INFO L225 Difference]: With dead ends: 118371 [2019-12-27 04:36:21,422 INFO L226 Difference]: Without dead ends: 118361 [2019-12-27 04:36:21,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118361 states. [2019-12-27 04:36:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118361 to 35384. [2019-12-27 04:36:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35384 states. [2019-12-27 04:36:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35384 states to 35384 states and 191757 transitions. [2019-12-27 04:36:23,800 INFO L78 Accepts]: Start accepts. Automaton has 35384 states and 191757 transitions. Word has length 25 [2019-12-27 04:36:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:23,800 INFO L462 AbstractCegarLoop]: Abstraction has 35384 states and 191757 transitions. [2019-12-27 04:36:23,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 35384 states and 191757 transitions. [2019-12-27 04:36:23,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:23,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:23,804 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-27 04:36:24,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:24,005 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-27 04:36:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash 7752134, now seen corresponding path program 2 times [2019-12-27 04:36:24,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:24,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124968320] [2019-12-27 04:36:24,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:24,063 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-27 04:36:24,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124968320] [2019-12-27 04:36:24,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718022211] [2019-12-27 04:36:24,064 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:24,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:36:24,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:36:24,158 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:24,159 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:24,236 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-27 04:36:24,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:24,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:24,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427903137] [2019-12-27 04:36:24,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:24,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:24,237 INFO L87 Difference]: Start difference. First operand 35384 states and 191757 transitions. Second operand 16 states. [2019-12-27 04:36:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:26,360 INFO L93 Difference]: Finished difference Result 117247 states and 540902 transitions. [2019-12-27 04:36:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:26,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:26,715 INFO L225 Difference]: With dead ends: 117247 [2019-12-27 04:36:26,715 INFO L226 Difference]: Without dead ends: 117236 [2019-12-27 04:36:26,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117236 states. [2019-12-27 04:36:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117236 to 35317. [2019-12-27 04:36:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35317 states. [2019-12-27 04:36:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35317 states to 35317 states and 191252 transitions. [2019-12-27 04:36:28,403 INFO L78 Accepts]: Start accepts. Automaton has 35317 states and 191252 transitions. Word has length 25 [2019-12-27 04:36:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:28,403 INFO L462 AbstractCegarLoop]: Abstraction has 35317 states and 191252 transitions. [2019-12-27 04:36:28,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 35317 states and 191252 transitions. [2019-12-27 04:36:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:28,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:28,406 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-27 04:36:28,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:28,606 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-27 04:36:28,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:28,607 INFO L82 PathProgramCache]: Analyzing trace with hash 7741160, now seen corresponding path program 2 times [2019-12-27 04:36:28,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:28,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417900471] [2019-12-27 04:36:28,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:28,673 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-27 04:36:28,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417900471] [2019-12-27 04:36:28,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84147182] [2019-12-27 04:36:28,674 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:30,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:36:30,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:36:30,852 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:30,853 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:30,929 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-27 04:36:30,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:30,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:30,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513941302] [2019-12-27 04:36:30,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:30,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:30,931 INFO L87 Difference]: Start difference. First operand 35317 states and 191252 transitions. Second operand 16 states. [2019-12-27 04:36:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:32,310 INFO L93 Difference]: Finished difference Result 116261 states and 536103 transitions. [2019-12-27 04:36:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:32,310 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:32,625 INFO L225 Difference]: With dead ends: 116261 [2019-12-27 04:36:32,625 INFO L226 Difference]: Without dead ends: 116250 [2019-12-27 04:36:32,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116250 states. [2019-12-27 04:36:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116250 to 34934. [2019-12-27 04:36:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 04:36:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 04:36:34,562 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 04:36:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:34,562 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 04:36:34,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 04:36:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:34,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:34,565 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-27 04:36:34,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:34,766 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-27 04:36:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash -545632672, now seen corresponding path program 1 times [2019-12-27 04:36:34,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:34,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070245731] [2019-12-27 04:36:34,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:34,817 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-27 04:36:34,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070245731] [2019-12-27 04:36:34,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743336348] [2019-12-27 04:36:34,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:34,912 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:34,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:34,987 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-27 04:36:34,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:34,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:34,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912145513] [2019-12-27 04:36:34,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:34,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:34,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:34,989 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 16 states. [2019-12-27 04:36:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:36,397 INFO L93 Difference]: Finished difference Result 118938 states and 550128 transitions. [2019-12-27 04:36:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:36,397 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:36,727 INFO L225 Difference]: With dead ends: 118938 [2019-12-27 04:36:36,727 INFO L226 Difference]: Without dead ends: 118928 [2019-12-27 04:36:36,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118928 states. [2019-12-27 04:36:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118928 to 35058. [2019-12-27 04:36:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35058 states. [2019-12-27 04:36:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35058 states to 35058 states and 189558 transitions. [2019-12-27 04:36:38,896 INFO L78 Accepts]: Start accepts. Automaton has 35058 states and 189558 transitions. Word has length 25 [2019-12-27 04:36:38,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:38,896 INFO L462 AbstractCegarLoop]: Abstraction has 35058 states and 189558 transitions. [2019-12-27 04:36:38,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 35058 states and 189558 transitions. [2019-12-27 04:36:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:38,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:38,899 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-27 04:36:39,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:39,100 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-27 04:36:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash -545644576, now seen corresponding path program 3 times [2019-12-27 04:36:39,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:39,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072592897] [2019-12-27 04:36:39,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:39,160 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-27 04:36:39,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072592897] [2019-12-27 04:36:39,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167147596] [2019-12-27 04:36:39,161 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:39,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 04:36:39,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:36:39,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:39,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:39,324 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-27 04:36:39,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:39,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:39,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210142074] [2019-12-27 04:36:39,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:39,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:39,326 INFO L87 Difference]: Start difference. First operand 35058 states and 189558 transitions. Second operand 16 states. [2019-12-27 04:36:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:40,714 INFO L93 Difference]: Finished difference Result 117535 states and 542555 transitions. [2019-12-27 04:36:40,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:40,714 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:41,685 INFO L225 Difference]: With dead ends: 117535 [2019-12-27 04:36:41,685 INFO L226 Difference]: Without dead ends: 117525 [2019-12-27 04:36:41,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117525 states. [2019-12-27 04:36:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117525 to 34750. [2019-12-27 04:36:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34750 states. [2019-12-27 04:36:43,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34750 states to 34750 states and 187700 transitions. [2019-12-27 04:36:43,113 INFO L78 Accepts]: Start accepts. Automaton has 34750 states and 187700 transitions. Word has length 25 [2019-12-27 04:36:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:43,113 INFO L462 AbstractCegarLoop]: Abstraction has 34750 states and 187700 transitions. [2019-12-27 04:36:43,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34750 states and 187700 transitions. [2019-12-27 04:36:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:43,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:43,116 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-27 04:36:43,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:43,317 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-27 04:36:43,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:43,317 INFO L82 PathProgramCache]: Analyzing trace with hash -530395552, now seen corresponding path program 2 times [2019-12-27 04:36:43,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:43,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426877224] [2019-12-27 04:36:43,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:43,371 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-27 04:36:43,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426877224] [2019-12-27 04:36:43,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101092098] [2019-12-27 04:36:43,371 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-27 04:36:43,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 04:36:43,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:36:43,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:43,457 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:43,533 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-27 04:36:43,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:43,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:43,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957696198] [2019-12-27 04:36:43,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:43,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:43,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:43,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:43,534 INFO L87 Difference]: Start difference. First operand 34750 states and 187700 transitions. Second operand 16 states. [2019-12-27 04:36:45,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:45,239 INFO L93 Difference]: Finished difference Result 117014 states and 540604 transitions. [2019-12-27 04:36:45,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:45,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:45,570 INFO L225 Difference]: With dead ends: 117014 [2019-12-27 04:36:45,570 INFO L226 Difference]: Without dead ends: 117000 [2019-12-27 04:36:45,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117000 states. [2019-12-27 04:36:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117000 to 34277. [2019-12-27 04:36:46,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-27 04:36:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 184965 transitions. [2019-12-27 04:36:47,072 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 184965 transitions. Word has length 25 [2019-12-27 04:36:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:47,072 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 184965 transitions. [2019-12-27 04:36:47,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 184965 transitions. [2019-12-27 04:36:47,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:47,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:47,074 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-27 04:36:47,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:47,277 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-27 04:36:47,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash -541835296, now seen corresponding path program 4 times [2019-12-27 04:36:47,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:47,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023209017] [2019-12-27 04:36:47,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:47,343 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-27 04:36:47,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023209017] [2019-12-27 04:36:47,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328245692] [2019-12-27 04:36:47,344 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:47,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:36:47,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:36:47,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:47,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:47,948 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-27 04:36:47,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:47,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:47,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862143884] [2019-12-27 04:36:47,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:47,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:47,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:47,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:47,950 INFO L87 Difference]: Start difference. First operand 34277 states and 184965 transitions. Second operand 16 states. [2019-12-27 04:36:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:49,477 INFO L93 Difference]: Finished difference Result 113272 states and 520858 transitions. [2019-12-27 04:36:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:49,478 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:49,781 INFO L225 Difference]: With dead ends: 113272 [2019-12-27 04:36:49,781 INFO L226 Difference]: Without dead ends: 113261 [2019-12-27 04:36:49,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113261 states. [2019-12-27 04:36:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113261 to 33768. [2019-12-27 04:36:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 04:36:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182281 transitions. [2019-12-27 04:36:54,066 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182281 transitions. Word has length 25 [2019-12-27 04:36:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:54,066 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182281 transitions. [2019-12-27 04:36:54,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182281 transitions. [2019-12-27 04:36:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:54,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:54,068 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-27 04:36:54,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:54,271 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-27 04:36:54,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:54,273 INFO L82 PathProgramCache]: Analyzing trace with hash -298046732, now seen corresponding path program 3 times [2019-12-27 04:36:54,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:54,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838379386] [2019-12-27 04:36:54,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:54,362 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-27 04:36:54,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838379386] [2019-12-27 04:36:54,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448214501] [2019-12-27 04:36:54,363 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:54,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:36:54,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:36:54,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:54,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:54,563 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-27 04:36:54,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:54,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:54,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117483187] [2019-12-27 04:36:54,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:54,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:54,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:54,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:54,564 INFO L87 Difference]: Start difference. First operand 33768 states and 182281 transitions. Second operand 16 states. [2019-12-27 04:36:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:36:55,970 INFO L93 Difference]: Finished difference Result 115987 states and 535173 transitions. [2019-12-27 04:36:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:36:55,970 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:36:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:36:56,288 INFO L225 Difference]: With dead ends: 115987 [2019-12-27 04:36:56,289 INFO L226 Difference]: Without dead ends: 115977 [2019-12-27 04:36:56,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:36:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115977 states. [2019-12-27 04:36:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115977 to 33338. [2019-12-27 04:36:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33338 states. [2019-12-27 04:36:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33338 states to 33338 states and 179968 transitions. [2019-12-27 04:36:58,368 INFO L78 Accepts]: Start accepts. Automaton has 33338 states and 179968 transitions. Word has length 25 [2019-12-27 04:36:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:36:58,368 INFO L462 AbstractCegarLoop]: Abstraction has 33338 states and 179968 transitions. [2019-12-27 04:36:58,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:36:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 33338 states and 179968 transitions. [2019-12-27 04:36:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:36:58,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:36:58,371 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-27 04:36:58,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:58,572 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-27 04:36:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:36:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 591228706, now seen corresponding path program 3 times [2019-12-27 04:36:58,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:36:58,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509332470] [2019-12-27 04:36:58,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:36:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:36:58,642 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-27 04:36:58,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509332470] [2019-12-27 04:36:58,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58154844] [2019-12-27 04:36:58,642 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:36:58,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 04:36:58,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:36:58,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:36:58,732 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:36:58,815 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-27 04:36:58,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:36:58,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:36:58,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164848558] [2019-12-27 04:36:58,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:36:58,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:36:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:36:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:36:58,817 INFO L87 Difference]: Start difference. First operand 33338 states and 179968 transitions. Second operand 16 states. [2019-12-27 04:37:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:00,224 INFO L93 Difference]: Finished difference Result 115083 states and 530519 transitions. [2019-12-27 04:37:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:37:00,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:37:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:37:00,540 INFO L225 Difference]: With dead ends: 115083 [2019-12-27 04:37:00,540 INFO L226 Difference]: Without dead ends: 115073 [2019-12-27 04:37:00,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:37:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115073 states. [2019-12-27 04:37:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115073 to 33016. [2019-12-27 04:37:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33016 states. [2019-12-27 04:37:02,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33016 states to 33016 states and 178303 transitions. [2019-12-27 04:37:02,742 INFO L78 Accepts]: Start accepts. Automaton has 33016 states and 178303 transitions. Word has length 25 [2019-12-27 04:37:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:37:02,742 INFO L462 AbstractCegarLoop]: Abstraction has 33016 states and 178303 transitions. [2019-12-27 04:37:02,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:37:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33016 states and 178303 transitions. [2019-12-27 04:37:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:37:02,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:37:02,744 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-27 04:37:02,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:37:02,946 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-27 04:37:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:37:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1853254278, now seen corresponding path program 4 times [2019-12-27 04:37:02,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:37:02,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497976946] [2019-12-27 04:37:02,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:37:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:37:02,999 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-27 04:37:02,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497976946] [2019-12-27 04:37:02,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127973896] [2019-12-27 04:37:03,000 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:37:03,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:37:03,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:37:03,087 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:37:03,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:37:03,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-27 04:37:03,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:37:03,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:37:03,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422820327] [2019-12-27 04:37:03,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:37:03,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:37:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:37:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:37:03,165 INFO L87 Difference]: Start difference. First operand 33016 states and 178303 transitions. Second operand 16 states. [2019-12-27 04:37:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:04,570 INFO L93 Difference]: Finished difference Result 116129 states and 535807 transitions. [2019-12-27 04:37:04,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:37:04,571 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:37:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:37:05,477 INFO L225 Difference]: With dead ends: 116129 [2019-12-27 04:37:05,478 INFO L226 Difference]: Without dead ends: 116115 [2019-12-27 04:37:05,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:37:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116115 states. [2019-12-27 04:37:06,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116115 to 32873. [2019-12-27 04:37:06,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32873 states. [2019-12-27 04:37:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32873 states to 32873 states and 177431 transitions. [2019-12-27 04:37:06,883 INFO L78 Accepts]: Start accepts. Automaton has 32873 states and 177431 transitions. Word has length 25 [2019-12-27 04:37:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:37:06,883 INFO L462 AbstractCegarLoop]: Abstraction has 32873 states and 177431 transitions. [2019-12-27 04:37:06,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:37:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32873 states and 177431 transitions. [2019-12-27 04:37:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:37:06,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:37:06,886 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-27 04:37:07,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:37:07,086 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-27 04:37:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:37:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1853255208, now seen corresponding path program 4 times [2019-12-27 04:37:07,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:37:07,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638752666] [2019-12-27 04:37:07,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:37:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:37:07,145 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-27 04:37:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638752666] [2019-12-27 04:37:07,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033686554] [2019-12-27 04:37:07,146 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:37:07,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 04:37:07,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 04:37:07,230 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 04:37:07,231 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 04:37:07,317 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-27 04:37:07,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 04:37:07,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 04:37:07,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599906673] [2019-12-27 04:37:07,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:37:07,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:37:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:37:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:37:07,319 INFO L87 Difference]: Start difference. First operand 32873 states and 177431 transitions. Second operand 16 states. [2019-12-27 04:37:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:09,135 INFO L93 Difference]: Finished difference Result 115140 states and 530994 transitions. [2019-12-27 04:37:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:37:09,135 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 04:37:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:37:09,456 INFO L225 Difference]: With dead ends: 115140 [2019-12-27 04:37:09,456 INFO L226 Difference]: Without dead ends: 115126 [2019-12-27 04:37:09,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=397, Invalid=1085, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:37:09,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115126 states. [2019-12-27 04:37:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115126 to 32414. [2019-12-27 04:37:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32414 states. [2019-12-27 04:37:10,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32414 states to 32414 states and 174844 transitions. [2019-12-27 04:37:10,909 INFO L78 Accepts]: Start accepts. Automaton has 32414 states and 174844 transitions. Word has length 25 [2019-12-27 04:37:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:37:10,909 INFO L462 AbstractCegarLoop]: Abstraction has 32414 states and 174844 transitions. [2019-12-27 04:37:10,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:37:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 32414 states and 174844 transitions. [2019-12-27 04:37:10,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:37:10,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:37:10,912 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:37:11,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 04:37:11,114 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-27 04:37:11,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:37:11,115 INFO L82 PathProgramCache]: Analyzing trace with hash -2130118454, now seen corresponding path program 1 times [2019-12-27 04:37:11,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:37:11,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443173289] [2019-12-27 04:37:11,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:37:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:37:11,154 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-27 04:37:11,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443173289] [2019-12-27 04:37:11,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:37:11,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:37:11,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965545549] [2019-12-27 04:37:11,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:37:11,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:37:11,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:37:11,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:37:11,156 INFO L87 Difference]: Start difference. First operand 32414 states and 174844 transitions. Second operand 5 states. [2019-12-27 04:37:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:11,773 INFO L93 Difference]: Finished difference Result 57346 states and 297742 transitions. [2019-12-27 04:37:11,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:37:11,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 04:37:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:37:11,936 INFO L225 Difference]: With dead ends: 57346 [2019-12-27 04:37:11,936 INFO L226 Difference]: Without dead ends: 57314 [2019-12-27 04:37:11,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:37:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57314 states. [2019-12-27 04:37:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57314 to 40877. [2019-12-27 04:37:12,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40877 states. [2019-12-27 04:37:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40877 states to 40877 states and 221122 transitions. [2019-12-27 04:37:12,926 INFO L78 Accepts]: Start accepts. Automaton has 40877 states and 221122 transitions. Word has length 25 [2019-12-27 04:37:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:37:12,926 INFO L462 AbstractCegarLoop]: Abstraction has 40877 states and 221122 transitions. [2019-12-27 04:37:12,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:37:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 40877 states and 221122 transitions. [2019-12-27 04:37:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:37:12,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:37:12,929 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-27 04:37:12,929 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-27 04:37:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:37:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1663507096, now seen corresponding path program 5 times [2019-12-27 04:37:12,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:37:12,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55737372] [2019-12-27 04:37:12,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:37:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:37:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:37:12,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55737372] [2019-12-27 04:37:12,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:37:12,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:37:12,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57031068] [2019-12-27 04:37:12,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:37:12,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:37:12,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:37:12,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:37:12,991 INFO L87 Difference]: Start difference. First operand 40877 states and 221122 transitions. Second operand 9 states. [2019-12-27 04:37:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:14,904 INFO L93 Difference]: Finished difference Result 137111 states and 643211 transitions. [2019-12-27 04:37:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:37:14,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:37:14,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:37:15,298 INFO L225 Difference]: With dead ends: 137111 [2019-12-27 04:37:15,298 INFO L226 Difference]: Without dead ends: 137095 [2019-12-27 04:37:15,299 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-27 04:37:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137095 states. [2019-12-27 04:37:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137095 to 40351. [2019-12-27 04:37:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40351 states. [2019-12-27 04:37:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40351 states to 40351 states and 218114 transitions. [2019-12-27 04:37:21,492 INFO L78 Accepts]: Start accepts. Automaton has 40351 states and 218114 transitions. Word has length 25 [2019-12-27 04:37:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:37:21,492 INFO L462 AbstractCegarLoop]: Abstraction has 40351 states and 218114 transitions. [2019-12-27 04:37:21,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:37:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 40351 states and 218114 transitions. [2019-12-27 04:37:21,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:37:21,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:37:21,495 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-27 04:37:21,495 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-27 04:37:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:37:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1663508026, now seen corresponding path program 5 times [2019-12-27 04:37:21,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:37:21,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791651449] [2019-12-27 04:37:21,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:37:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:37:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:37:21,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791651449] [2019-12-27 04:37:21,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:37:21,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:37:21,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871152477] [2019-12-27 04:37:21,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:37:21,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:37:21,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:37:21,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:37:21,555 INFO L87 Difference]: Start difference. First operand 40351 states and 218114 transitions. Second operand 9 states. [2019-12-27 04:37:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:23,005 INFO L93 Difference]: Finished difference Result 135413 states and 634564 transitions. [2019-12-27 04:37:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:37:23,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:37:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:37:23,385 INFO L225 Difference]: With dead ends: 135413 [2019-12-27 04:37:23,386 INFO L226 Difference]: Without dead ends: 135397 [2019-12-27 04:37:23,386 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-27 04:37:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135397 states. [2019-12-27 04:37:25,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135397 to 39763. [2019-12-27 04:37:25,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39763 states. [2019-12-27 04:37:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39763 states to 39763 states and 214832 transitions. [2019-12-27 04:37:25,639 INFO L78 Accepts]: Start accepts. Automaton has 39763 states and 214832 transitions. Word has length 25 [2019-12-27 04:37:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:37:25,640 INFO L462 AbstractCegarLoop]: Abstraction has 39763 states and 214832 transitions. [2019-12-27 04:37:25,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:37:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 39763 states and 214832 transitions. [2019-12-27 04:37:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:37:25,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:37:25,642 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-27 04:37:25,642 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-27 04:37:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:37:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1652079256, now seen corresponding path program 6 times [2019-12-27 04:37:25,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:37:25,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079244469] [2019-12-27 04:37:25,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:37:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:37:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:37:25,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079244469] [2019-12-27 04:37:25,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:37:25,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:37:25,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476292206] [2019-12-27 04:37:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:37:25,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:37:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:37:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:37:25,702 INFO L87 Difference]: Start difference. First operand 39763 states and 214832 transitions. Second operand 9 states. [2019-12-27 04:37:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:27,054 INFO L93 Difference]: Finished difference Result 134367 states and 628945 transitions. [2019-12-27 04:37:27,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:37:27,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:37:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:37:27,426 INFO L225 Difference]: With dead ends: 134367 [2019-12-27 04:37:27,426 INFO L226 Difference]: Without dead ends: 134347 [2019-12-27 04:37:27,426 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-27 04:37:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134347 states. [2019-12-27 04:37:29,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134347 to 38738. [2019-12-27 04:37:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38738 states. [2019-12-27 04:37:29,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38738 states to 38738 states and 209215 transitions. [2019-12-27 04:37:29,881 INFO L78 Accepts]: Start accepts. Automaton has 38738 states and 209215 transitions. Word has length 25 [2019-12-27 04:37:29,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:37:29,882 INFO L462 AbstractCegarLoop]: Abstraction has 38738 states and 209215 transitions. [2019-12-27 04:37:29,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 04:37:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38738 states and 209215 transitions. [2019-12-27 04:37:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:37:29,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:37:29,884 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-27 04:37:29,884 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-27 04:37:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:37:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1652068282, now seen corresponding path program 5 times [2019-12-27 04:37:29,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:37:29,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291625111] [2019-12-27 04:37:29,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:37:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:37:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 04:37:29,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291625111] [2019-12-27 04:37:29,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:37:29,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:37:29,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306096888] [2019-12-27 04:37:29,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 04:37:29,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:37:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 04:37:29,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:37:29,944 INFO L87 Difference]: Start difference. First operand 38738 states and 209215 transitions. Second operand 9 states. [2019-12-27 04:37:31,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:37:31,307 INFO L93 Difference]: Finished difference Result 133134 states and 622505 transitions. [2019-12-27 04:37:31,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:37:31,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 04:37:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. Received shutdown request... [2019-12-27 04:37:32,385 INFO L225 Difference]: With dead ends: 133134 [2019-12-27 04:37:32,385 INFO L226 Difference]: Without dead ends: 133118 [2019-12-27 04:37:32,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:37:32,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133118 states. [2019-12-27 04:37:32,642 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 04:37:32,645 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 04:37:32,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:37:32 BasicIcfg [2019-12-27 04:37:32,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:37:32,647 INFO L168 Benchmark]: Toolchain (without parser) took 230398.74 ms. Allocated memory was 138.4 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 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 04:37:32,647 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 04:37:32,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.04 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 160.6 MB in the end (delta: -59.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:37:32,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.84 ms. Allocated memory is still 202.9 MB. Free memory was 160.6 MB in the beginning and 158.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:37:32,648 INFO L168 Benchmark]: Boogie Preprocessor took 28.35 ms. Allocated memory is still 202.9 MB. Free memory was 158.6 MB in the beginning and 157.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:37:32,648 INFO L168 Benchmark]: RCFGBuilder took 420.78 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 137.5 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2019-12-27 04:37:32,649 INFO L168 Benchmark]: TraceAbstraction took 229189.72 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 137.5 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-12-27 04:37:32,651 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.26 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 702.04 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 160.6 MB in the end (delta: -59.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.84 ms. Allocated memory is still 202.9 MB. Free memory was 160.6 MB in the beginning and 158.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.35 ms. Allocated memory is still 202.9 MB. Free memory was 158.6 MB in the beginning and 157.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 420.78 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 137.5 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 229189.72 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 137.5 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 57 ProgramPointsBefore, 15 ProgramPointsAfterwards, 53 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 6 FixpointIterations, 17 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 326 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 3 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 489 CheckedPairsTotal, 46 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 516 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1034 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 95 ProgramPointsBefore, 34 ProgramPointsAfterwards, 85 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 4 ChoiceCompositions, 625 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1615 CheckedPairsTotal, 69 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.0s, 114 ProgramPointsBefore, 42 ProgramPointsAfterwards, 101 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 5 ChoiceCompositions, 851 VarBasedMoverChecksPositive, 17 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2111 CheckedPairsTotal, 84 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 133 ProgramPointsBefore, 50 ProgramPointsAfterwards, 117 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1089 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2604 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.5s, 152 ProgramPointsBefore, 58 ProgramPointsAfterwards, 133 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1357 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3471 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 675). Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Result: TIMEOUT, OverallTime: 150.0s, OverallIterations: 40, TraceHistogramMax: 5, AutomataDifference: 59.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2486 SDtfs, 12084 SDslu, 9962 SDs, 0 SdLazy, 18040 SolverSat, 979 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1326 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 984 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7116 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40877occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 73.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 2276963 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1364 NumberOfCodeBlocks, 1340 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 1302 ConstructedInterpolants, 0 QuantifiedInterpolants, 188428 SizeOfPredicates, 120 NumberOfNonLiveVariables, 2460 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 62 InterpolantComputations, 18 PerfectInterpolantSequences, 484/860 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