/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:11:05,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:11:05,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:11:05,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:11:05,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:11:05,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:11:05,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:11:05,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:11:05,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:11:05,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:11:05,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:11:05,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:11:05,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:11:05,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:11:05,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:11:05,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:11:05,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:11:05,987 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:11:05,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:11:05,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:11:05,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:11:06,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:11:06,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:11:06,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:11:06,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:11:06,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:11:06,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:11:06,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:11:06,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:11:06,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:11:06,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:11:06,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:11:06,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:11:06,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:11:06,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:11:06,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:11:06,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:11:06,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:11:06,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:11:06,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:11:06,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:11:06,020 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-MCR.epf [2019-12-27 19:11:06,033 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:11:06,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:11:06,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:11:06,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:11:06,035 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:11:06,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:11:06,035 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:11:06,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:11:06,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:11:06,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:11:06,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:11:06,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:11:06,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:11:06,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:11:06,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:11:06,037 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:11:06,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:11:06,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:11:06,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:11:06,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:11:06,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:11:06,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:11:06,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:11:06,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:11:06,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:11:06,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:11:06,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:11:06,039 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:11:06,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:11:06,039 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:11:06,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:11:06,319 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:11:06,335 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:11:06,339 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:11:06,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:11:06,341 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:11:06,343 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 19:11:06,406 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca531f03/856b2371506f45f1aa0c33a42cfdf29b/FLAG1facc406c [2019-12-27 19:11:06,934 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:11:06,935 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-1.i [2019-12-27 19:11:06,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca531f03/856b2371506f45f1aa0c33a42cfdf29b/FLAG1facc406c [2019-12-27 19:11:07,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca531f03/856b2371506f45f1aa0c33a42cfdf29b [2019-12-27 19:11:07,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:11:07,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:11:07,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:11:07,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:11:07,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:11:07,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:07,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@390ade41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07, skipping insertion in model container [2019-12-27 19:11:07,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:07,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:11:07,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:11:07,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:11:07,845 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:11:07,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:11:07,951 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:11:07,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07 WrapperNode [2019-12-27 19:11:07,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:11:07,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:11:07,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:11:07,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:11:07,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:07,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:11:08,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:11:08,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:11:08,021 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:11:08,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (1/1) ... [2019-12-27 19:11:08,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:11:08,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:11:08,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:11:08,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:11:08,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (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 19:11:08,106 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 19:11:08,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 19:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 19:11:08,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 19:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:11:08,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:11:08,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:11:08,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:11:08,111 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 19:11:08,441 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:11:08,442 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 19:11:08,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:11:08 BoogieIcfgContainer [2019-12-27 19:11:08,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:11:08,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:11:08,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:11:08,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:11:08,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:11:07" (1/3) ... [2019-12-27 19:11:08,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343e6454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:11:08, skipping insertion in model container [2019-12-27 19:11:08,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:07" (2/3) ... [2019-12-27 19:11:08,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343e6454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:11:08, skipping insertion in model container [2019-12-27 19:11:08,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:11:08" (3/3) ... [2019-12-27 19:11:08,451 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-1.i [2019-12-27 19:11:08,461 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:11:08,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:11:08,469 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 19:11:08,470 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:11:08,497 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,497 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,497 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,498 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,499 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,499 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,499 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,500 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,500 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,502 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,503 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,503 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,503 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,504 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,504 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,505 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,510 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,510 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,510 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,511 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,511 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,517 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,517 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,518 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,518 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,518 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:08,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 19:11:08,547 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:08,547 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:08,547 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:08,547 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:08,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:08,548 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:08,548 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:08,548 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:08,559 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions [2019-12-27 19:11:08,561 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 19:11:08,605 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 19:11:08,605 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:11:08,612 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 19:11:08,615 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 19:11:08,642 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 19:11:08,642 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:11:08,643 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 19:11:08,646 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2019-12-27 19:11:08,647 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:10,115 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 19:11:10,252 INFO L206 etLargeBlockEncoding]: Checked pairs total: 489 [2019-12-27 19:11:10,252 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-27 19:11:10,256 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 19:11:10,265 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 19:11:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 19:11:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:10,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:10,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:10,275 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:10,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:10,282 INFO L82 PathProgramCache]: Analyzing trace with hash 210014, now seen corresponding path program 1 times [2019-12-27 19:11:10,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:10,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823269228] [2019-12-27 19:11:10,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:10,535 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 19:11:10,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823269228] [2019-12-27 19:11:10,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:10,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:10,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [783786481] [2019-12-27 19:11:10,541 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:10,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:10,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:10,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:10,566 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:10,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:10,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:10,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:10,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:10,585 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 19:11:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:10,626 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 19:11:10,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:10,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:10,640 INFO L225 Difference]: With dead ends: 35 [2019-12-27 19:11:10,640 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 19:11:10,642 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 19:11:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 19:11:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 19:11:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 19:11:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 19:11:10,687 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 19:11:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:10,688 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 19:11:10,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 19:11:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:11:10,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:10,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:10,690 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 647068079, now seen corresponding path program 1 times [2019-12-27 19:11:10,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:10,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334590522] [2019-12-27 19:11:10,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:10,801 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 19:11:10,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334590522] [2019-12-27 19:11:10,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:10,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:11:10,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170377678] [2019-12-27 19:11:10,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:10,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:10,812 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:11:10,812 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:10,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:10,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:11:10,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:11:10,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:11:10,816 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 19:11:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:10,841 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 19:11:10,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:11:10,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 19:11:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:10,844 INFO L225 Difference]: With dead ends: 26 [2019-12-27 19:11:10,844 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 19:11:10,846 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 19:11:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 19:11:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 19:11:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 19:11:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 19:11:10,850 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 19:11:10,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:10,850 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 19:11:10,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:11:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 19:11:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:11:10,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:10,852 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:10,853 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:10,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:10,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1415732781, now seen corresponding path program 1 times [2019-12-27 19:11:10,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:10,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129802029] [2019-12-27 19:11:10,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:10,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:10,946 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:10,946 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:10,947 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 19:11:10,955 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,955 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,955 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,955 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,956 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,956 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,958 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,958 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,958 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,958 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,958 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,959 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,960 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,960 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,960 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,960 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,960 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,960 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,961 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,961 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,961 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,961 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,962 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,962 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,962 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,962 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,962 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,962 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,963 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,963 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,963 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,963 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,964 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,964 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,964 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,964 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,964 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,966 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,966 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,966 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,966 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,966 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,968 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,968 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,968 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,968 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,968 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,969 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,970 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,970 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,970 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,971 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,971 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:10,972 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 19:11:10,972 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:10,973 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:10,973 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:10,973 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:10,973 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:10,973 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:10,973 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:10,973 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:10,976 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 19:11:10,976 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 19:11:11,011 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 19:11:11,011 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:11:11,012 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 19:11:11,019 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 19:11:11,049 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 19:11:11,050 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:11:11,051 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 19:11:11,054 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2019-12-27 19:11:11,054 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:12,359 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 19:11:12,452 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1034 [2019-12-27 19:11:12,452 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 19:11:12,452 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 19:11:12,467 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 19:11:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 19:11:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:12,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:12,468 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:12,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:12,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash 353600, now seen corresponding path program 1 times [2019-12-27 19:11:12,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:12,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447866891] [2019-12-27 19:11:12,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:12,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447866891] [2019-12-27 19:11:12,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:12,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:12,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211834252] [2019-12-27 19:11:12,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:12,514 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:12,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:12,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:12,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:12,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:12,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:12,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:12,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:12,516 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 19:11:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:12,543 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 19:11:12,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:12,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:12,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:12,548 INFO L225 Difference]: With dead ends: 185 [2019-12-27 19:11:12,548 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 19:11:12,548 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 19:11:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 19:11:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 19:11:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 19:11:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 19:11:12,574 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 19:11:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:12,574 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 19:11:12,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 19:11:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:12,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:12,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:12,575 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash -677960350, now seen corresponding path program 1 times [2019-12-27 19:11:12,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:12,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361253139] [2019-12-27 19:11:12,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:12,628 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 19:11:12,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361253139] [2019-12-27 19:11:12,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:12,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:12,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1637386513] [2019-12-27 19:11:12,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:12,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:12,632 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:12,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:12,632 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:12,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:12,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:12,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:12,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:12,633 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 19:11:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:12,732 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 19:11:12,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:12,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:12,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:12,739 INFO L225 Difference]: With dead ends: 204 [2019-12-27 19:11:12,740 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 19:11:12,740 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 19:11:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 19:11:12,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 19:11:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 19:11:12,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 19:11:12,759 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 19:11:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:12,759 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 19:11:12,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 19:11:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:12,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:12,761 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:12,761 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1901960811, now seen corresponding path program 1 times [2019-12-27 19:11:12,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:12,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022079308] [2019-12-27 19:11:12,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:12,816 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 19:11:12,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022079308] [2019-12-27 19:11:12,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:12,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:12,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329066963] [2019-12-27 19:11:12,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:12,818 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:12,820 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:12,820 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:12,821 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:12,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:12,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:12,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:12,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:12,822 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 19:11:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:12,905 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 19:11:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:12,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:12,909 INFO L225 Difference]: With dead ends: 189 [2019-12-27 19:11:12,909 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 19:11:12,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 19:11:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 19:11:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 19:11:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 19:11:12,923 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 19:11:12,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:12,924 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 19:11:12,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 19:11:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:11:12,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:12,926 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:12,926 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:12,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:12,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1166778350, now seen corresponding path program 1 times [2019-12-27 19:11:12,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:12,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715935422] [2019-12-27 19:11:12,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:12,962 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:12,962 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:12,963 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:12,963 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 19:11:12,972 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,973 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,973 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,973 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,973 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,973 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,974 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,974 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,974 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,975 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,975 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,975 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,976 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,976 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,977 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,977 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,978 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,978 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,978 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,979 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,979 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,979 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,980 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,980 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,981 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,981 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,982 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,982 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,983 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,985 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,985 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,985 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,986 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,986 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,987 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,987 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,987 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,987 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,988 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,990 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,992 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,992 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:12,994 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:11:12,994 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:12,994 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:12,994 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:12,995 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:12,995 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:12,995 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:12,995 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:12,995 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:12,997 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 85 transitions [2019-12-27 19:11:12,997 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 19:11:13,015 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 19:11:13,016 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:11:13,017 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 19:11:13,020 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 19:11:13,036 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 19:11:13,037 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:11:13,038 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 19:11:13,041 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2019-12-27 19:11:13,042 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:14,480 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 19:11:14,588 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1615 [2019-12-27 19:11:14,588 INFO L214 etLargeBlockEncoding]: Total number of compositions: 69 [2019-12-27 19:11:14,588 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 19:11:14,612 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 19:11:14,612 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 19:11:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:14,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:14,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:14,613 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 19:11:14,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash 525945, now seen corresponding path program 1 times [2019-12-27 19:11:14,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:14,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924960524] [2019-12-27 19:11:14,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:14,652 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 19:11:14,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924960524] [2019-12-27 19:11:14,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:14,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:14,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [835786987] [2019-12-27 19:11:14,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:14,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:14,656 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:14,656 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:14,656 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:14,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:14,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:14,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:14,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:14,657 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 19:11:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:14,692 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 19:11:14,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:14,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:14,700 INFO L225 Difference]: With dead ends: 600 [2019-12-27 19:11:14,701 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 19:11:14,701 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 19:11:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 19:11:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 19:11:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 19:11:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 19:11:14,745 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 19:11:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:14,745 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 19:11:14,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 19:11:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:14,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:14,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:14,746 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 19:11:14,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2106616436, now seen corresponding path program 1 times [2019-12-27 19:11:14,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:14,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801183180] [2019-12-27 19:11:14,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:14,803 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 19:11:14,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801183180] [2019-12-27 19:11:14,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:14,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:14,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1672682788] [2019-12-27 19:11:14,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:14,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:14,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:14,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:14,806 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:14,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:14,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:14,807 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 19:11:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:14,905 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 19:11:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:14,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:14,913 INFO L225 Difference]: With dead ends: 802 [2019-12-27 19:11:14,913 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 19:11:14,914 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 19:11:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 19:11:14,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 19:11:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 19:11:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 19:11:14,940 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 19:11:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:14,941 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 19:11:14,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 19:11:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:14,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:14,943 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:14,943 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 19:11:14,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:14,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1813947824, now seen corresponding path program 1 times [2019-12-27 19:11:14,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:14,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117296152] [2019-12-27 19:11:14,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:15,006 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 19:11:15,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117296152] [2019-12-27 19:11:15,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:15,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:15,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1409183556] [2019-12-27 19:11:15,011 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:15,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:15,015 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:15,015 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:15,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:15,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:15,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:15,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:15,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:15,018 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 19:11:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:15,103 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 19:11:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:15,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:15,110 INFO L225 Difference]: With dead ends: 832 [2019-12-27 19:11:15,110 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 19:11:15,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 19:11:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 19:11:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 19:11:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 19:11:15,132 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 19:11:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:15,133 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 19:11:15,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 19:11:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:15,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:15,134 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:15,134 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 19:11:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:15,135 INFO L82 PathProgramCache]: Analyzing trace with hash -693557262, now seen corresponding path program 1 times [2019-12-27 19:11:15,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:15,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757369623] [2019-12-27 19:11:15,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:15,211 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 19:11:15,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757369623] [2019-12-27 19:11:15,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457844509] [2019-12-27 19:11:15,212 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 19:11:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:15,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:15,294 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:15,372 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 19:11:15,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:15,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:15,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1940600677] [2019-12-27 19:11:15,373 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:15,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:15,378 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:11:15,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:15,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:15,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:15,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:15,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:15,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:15,412 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-27 19:11:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:15,897 INFO L93 Difference]: Finished difference Result 1125 states and 2921 transitions. [2019-12-27 19:11:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:15,898 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 19:11:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:15,906 INFO L225 Difference]: With dead ends: 1125 [2019-12-27 19:11:15,907 INFO L226 Difference]: Without dead ends: 1120 [2019-12-27 19:11:15,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-27 19:11:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 587. [2019-12-27 19:11:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 19:11:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 19:11:15,937 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 19:11:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:15,938 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 19:11:15,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 19:11:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:15,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:15,940 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:16,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:16,145 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 19:11:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash -552862538, now seen corresponding path program 2 times [2019-12-27 19:11:16,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:16,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764544611] [2019-12-27 19:11:16,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:16,209 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 19:11:16,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764544611] [2019-12-27 19:11:16,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:16,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:16,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [352678605] [2019-12-27 19:11:16,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:16,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:16,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:11:16,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:16,216 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:16,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:16,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:16,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:16,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:16,217 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 19:11:16,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:16,492 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 19:11:16,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:16,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:11:16,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:16,500 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 19:11:16,500 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 19:11:16,501 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 19:11:16,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 19:11:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 19:11:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 19:11:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 19:11:16,522 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 19:11:16,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:16,522 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 19:11:16,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:16,522 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 19:11:16,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:11:16,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:16,523 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:16,524 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 19:11:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:16,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1197543999, now seen corresponding path program 1 times [2019-12-27 19:11:16,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:16,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62770942] [2019-12-27 19:11:16,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:16,572 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 19:11:16,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62770942] [2019-12-27 19:11:16,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:16,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:16,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [192614728] [2019-12-27 19:11:16,573 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:16,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:16,578 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:11:16,578 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:16,579 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:16,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:16,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:16,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:16,580 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 19:11:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:16,659 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 19:11:16,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:16,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:11:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:16,665 INFO L225 Difference]: With dead ends: 736 [2019-12-27 19:11:16,665 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 19:11:16,665 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 19:11:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 19:11:16,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 19:11:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 19:11:16,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 19:11:16,682 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 19:11:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 19:11:16,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 19:11:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:11:16,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:16,684 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:16,684 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 19:11:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1527881090, now seen corresponding path program 1 times [2019-12-27 19:11:16,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:16,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336123860] [2019-12-27 19:11:16,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:16,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:16,733 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:16,733 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:16,733 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 19:11:16,748 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,748 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,748 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,749 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,749 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,749 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,749 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,749 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,750 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,750 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,750 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,750 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,750 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,750 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,751 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,751 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,751 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,751 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,751 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,751 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,752 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,752 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,752 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,753 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,753 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,753 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,754 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,754 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,754 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,755 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,755 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,755 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,755 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,756 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,756 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,756 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,756 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,757 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,757 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,757 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,757 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,757 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,757 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,758 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,758 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,759 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,759 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,759 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,760 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,760 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,760 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,760 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,761 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,762 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,762 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,762 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,762 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,764 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,764 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,764 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,765 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,765 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,767 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,767 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,767 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,768 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,768 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,769 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,769 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,770 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,770 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,772 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,772 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,772 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,772 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,773 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,773 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,775 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,775 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,775 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,775 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,776 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,778 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,778 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,779 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,779 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:16,781 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 19:11:16,781 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:16,781 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:16,781 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:16,782 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:16,782 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:16,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:16,782 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:16,782 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:16,784 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 101 transitions [2019-12-27 19:11:16,784 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 19:11:16,804 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 19:11:16,804 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:11:16,806 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 19:11:16,810 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 19:11:16,831 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 19:11:16,832 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:11:16,833 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 19:11:16,838 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2019-12-27 19:11:16,838 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:18,376 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-12-27 19:11:18,611 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2111 [2019-12-27 19:11:18,611 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 19:11:18,611 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 19:11:18,724 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 19:11:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 19:11:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:18,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:18,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:18,726 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 19:11:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash 729974, now seen corresponding path program 1 times [2019-12-27 19:11:18,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:18,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864360090] [2019-12-27 19:11:18,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:18,743 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 19:11:18,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864360090] [2019-12-27 19:11:18,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:18,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:18,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1407560606] [2019-12-27 19:11:18,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:18,745 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:18,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:18,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:18,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:18,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:18,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:18,746 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 19:11:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:18,804 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 19:11:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:18,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:18,824 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 19:11:18,824 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 19:11:18,824 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 19:11:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 19:11:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 19:11:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 19:11:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 19:11:18,900 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 19:11:18,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:18,901 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 19:11:18,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:18,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 19:11:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:18,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:18,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:18,902 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 19:11:18,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:18,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1449000874, now seen corresponding path program 1 times [2019-12-27 19:11:18,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:18,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40261754] [2019-12-27 19:11:18,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:18,936 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 19:11:18,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40261754] [2019-12-27 19:11:18,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:18,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:18,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761474395] [2019-12-27 19:11:18,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:18,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:18,939 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:18,939 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:18,940 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:18,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:18,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:18,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:18,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:18,941 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 19:11:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:19,040 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 19:11:19,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:19,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:19,062 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 19:11:19,062 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 19:11:19,062 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 19:11:19,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 19:11:19,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 19:11:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 19:11:19,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 19:11:19,142 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 19:11:19,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:19,142 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 19:11:19,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 19:11:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:19,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:19,143 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:19,144 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 19:11:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:19,144 INFO L82 PathProgramCache]: Analyzing trace with hash 302089454, now seen corresponding path program 1 times [2019-12-27 19:11:19,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:19,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77305470] [2019-12-27 19:11:19,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:19,186 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 19:11:19,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77305470] [2019-12-27 19:11:19,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:19,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:19,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503061089] [2019-12-27 19:11:19,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:19,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:19,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:19,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:19,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:19,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:19,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:19,192 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 19:11:19,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:19,322 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 19:11:19,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:19,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:19,358 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 19:11:19,358 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 19:11:19,358 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 19:11:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 19:11:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 19:11:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 19:11:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 19:11:19,443 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 19:11:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:19,446 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 19:11:19,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:19,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 19:11:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:19,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:19,447 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:19,448 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 19:11:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005855, now seen corresponding path program 1 times [2019-12-27 19:11:19,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:19,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350257439] [2019-12-27 19:11:19,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:19,521 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 19:11:19,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350257439] [2019-12-27 19:11:19,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971083134] [2019-12-27 19:11:19,522 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 19:11:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:19,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:19,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:19,684 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 19:11:19,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:19,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:19,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2055597255] [2019-12-27 19:11:19,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:19,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:19,691 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:11:19,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:19,727 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:19,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:19,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:19,729 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-27 19:11:20,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:20,216 INFO L93 Difference]: Finished difference Result 4795 states and 15556 transitions. [2019-12-27 19:11:20,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:20,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 19:11:20,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:20,248 INFO L225 Difference]: With dead ends: 4795 [2019-12-27 19:11:20,248 INFO L226 Difference]: Without dead ends: 4790 [2019-12-27 19:11:20,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2019-12-27 19:11:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 2109. [2019-12-27 19:11:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 19:11:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 19:11:20,354 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 19:11:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:20,354 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 19:11:20,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 19:11:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:20,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:20,355 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:20,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:20,559 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 19:11:20,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:20,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825449, now seen corresponding path program 2 times [2019-12-27 19:11:20,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:20,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654988888] [2019-12-27 19:11:20,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:20,641 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 19:11:20,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654988888] [2019-12-27 19:11:20,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:20,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:20,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [66857243] [2019-12-27 19:11:20,642 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:20,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:20,649 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:11:20,649 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:20,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:20,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:20,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:20,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:20,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:20,650 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 19:11:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:20,903 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 19:11:20,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:20,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:11:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:20,923 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 19:11:20,923 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 19:11:20,924 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 19:11:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 19:11:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 19:11:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 19:11:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 19:11:21,014 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 19:11:21,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:21,014 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 19:11:21,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:21,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 19:11:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:11:21,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:21,015 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:21,015 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 19:11:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:21,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1726909890, now seen corresponding path program 1 times [2019-12-27 19:11:21,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:21,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970866285] [2019-12-27 19:11:21,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:21,057 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 19:11:21,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970866285] [2019-12-27 19:11:21,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:21,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:21,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [596755875] [2019-12-27 19:11:21,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:21,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:21,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:11:21,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:21,062 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:21,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:21,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:21,063 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 19:11:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:21,172 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 19:11:21,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:21,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:11:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:21,185 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 19:11:21,185 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 19:11:21,186 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 19:11:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 19:11:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 19:11:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 19:11:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 19:11:21,262 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 19:11:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:21,263 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 19:11:21,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 19:11:21,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:21,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:21,264 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:21,265 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 19:11:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:21,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2140493091, now seen corresponding path program 1 times [2019-12-27 19:11:21,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:21,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370049350] [2019-12-27 19:11:21,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:21,346 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 19:11:21,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370049350] [2019-12-27 19:11:21,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222305926] [2019-12-27 19:11:21,347 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 19:11:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:21,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:21,423 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:21,491 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 19:11:21,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:21,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:21,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1303057731] [2019-12-27 19:11:21,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:21,494 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:21,498 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 19:11:21,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:21,555 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:21,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:11:21,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:21,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:11:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:21,556 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 10 states. [2019-12-27 19:11:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:22,094 INFO L93 Difference]: Finished difference Result 5135 states and 16723 transitions. [2019-12-27 19:11:22,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:22,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 19:11:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:22,108 INFO L225 Difference]: With dead ends: 5135 [2019-12-27 19:11:22,108 INFO L226 Difference]: Without dead ends: 5126 [2019-12-27 19:11:22,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:11:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2019-12-27 19:11:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2270. [2019-12-27 19:11:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 19:11:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 19:11:22,200 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 19:11:22,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:22,201 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 19:11:22,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:11:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 19:11:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:22,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:22,205 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:22,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:22,410 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 19:11:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1012596352, now seen corresponding path program 1 times [2019-12-27 19:11:22,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:22,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251707882] [2019-12-27 19:11:22,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:22,472 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 19:11:22,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251707882] [2019-12-27 19:11:22,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94049245] [2019-12-27 19:11:22,474 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 19:11:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:22,555 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:22,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:22,645 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 19:11:22,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:22,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:22,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233375228] [2019-12-27 19:11:22,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:22,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:22,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 19:11:22,653 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:22,699 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:22,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:22,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:22,700 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-27 19:11:23,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:23,230 INFO L93 Difference]: Finished difference Result 5272 states and 17168 transitions. [2019-12-27 19:11:23,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:23,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 19:11:23,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:23,244 INFO L225 Difference]: With dead ends: 5272 [2019-12-27 19:11:23,245 INFO L226 Difference]: Without dead ends: 5259 [2019-12-27 19:11:23,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:23,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-12-27 19:11:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 2267. [2019-12-27 19:11:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 19:11:23,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 19:11:23,379 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 19:11:23,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:23,379 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 19:11:23,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:23,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 19:11:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:23,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:23,381 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:23,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:23,584 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 19:11:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1703029164, now seen corresponding path program 2 times [2019-12-27 19:11:23,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:23,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574425521] [2019-12-27 19:11:23,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:23,649 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 19:11:23,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574425521] [2019-12-27 19:11:23,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:23,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:23,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2133169276] [2019-12-27 19:11:23,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:23,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:23,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:11:23,659 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:23,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:23,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:23,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:23,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:23,662 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 19:11:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:23,985 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 19:11:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:23,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:11:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:24,002 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 19:11:24,002 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 19:11:24,003 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 19:11:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 19:11:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 19:11:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 19:11:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 19:11:24,081 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 19:11:24,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:24,082 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 19:11:24,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 19:11:24,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:24,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:24,083 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:24,083 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 19:11:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1703042649, now seen corresponding path program 2 times [2019-12-27 19:11:24,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:24,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025855432] [2019-12-27 19:11:24,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:24,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 19:11:24,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025855432] [2019-12-27 19:11:24,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:24,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:24,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [516323556] [2019-12-27 19:11:24,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:24,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:24,146 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:11:24,146 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:24,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:24,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:24,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:24,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:24,148 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 19:11:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:24,486 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 19:11:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:24,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:11:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:24,502 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 19:11:24,502 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 19:11:24,503 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 19:11:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 19:11:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 19:11:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 19:11:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 19:11:24,574 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 19:11:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:24,574 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 19:11:24,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 19:11:24,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:24,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:24,576 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 19:11:24,576 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 19:11:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash 269937843, now seen corresponding path program 1 times [2019-12-27 19:11:24,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:24,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337141853] [2019-12-27 19:11:24,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:24,667 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 19:11:24,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337141853] [2019-12-27 19:11:24,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092090849] [2019-12-27 19:11:24,668 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 19:11:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:24,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:24,779 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:24,879 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 19:11:24,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:24,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:24,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [256595406] [2019-12-27 19:11:24,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:24,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:24,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 19:11:24,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:25,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:11:25,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:11:25,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:11:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:11:25,038 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 19:11:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:27,092 INFO L93 Difference]: Finished difference Result 6643 states and 19902 transitions. [2019-12-27 19:11:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:11:27,092 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 19:11:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:27,123 INFO L225 Difference]: With dead ends: 6643 [2019-12-27 19:11:27,124 INFO L226 Difference]: Without dead ends: 6636 [2019-12-27 19:11:27,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=4676, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 19:11:27,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2019-12-27 19:11:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 2101. [2019-12-27 19:11:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 19:11:27,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 19:11:27,215 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 19:11:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:27,216 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 19:11:27,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:11:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 19:11:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:27,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:27,218 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 19:11:27,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:27,430 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 19:11:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:27,430 INFO L82 PathProgramCache]: Analyzing trace with hash 275473203, now seen corresponding path program 2 times [2019-12-27 19:11:27,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:27,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824989880] [2019-12-27 19:11:27,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:27,501 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 19:11:27,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824989880] [2019-12-27 19:11:27,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412771031] [2019-12-27 19:11:27,501 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 19:11:27,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:11:27,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:11:27,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:27,581 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:27,691 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 19:11:27,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:27,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:27,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1996469943] [2019-12-27 19:11:27,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:27,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:27,700 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:11:27,700 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:27,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:27,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:11:27,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:27,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:11:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:11:27,768 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 12 states. [2019-12-27 19:11:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:28,978 INFO L93 Difference]: Finished difference Result 6356 states and 19271 transitions. [2019-12-27 19:11:28,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:11:28,979 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 19:11:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:28,992 INFO L225 Difference]: With dead ends: 6356 [2019-12-27 19:11:28,993 INFO L226 Difference]: Without dead ends: 6347 [2019-12-27 19:11:28,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=628, Invalid=2564, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:11:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2019-12-27 19:11:29,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 2071. [2019-12-27 19:11:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 19:11:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 19:11:29,083 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 19:11:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:29,083 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 19:11:29,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:11:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 19:11:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:29,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:29,085 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:29,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:29,289 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 19:11:29,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1870977495, now seen corresponding path program 3 times [2019-12-27 19:11:29,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:29,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772425845] [2019-12-27 19:11:29,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:29,370 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 19:11:29,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772425845] [2019-12-27 19:11:29,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309395313] [2019-12-27 19:11:29,370 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 19:11:29,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:11:29,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:11:29,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:29,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:29,567 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 19:11:29,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:29,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:29,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [794443001] [2019-12-27 19:11:29,568 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:29,570 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:29,576 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:11:29,576 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:29,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:11:29,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:11:29,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:11:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:11:29,685 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 15 states. [2019-12-27 19:11:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:31,613 INFO L93 Difference]: Finished difference Result 6519 states and 19507 transitions. [2019-12-27 19:11:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:11:31,613 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-27 19:11:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:31,623 INFO L225 Difference]: With dead ends: 6519 [2019-12-27 19:11:31,623 INFO L226 Difference]: Without dead ends: 6512 [2019-12-27 19:11:31,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1135, Invalid=4565, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:11:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2019-12-27 19:11:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 1997. [2019-12-27 19:11:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 19:11:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 19:11:31,708 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 19:11:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:31,709 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 19:11:31,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:11:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 19:11:31,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:31,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:31,720 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 19:11:31,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:31,927 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 19:11:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:31,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1852496535, now seen corresponding path program 4 times [2019-12-27 19:11:31,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:31,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754874267] [2019-12-27 19:11:31,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:32,029 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 19:11:32,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754874267] [2019-12-27 19:11:32,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313212005] [2019-12-27 19:11:32,029 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 19:11:32,108 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:11:32,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:11:32,109 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:32,110 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:32,222 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 19:11:32,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:32,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:32,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1641328813] [2019-12-27 19:11:32,223 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:32,225 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:32,232 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 19:11:32,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:32,269 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:32,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:11:32,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:32,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:11:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:11:32,270 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-27 19:11:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:33,615 INFO L93 Difference]: Finished difference Result 6273 states and 19028 transitions. [2019-12-27 19:11:33,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:11:33,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 19:11:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:33,628 INFO L225 Difference]: With dead ends: 6273 [2019-12-27 19:11:33,628 INFO L226 Difference]: Without dead ends: 6264 [2019-12-27 19:11:33,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=594, Invalid=2486, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:11:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-12-27 19:11:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 1967. [2019-12-27 19:11:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 19:11:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 19:11:33,701 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 19:11:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:33,702 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 19:11:33,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:11:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 19:11:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:33,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:33,703 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:33,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:33,916 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:33,916 INFO L82 PathProgramCache]: Analyzing trace with hash -748339188, now seen corresponding path program 1 times [2019-12-27 19:11:33,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:33,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146247064] [2019-12-27 19:11:33,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:33,954 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 19:11:33,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146247064] [2019-12-27 19:11:33,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:33,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:33,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1301348819] [2019-12-27 19:11:33,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:33,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:33,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:33,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:33,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:33,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:33,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:33,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:33,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:33,961 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 19:11:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:34,074 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 19:11:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:34,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 19:11:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:34,083 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 19:11:34,083 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 19:11:34,083 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 19:11:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 19:11:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 19:11:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 19:11:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 19:11:34,150 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 19:11:34,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:34,150 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 19:11:34,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 19:11:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:34,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:34,153 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 19:11:34,154 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 19:11:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash -228501443, now seen corresponding path program 5 times [2019-12-27 19:11:34,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:34,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507837272] [2019-12-27 19:11:34,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:34,229 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 19:11:34,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507837272] [2019-12-27 19:11:34,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:34,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:34,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1730744400] [2019-12-27 19:11:34,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:34,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:34,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:34,236 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:34,236 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:34,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:34,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:34,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:34,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:11:34,239 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 19:11:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:34,916 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 19:11:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:11:34,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:11:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:34,929 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 19:11:34,929 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 19:11:34,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:11:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 19:11:34,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 19:11:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 19:11:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 19:11:35,011 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 19:11:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:35,011 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 19:11:35,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 19:11:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:35,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:35,013 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 19:11:35,013 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 19:11:35,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:35,014 INFO L82 PathProgramCache]: Analyzing trace with hash -241447043, now seen corresponding path program 6 times [2019-12-27 19:11:35,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:35,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381464320] [2019-12-27 19:11:35,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:35,075 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 19:11:35,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381464320] [2019-12-27 19:11:35,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:35,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:35,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941477925] [2019-12-27 19:11:35,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:35,078 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:35,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:35,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:35,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:35,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:35,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:35,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:35,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:11:35,085 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 19:11:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:35,738 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 19:11:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:11:35,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:11:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:35,747 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 19:11:35,748 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 19:11:35,748 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 19:11:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 19:11:35,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 19:11:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 19:11:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 19:11:35,820 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 19:11:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:35,821 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 19:11:35,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 19:11:35,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:11:35,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:35,823 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:35,823 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 19:11:35,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:35,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1727522141, now seen corresponding path program 1 times [2019-12-27 19:11:35,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:35,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388447346] [2019-12-27 19:11:35,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:35,848 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:35,848 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:35,848 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:35,848 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 19:11:35,862 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,862 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,862 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,862 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,863 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,863 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,864 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,865 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,865 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,866 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,866 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,867 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,867 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,867 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,867 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,867 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,867 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,867 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,868 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,868 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,868 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,868 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,868 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,868 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,868 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,869 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,869 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,870 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,870 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,871 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,871 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,871 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,872 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,872 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,872 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,872 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,872 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,872 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,873 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,873 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,873 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,873 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,873 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,873 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,873 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,874 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,874 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,874 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,874 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,874 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,874 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,874 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,875 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,875 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,875 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,875 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,875 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,875 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,875 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,876 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,876 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,876 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,877 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,877 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,877 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,877 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,878 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,879 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,879 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,879 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,879 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,879 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,880 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,881 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,881 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,881 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,881 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,882 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,882 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,882 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,882 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,883 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,883 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,884 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,884 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,886 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,886 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,887 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,887 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,888 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,888 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,889 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,889 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,890 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,890 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,891 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,891 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,892 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,892 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:35,893 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 19:11:35,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:35,894 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:35,894 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:35,894 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:35,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:35,894 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:35,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:35,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:35,895 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 117 transitions [2019-12-27 19:11:35,898 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 19:11:35,922 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 19:11:35,922 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:11:35,925 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 19:11:35,932 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 19:11:35,954 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 19:11:35,954 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:11:35,957 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 19:11:35,964 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2019-12-27 19:11:35,964 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:37,427 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 19:11:37,651 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2604 [2019-12-27 19:11:37,651 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 19:11:37,651 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 19:11:37,907 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 19:11:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 19:11:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:37,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:37,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:37,908 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 19:11:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 963853, now seen corresponding path program 1 times [2019-12-27 19:11:37,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:37,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411817178] [2019-12-27 19:11:37,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:37,929 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 19:11:37,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411817178] [2019-12-27 19:11:37,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:37,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:37,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087481535] [2019-12-27 19:11:37,930 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:37,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:37,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:37,931 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:37,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:37,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:37,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:37,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:37,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:37,932 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 19:11:37,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:37,993 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 19:11:37,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:37,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:37,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:38,010 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 19:11:38,010 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 19:11:38,010 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 19:11:38,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 19:11:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 19:11:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 19:11:38,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 19:11:38,146 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 19:11:38,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:38,146 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 19:11:38,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:38,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 19:11:38,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:38,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:38,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:38,147 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 19:11:38,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 91439009, now seen corresponding path program 1 times [2019-12-27 19:11:38,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:38,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300925806] [2019-12-27 19:11:38,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:38,288 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 19:11:38,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300925806] [2019-12-27 19:11:38,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:38,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:38,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [793207993] [2019-12-27 19:11:38,289 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:38,290 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:38,291 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:38,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:38,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:38,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:38,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:38,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:38,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:38,292 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 19:11:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:38,430 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 19:11:38,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:38,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:38,451 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 19:11:38,451 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 19:11:38,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 19:11:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 19:11:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 19:11:38,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 19:11:38,592 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 19:11:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:38,592 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 19:11:38,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 19:11:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:38,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:38,593 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:38,593 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 19:11:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:38,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1001063187, now seen corresponding path program 1 times [2019-12-27 19:11:38,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:38,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353745048] [2019-12-27 19:11:38,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:38,623 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 19:11:38,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353745048] [2019-12-27 19:11:38,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:38,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:38,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [295229819] [2019-12-27 19:11:38,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:38,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:38,625 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:38,625 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:38,625 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:38,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:38,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:38,626 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 19:11:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:38,772 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 19:11:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:38,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:38,808 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 19:11:38,808 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 19:11:38,808 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 19:11:38,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 19:11:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 19:11:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 19:11:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 19:11:39,048 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 19:11:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:39,049 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 19:11:39,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 19:11:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:39,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:39,050 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:39,050 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 19:11:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1798371701, now seen corresponding path program 1 times [2019-12-27 19:11:39,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:39,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675251779] [2019-12-27 19:11:39,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:39,095 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 19:11:39,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675251779] [2019-12-27 19:11:39,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249697732] [2019-12-27 19:11:39,096 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 19:11:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:39,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:39,185 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:39,320 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 19:11:39,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:39,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:39,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157474096] [2019-12-27 19:11:39,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:39,322 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:39,323 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:11:39,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:39,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:39,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:39,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:39,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:39,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:39,356 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-27 19:11:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:39,948 INFO L93 Difference]: Finished difference Result 17481 states and 68797 transitions. [2019-12-27 19:11:39,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:39,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 19:11:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:40,004 INFO L225 Difference]: With dead ends: 17481 [2019-12-27 19:11:40,004 INFO L226 Difference]: Without dead ends: 17476 [2019-12-27 19:11:40,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:40,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17476 states. [2019-12-27 19:11:40,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17476 to 7067. [2019-12-27 19:11:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 19:11:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 19:11:40,226 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 19:11:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:40,227 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 19:11:40,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 19:11:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:40,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:40,227 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:40,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:40,428 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 19:11:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:40,429 INFO L82 PathProgramCache]: Analyzing trace with hash -50954293, now seen corresponding path program 2 times [2019-12-27 19:11:40,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:40,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459828535] [2019-12-27 19:11:40,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:40,474 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 19:11:40,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459828535] [2019-12-27 19:11:40,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:40,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:40,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241341398] [2019-12-27 19:11:40,475 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:40,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:40,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:11:40,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:40,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:40,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:40,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:40,479 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 19:11:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:40,827 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 19:11:40,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:40,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:11:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:41,549 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 19:11:41,549 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 19:11:41,550 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 19:11:41,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 19:11:41,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 19:11:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 19:11:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 19:11:41,727 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 19:11:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:41,727 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 19:11:41,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 19:11:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:11:41,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:41,728 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:41,728 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 19:11:41,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:41,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2086390321, now seen corresponding path program 1 times [2019-12-27 19:11:41,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:41,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922052733] [2019-12-27 19:11:41,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:41,773 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 19:11:41,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922052733] [2019-12-27 19:11:41,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:41,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:41,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1896030511] [2019-12-27 19:11:41,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:41,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:41,779 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:11:41,779 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:41,779 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:41,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:41,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:41,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:41,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:41,780 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 19:11:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:41,915 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 19:11:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:41,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:11:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:41,944 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 19:11:41,944 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 19:11:41,944 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 19:11:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 19:11:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 19:11:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 19:11:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 19:11:42,124 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 19:11:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:42,124 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 19:11:42,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 19:11:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:42,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:42,126 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:42,126 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 19:11:42,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:42,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2036081631, now seen corresponding path program 1 times [2019-12-27 19:11:42,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:42,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884108848] [2019-12-27 19:11:42,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:42,168 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 19:11:42,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884108848] [2019-12-27 19:11:42,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303516991] [2019-12-27 19:11:42,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:11:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:42,258 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:42,259 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:42,327 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 19:11:42,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:42,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:42,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1850241147] [2019-12-27 19:11:42,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:42,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:42,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 19:11:42,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:42,395 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:42,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:11:42,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:42,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:11:42,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:42,397 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 10 states. [2019-12-27 19:11:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:43,080 INFO L93 Difference]: Finished difference Result 20047 states and 79810 transitions. [2019-12-27 19:11:43,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:43,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 19:11:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:43,125 INFO L225 Difference]: With dead ends: 20047 [2019-12-27 19:11:43,125 INFO L226 Difference]: Without dead ends: 20038 [2019-12-27 19:11:43,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:11:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20038 states. [2019-12-27 19:11:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20038 to 8204. [2019-12-27 19:11:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 19:11:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 19:11:43,369 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 19:11:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:43,369 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 19:11:43,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:11:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 19:11:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:43,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:43,370 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:43,570 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:43,571 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 19:11:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -728631447, now seen corresponding path program 2 times [2019-12-27 19:11:43,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:43,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684828905] [2019-12-27 19:11:43,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:43,631 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 19:11:43,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684828905] [2019-12-27 19:11:43,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:43,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:43,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [436581356] [2019-12-27 19:11:43,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:43,634 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:43,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:11:43,637 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:43,637 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:43,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:43,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:43,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:43,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:43,638 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 19:11:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:43,973 INFO L93 Difference]: Finished difference Result 18912 states and 76848 transitions. [2019-12-27 19:11:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:43,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:11:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:44,014 INFO L225 Difference]: With dead ends: 18912 [2019-12-27 19:11:44,014 INFO L226 Difference]: Without dead ends: 18903 [2019-12-27 19:11:44,014 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 19:11:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-12-27 19:11:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 7911. [2019-12-27 19:11:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7911 states. [2019-12-27 19:11:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 36783 transitions. [2019-12-27 19:11:44,363 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 36783 transitions. Word has length 19 [2019-12-27 19:11:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:44,363 INFO L462 AbstractCegarLoop]: Abstraction has 7911 states and 36783 transitions. [2019-12-27 19:11:44,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 36783 transitions. [2019-12-27 19:11:44,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:44,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:44,365 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:44,365 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 19:11:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:44,366 INFO L82 PathProgramCache]: Analyzing trace with hash -728623232, now seen corresponding path program 1 times [2019-12-27 19:11:44,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:44,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562316982] [2019-12-27 19:11:44,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:44,423 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 19:11:44,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562316982] [2019-12-27 19:11:44,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:44,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:44,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1316165063] [2019-12-27 19:11:44,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:44,426 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:44,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:11:44,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:44,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:44,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:44,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:44,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:44,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:44,430 INFO L87 Difference]: Start difference. First operand 7911 states and 36783 transitions. Second operand 7 states. [2019-12-27 19:11:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:44,781 INFO L93 Difference]: Finished difference Result 18895 states and 76839 transitions. [2019-12-27 19:11:44,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:44,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:11:44,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:44,821 INFO L225 Difference]: With dead ends: 18895 [2019-12-27 19:11:44,821 INFO L226 Difference]: Without dead ends: 18886 [2019-12-27 19:11:44,822 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 19:11:44,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18886 states. [2019-12-27 19:11:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18886 to 8150. [2019-12-27 19:11:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8150 states. [2019-12-27 19:11:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 37871 transitions. [2019-12-27 19:11:45,058 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 37871 transitions. Word has length 19 [2019-12-27 19:11:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:45,058 INFO L462 AbstractCegarLoop]: Abstraction has 8150 states and 37871 transitions. [2019-12-27 19:11:45,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:45,058 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 37871 transitions. [2019-12-27 19:11:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:45,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:45,059 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:45,059 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 19:11:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash -718028672, now seen corresponding path program 2 times [2019-12-27 19:11:45,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:45,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712293254] [2019-12-27 19:11:45,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:45,123 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 19:11:45,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712293254] [2019-12-27 19:11:45,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:45,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:45,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1567503806] [2019-12-27 19:11:45,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:45,125 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:45,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 19:11:45,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:45,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:45,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:11:45,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:45,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:11:45,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:11:45,185 INFO L87 Difference]: Start difference. First operand 8150 states and 37871 transitions. Second operand 11 states. [2019-12-27 19:11:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:46,099 INFO L93 Difference]: Finished difference Result 21439 states and 84534 transitions. [2019-12-27 19:11:46,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:11:46,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 19:11:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:46,144 INFO L225 Difference]: With dead ends: 21439 [2019-12-27 19:11:46,144 INFO L226 Difference]: Without dead ends: 21426 [2019-12-27 19:11:46,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2019-12-27 19:11:46,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21426 states. [2019-12-27 19:11:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21426 to 8107. [2019-12-27 19:11:46,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 19:11:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 19:11:46,399 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 19:11:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:46,400 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 19:11:46,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:11:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 19:11:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:46,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:46,401 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 19:11:46,401 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 19:11:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1830634066, now seen corresponding path program 1 times [2019-12-27 19:11:46,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:46,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596429664] [2019-12-27 19:11:46,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:46,489 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 19:11:46,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596429664] [2019-12-27 19:11:46,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614571687] [2019-12-27 19:11:46,490 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 19:11:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:46,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:46,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:46,666 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 19:11:46,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:46,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:46,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1915041637] [2019-12-27 19:11:46,667 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:46,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:46,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:11:46,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:46,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:46,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:11:46,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:46,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:11:46,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:11:46,748 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 12 states. [2019-12-27 19:11:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:48,348 INFO L93 Difference]: Finished difference Result 28620 states and 106676 transitions. [2019-12-27 19:11:48,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:11:48,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 19:11:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:48,411 INFO L225 Difference]: With dead ends: 28620 [2019-12-27 19:11:48,412 INFO L226 Difference]: Without dead ends: 28613 [2019-12-27 19:11:48,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:11:48,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28613 states. [2019-12-27 19:11:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28613 to 8003. [2019-12-27 19:11:48,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-12-27 19:11:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 37166 transitions. [2019-12-27 19:11:48,718 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 37166 transitions. Word has length 21 [2019-12-27 19:11:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:48,718 INFO L462 AbstractCegarLoop]: Abstraction has 8003 states and 37166 transitions. [2019-12-27 19:11:48,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:11:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 37166 transitions. [2019-12-27 19:11:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:48,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:48,720 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 19:11:48,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:48,920 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 19:11:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1820039506, now seen corresponding path program 2 times [2019-12-27 19:11:48,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:48,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392707052] [2019-12-27 19:11:48,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:48,979 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 19:11:48,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392707052] [2019-12-27 19:11:48,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991342288] [2019-12-27 19:11:48,979 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 19:11:49,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:11:49,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:11:49,061 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:49,062 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:49,141 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 19:11:49,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:49,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:49,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [627313260] [2019-12-27 19:11:49,142 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:49,144 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:49,149 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 19:11:49,149 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:49,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:11:49,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:11:49,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:49,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:11:49,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:11:49,277 INFO L87 Difference]: Start difference. First operand 8003 states and 37166 transitions. Second operand 16 states. [2019-12-27 19:11:51,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:51,459 INFO L93 Difference]: Finished difference Result 29191 states and 107449 transitions. [2019-12-27 19:11:51,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:11:51,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 19:11:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:51,522 INFO L225 Difference]: With dead ends: 29191 [2019-12-27 19:11:51,522 INFO L226 Difference]: Without dead ends: 29182 [2019-12-27 19:11:51,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1255, Invalid=4597, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 19:11:51,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29182 states. [2019-12-27 19:11:51,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29182 to 7893. [2019-12-27 19:11:51,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 19:11:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 19:11:51,831 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 19:11:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:51,832 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 19:11:51,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:11:51,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 19:11:51,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:51,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:51,833 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 19:11:52,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:52,036 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 19:11:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash -135145800, now seen corresponding path program 3 times [2019-12-27 19:11:52,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:52,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697794687] [2019-12-27 19:11:52,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:52,101 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 19:11:52,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697794687] [2019-12-27 19:11:52,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:52,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:52,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424653756] [2019-12-27 19:11:52,102 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:52,103 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:52,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:52,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:52,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:52,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:52,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:52,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:11:52,107 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-27 19:11:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:52,891 INFO L93 Difference]: Finished difference Result 26136 states and 99362 transitions. [2019-12-27 19:11:52,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:11:52,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:11:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:52,950 INFO L225 Difference]: With dead ends: 26136 [2019-12-27 19:11:52,950 INFO L226 Difference]: Without dead ends: 26132 [2019-12-27 19:11:52,951 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 19:11:53,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26132 states. [2019-12-27 19:11:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26132 to 7683. [2019-12-27 19:11:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-12-27 19:11:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 35650 transitions. [2019-12-27 19:11:53,412 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 35650 transitions. Word has length 21 [2019-12-27 19:11:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:53,412 INFO L462 AbstractCegarLoop]: Abstraction has 7683 states and 35650 transitions. [2019-12-27 19:11:53,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 35650 transitions. [2019-12-27 19:11:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:53,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:53,414 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 19:11:53,414 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 19:11:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -127259400, now seen corresponding path program 4 times [2019-12-27 19:11:53,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:53,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658219698] [2019-12-27 19:11:53,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:53,482 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 19:11:53,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658219698] [2019-12-27 19:11:53,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:53,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:53,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897605058] [2019-12-27 19:11:53,483 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:53,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:53,489 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:53,489 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:53,490 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:53,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:53,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:53,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:53,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:11:53,490 INFO L87 Difference]: Start difference. First operand 7683 states and 35650 transitions. Second operand 9 states. [2019-12-27 19:11:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:54,251 INFO L93 Difference]: Finished difference Result 25967 states and 98669 transitions. [2019-12-27 19:11:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:11:54,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:11:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:54,311 INFO L225 Difference]: With dead ends: 25967 [2019-12-27 19:11:54,311 INFO L226 Difference]: Without dead ends: 25961 [2019-12-27 19:11:54,311 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 19:11:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2019-12-27 19:11:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 7577. [2019-12-27 19:11:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2019-12-27 19:11:54,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 35112 transitions. [2019-12-27 19:11:54,580 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 35112 transitions. Word has length 21 [2019-12-27 19:11:54,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:54,581 INFO L462 AbstractCegarLoop]: Abstraction has 7577 states and 35112 transitions. [2019-12-27 19:11:54,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 35112 transitions. [2019-12-27 19:11:54,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:54,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:54,582 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:54,582 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 19:11:54,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:54,584 INFO L82 PathProgramCache]: Analyzing trace with hash 980776630, now seen corresponding path program 1 times [2019-12-27 19:11:54,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:54,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300516143] [2019-12-27 19:11:54,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:54,642 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 19:11:54,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300516143] [2019-12-27 19:11:54,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:54,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:54,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754248363] [2019-12-27 19:11:54,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:54,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:54,648 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:54,648 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:54,648 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:54,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:54,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:54,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:54,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:54,649 INFO L87 Difference]: Start difference. First operand 7577 states and 35112 transitions. Second operand 5 states. [2019-12-27 19:11:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:54,789 INFO L93 Difference]: Finished difference Result 12960 states and 56912 transitions. [2019-12-27 19:11:54,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:54,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 19:11:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:54,818 INFO L225 Difference]: With dead ends: 12960 [2019-12-27 19:11:54,818 INFO L226 Difference]: Without dead ends: 12944 [2019-12-27 19:11:54,819 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 19:11:54,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-27 19:11:55,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 9056. [2019-12-27 19:11:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-12-27 19:11:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 41951 transitions. [2019-12-27 19:11:55,185 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 41951 transitions. Word has length 21 [2019-12-27 19:11:55,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:55,185 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 41951 transitions. [2019-12-27 19:11:55,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 41951 transitions. [2019-12-27 19:11:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:55,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:55,186 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 19:11:55,186 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 19:11:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:55,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1464178168, now seen corresponding path program 5 times [2019-12-27 19:11:55,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:55,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923089301] [2019-12-27 19:11:55,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:55,261 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 19:11:55,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923089301] [2019-12-27 19:11:55,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:55,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:55,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1530373801] [2019-12-27 19:11:55,262 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:55,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:55,269 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 19:11:55,269 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:55,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:55,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:11:55,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:55,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:11:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:11:55,323 INFO L87 Difference]: Start difference. First operand 9056 states and 41951 transitions. Second operand 13 states. [2019-12-27 19:11:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:57,289 INFO L93 Difference]: Finished difference Result 33065 states and 123155 transitions. [2019-12-27 19:11:57,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 19:11:57,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 19:11:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:57,360 INFO L225 Difference]: With dead ends: 33065 [2019-12-27 19:11:57,360 INFO L226 Difference]: Without dead ends: 33052 [2019-12-27 19:11:57,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 19:11:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33052 states. [2019-12-27 19:11:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33052 to 8780. [2019-12-27 19:11:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2019-12-27 19:11:57,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 40645 transitions. [2019-12-27 19:11:57,724 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 40645 transitions. Word has length 21 [2019-12-27 19:11:57,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:57,724 INFO L462 AbstractCegarLoop]: Abstraction has 8780 states and 40645 transitions. [2019-12-27 19:11:57,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:11:57,724 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 40645 transitions. [2019-12-27 19:11:57,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:57,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:57,726 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 19:11:57,726 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 19:11:57,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:57,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1466886328, now seen corresponding path program 6 times [2019-12-27 19:11:57,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:57,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618496663] [2019-12-27 19:11:57,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:57,780 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 19:11:57,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618496663] [2019-12-27 19:11:57,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:57,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:57,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1692122651] [2019-12-27 19:11:57,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:57,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:57,789 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:11:57,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:57,935 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:11:57,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:11:57,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:57,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:11:57,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:11:57,936 INFO L87 Difference]: Start difference. First operand 8780 states and 40645 transitions. Second operand 17 states. [2019-12-27 19:12:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:00,933 INFO L93 Difference]: Finished difference Result 33893 states and 124131 transitions. [2019-12-27 19:12:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 19:12:00,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 19:12:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:01,004 INFO L225 Difference]: With dead ends: 33893 [2019-12-27 19:12:01,004 INFO L226 Difference]: Without dead ends: 33877 [2019-12-27 19:12:01,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3258 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 19:12:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33877 states. [2019-12-27 19:12:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33877 to 8405. [2019-12-27 19:12:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 19:12:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 19:12:01,364 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 19:12:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:01,364 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 19:12:01,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:12:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 19:12:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:01,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:01,366 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:01,366 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 19:12:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash 792940754, now seen corresponding path program 1 times [2019-12-27 19:12:01,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:01,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23481501] [2019-12-27 19:12:01,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:01,423 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 19:12:01,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23481501] [2019-12-27 19:12:01,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216974989] [2019-12-27 19:12:01,424 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 19:12:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:01,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:12:01,499 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:01,564 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 19:12:01,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:01,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:12:01,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970073041] [2019-12-27 19:12:01,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:01,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:01,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 19:12:01,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:01,718 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:01,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:12:01,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:12:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:12:01,719 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 11 states. [2019-12-27 19:12:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:02,296 INFO L93 Difference]: Finished difference Result 21073 states and 84547 transitions. [2019-12-27 19:12:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:12:02,296 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 19:12:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:02,340 INFO L225 Difference]: With dead ends: 21073 [2019-12-27 19:12:02,340 INFO L226 Difference]: Without dead ends: 21054 [2019-12-27 19:12:02,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:12:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21054 states. [2019-12-27 19:12:02,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21054 to 8674. [2019-12-27 19:12:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 19:12:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 19:12:02,593 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 19:12:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:02,593 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 19:12:02,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:12:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 19:12:02,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:02,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:02,595 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:02,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:02,799 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 19:12:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:02,799 INFO L82 PathProgramCache]: Analyzing trace with hash 568712663, now seen corresponding path program 1 times [2019-12-27 19:12:02,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:02,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611150878] [2019-12-27 19:12:02,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:02,851 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 19:12:02,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611150878] [2019-12-27 19:12:02,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041660135] [2019-12-27 19:12:02,852 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 19:12:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:02,925 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:12:02,926 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:02,989 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 19:12:02,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:02,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:12:02,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161015261] [2019-12-27 19:12:02,990 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:02,992 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:02,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 19:12:02,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:03,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:12:03,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:03,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:03,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:03,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:12:03,024 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 9 states. [2019-12-27 19:12:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:03,610 INFO L93 Difference]: Finished difference Result 22123 states and 88756 transitions. [2019-12-27 19:12:03,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:12:03,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-27 19:12:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:03,661 INFO L225 Difference]: With dead ends: 22123 [2019-12-27 19:12:03,661 INFO L226 Difference]: Without dead ends: 22101 [2019-12-27 19:12:03,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:12:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22101 states. [2019-12-27 19:12:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22101 to 8934. [2019-12-27 19:12:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 19:12:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 41293 transitions. [2019-12-27 19:12:03,937 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 41293 transitions. Word has length 23 [2019-12-27 19:12:03,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:03,937 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 41293 transitions. [2019-12-27 19:12:03,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:03,937 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 41293 transitions. [2019-12-27 19:12:03,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:03,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:03,940 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:04,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:04,143 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 19:12:04,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1942317765, now seen corresponding path program 1 times [2019-12-27 19:12:04,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:04,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093304644] [2019-12-27 19:12:04,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:04,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093304644] [2019-12-27 19:12:04,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:04,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:04,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002750920] [2019-12-27 19:12:04,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:04,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:04,202 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 19:12:04,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:04,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:12:04,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:12:04,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:12:04,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:12:04,308 INFO L87 Difference]: Start difference. First operand 8934 states and 41293 transitions. Second operand 13 states. [2019-12-27 19:12:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:05,135 INFO L93 Difference]: Finished difference Result 23819 states and 94551 transitions. [2019-12-27 19:12:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:12:05,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 19:12:05,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:05,186 INFO L225 Difference]: With dead ends: 23819 [2019-12-27 19:12:05,186 INFO L226 Difference]: Without dead ends: 23790 [2019-12-27 19:12:05,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=742, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:12:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23790 states. [2019-12-27 19:12:05,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23790 to 9143. [2019-12-27 19:12:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 19:12:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-27 19:12:05,452 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-27 19:12:05,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:05,454 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-27 19:12:05,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:12:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-27 19:12:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:05,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:05,456 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:05,456 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 19:12:05,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:05,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1928498089, now seen corresponding path program 2 times [2019-12-27 19:12:05,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:05,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762942770] [2019-12-27 19:12:05,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:05,500 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 19:12:05,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762942770] [2019-12-27 19:12:05,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:05,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:05,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1142831225] [2019-12-27 19:12:05,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:05,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:05,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:12:05,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:05,506 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:05,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:05,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:05,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:05,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:05,507 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 7 states. [2019-12-27 19:12:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:05,884 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-27 19:12:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:05,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:12:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:05,930 INFO L225 Difference]: With dead ends: 21118 [2019-12-27 19:12:05,930 INFO L226 Difference]: Without dead ends: 21099 [2019-12-27 19:12:05,931 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 19:12:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-27 19:12:06,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-27 19:12:06,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 19:12:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-27 19:12:06,183 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-27 19:12:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:06,183 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-27 19:12:06,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-27 19:12:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:06,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:06,186 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:06,186 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 19:12:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1928500910, now seen corresponding path program 2 times [2019-12-27 19:12:06,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:06,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118371569] [2019-12-27 19:12:06,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:06,242 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 19:12:06,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118371569] [2019-12-27 19:12:06,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:06,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:06,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019125363] [2019-12-27 19:12:06,243 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:06,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:06,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:12:06,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:06,250 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:06,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:06,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:06,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:06,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:06,251 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 7 states. [2019-12-27 19:12:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:06,596 INFO L93 Difference]: Finished difference Result 20904 states and 85935 transitions. [2019-12-27 19:12:06,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:06,596 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:12:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:06,643 INFO L225 Difference]: With dead ends: 20904 [2019-12-27 19:12:06,643 INFO L226 Difference]: Without dead ends: 20885 [2019-12-27 19:12:06,644 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 19:12:06,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20885 states. [2019-12-27 19:12:06,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20885 to 9243. [2019-12-27 19:12:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-27 19:12:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-27 19:12:06,909 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-27 19:12:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:06,910 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-27 19:12:06,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-27 19:12:06,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:06,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:06,912 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:06,912 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 19:12:06,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:06,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1928509125, now seen corresponding path program 2 times [2019-12-27 19:12:06,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:06,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856978985] [2019-12-27 19:12:06,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:06,965 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 19:12:06,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856978985] [2019-12-27 19:12:06,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:06,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:06,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1342320459] [2019-12-27 19:12:06,966 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:06,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:06,974 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:12:06,974 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:06,975 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:06,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:06,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:06,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:06,976 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 7 states. [2019-12-27 19:12:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:07,437 INFO L93 Difference]: Finished difference Result 20784 states and 85269 transitions. [2019-12-27 19:12:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:07,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:12:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:07,486 INFO L225 Difference]: With dead ends: 20784 [2019-12-27 19:12:07,486 INFO L226 Difference]: Without dead ends: 20765 [2019-12-27 19:12:07,486 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 19:12:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20765 states. [2019-12-27 19:12:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20765 to 9286. [2019-12-27 19:12:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 19:12:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 19:12:07,753 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 19:12:07,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:07,753 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 19:12:07,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 19:12:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:07,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:07,756 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:07,756 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 19:12:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1810061765, now seen corresponding path program 1 times [2019-12-27 19:12:07,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:07,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277399487] [2019-12-27 19:12:07,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:07,811 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 19:12:07,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277399487] [2019-12-27 19:12:07,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942403662] [2019-12-27 19:12:07,812 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 19:12:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:07,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:07,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:07,985 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 19:12:07,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:07,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:07,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1089800252] [2019-12-27 19:12:07,986 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:07,989 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:07,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:12:07,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:08,144 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 19:12:08,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:12:08,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:08,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:12:08,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:12:08,145 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 17 states. [2019-12-27 19:12:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:10,143 INFO L93 Difference]: Finished difference Result 33531 states and 124595 transitions. [2019-12-27 19:12:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:10,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 19:12:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:10,216 INFO L225 Difference]: With dead ends: 33531 [2019-12-27 19:12:10,216 INFO L226 Difference]: Without dead ends: 33513 [2019-12-27 19:12:10,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1297, Invalid=4709, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 19:12:10,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33513 states. [2019-12-27 19:12:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33513 to 9208. [2019-12-27 19:12:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9208 states. [2019-12-27 19:12:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 42351 transitions. [2019-12-27 19:12:10,810 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 42351 transitions. Word has length 25 [2019-12-27 19:12:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:10,811 INFO L462 AbstractCegarLoop]: Abstraction has 9208 states and 42351 transitions. [2019-12-27 19:12:10,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:12:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 42351 transitions. [2019-12-27 19:12:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:10,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:10,814 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 19:12:11,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:11,014 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 19:12:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1820667361, now seen corresponding path program 1 times [2019-12-27 19:12:11,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:11,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755067992] [2019-12-27 19:12:11,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:11,070 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 19:12:11,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755067992] [2019-12-27 19:12:11,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811411123] [2019-12-27 19:12:11,071 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 19:12:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:11,145 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:11,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:11,231 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 19:12:11,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:11,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:11,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1251133928] [2019-12-27 19:12:11,232 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:11,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:11,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 19:12:11,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:11,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 19:12:11,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:12:11,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:11,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:12:11,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:12:11,460 INFO L87 Difference]: Start difference. First operand 9208 states and 42351 transitions. Second operand 19 states. [2019-12-27 19:12:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:13,507 INFO L93 Difference]: Finished difference Result 33056 states and 122674 transitions. [2019-12-27 19:12:13,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:13,508 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 19:12:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:13,574 INFO L225 Difference]: With dead ends: 33056 [2019-12-27 19:12:13,575 INFO L226 Difference]: Without dead ends: 33038 [2019-12-27 19:12:13,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1403, Invalid=4917, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 19:12:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33038 states. [2019-12-27 19:12:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33038 to 9154. [2019-12-27 19:12:13,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-12-27 19:12:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 42049 transitions. [2019-12-27 19:12:13,921 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 42049 transitions. Word has length 25 [2019-12-27 19:12:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:13,921 INFO L462 AbstractCegarLoop]: Abstraction has 9154 states and 42049 transitions. [2019-12-27 19:12:13,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:12:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 42049 transitions. [2019-12-27 19:12:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:13,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:13,924 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 19:12:14,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:14,125 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 19:12:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1806847685, now seen corresponding path program 2 times [2019-12-27 19:12:14,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:14,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831389267] [2019-12-27 19:12:14,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:14,200 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 19:12:14,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831389267] [2019-12-27 19:12:14,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975090472] [2019-12-27 19:12:14,201 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 19:12:14,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:12:14,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:14,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:14,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:14,443 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 19:12:14,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:14,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:14,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410598149] [2019-12-27 19:12:14,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:14,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:14,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:12:14,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:14,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:14,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:12:14,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:12:14,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:12:14,587 INFO L87 Difference]: Start difference. First operand 9154 states and 42049 transitions. Second operand 13 states. [2019-12-27 19:12:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:16,182 INFO L93 Difference]: Finished difference Result 31510 states and 118366 transitions. [2019-12-27 19:12:16,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:16,183 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 19:12:16,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:16,246 INFO L225 Difference]: With dead ends: 31510 [2019-12-27 19:12:16,247 INFO L226 Difference]: Without dead ends: 31491 [2019-12-27 19:12:16,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=717, Invalid=2589, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 19:12:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31491 states. [2019-12-27 19:12:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31491 to 9151. [2019-12-27 19:12:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-27 19:12:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 41998 transitions. [2019-12-27 19:12:16,598 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 41998 transitions. Word has length 25 [2019-12-27 19:12:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:16,599 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 41998 transitions. [2019-12-27 19:12:16,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:12:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 41998 transitions. [2019-12-27 19:12:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:16,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:16,602 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 19:12:16,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:16,802 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 19:12:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:16,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1806858721, now seen corresponding path program 2 times [2019-12-27 19:12:16,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:16,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946392879] [2019-12-27 19:12:16,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:16,862 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 19:12:16,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946392879] [2019-12-27 19:12:16,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16473742] [2019-12-27 19:12:16,863 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 19:12:16,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:12:16,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:16,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:16,935 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:17,026 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 19:12:17,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:17,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:17,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810349104] [2019-12-27 19:12:17,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:17,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:17,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:12:17,040 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:17,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:17,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:12:17,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:12:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:12:17,139 INFO L87 Difference]: Start difference. First operand 9151 states and 41998 transitions. Second operand 13 states. [2019-12-27 19:12:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:18,483 INFO L93 Difference]: Finished difference Result 31144 states and 116954 transitions. [2019-12-27 19:12:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:18,483 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 19:12:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:18,547 INFO L225 Difference]: With dead ends: 31144 [2019-12-27 19:12:18,547 INFO L226 Difference]: Without dead ends: 31125 [2019-12-27 19:12:18,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=717, Invalid=2589, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 19:12:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31125 states. [2019-12-27 19:12:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31125 to 9044. [2019-12-27 19:12:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 19:12:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 19:12:18,882 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 19:12:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:18,882 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 19:12:18,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:12:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 19:12:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:18,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:18,885 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 19:12:19,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:19,086 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 19:12:19,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:19,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1077942095, now seen corresponding path program 3 times [2019-12-27 19:12:19,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:19,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418650128] [2019-12-27 19:12:19,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:19,153 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 19:12:19,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418650128] [2019-12-27 19:12:19,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356014905] [2019-12-27 19:12:19,153 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 19:12:19,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:12:19,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:19,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:19,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:19,322 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 19:12:19,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:19,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:19,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [894764117] [2019-12-27 19:12:19,323 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:19,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:19,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:12:19,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:19,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:19,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:12:19,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:19,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:12:19,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:12:19,421 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 15 states. [2019-12-27 19:12:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:21,555 INFO L93 Difference]: Finished difference Result 32342 states and 119750 transitions. [2019-12-27 19:12:21,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:21,555 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:12:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:21,620 INFO L225 Difference]: With dead ends: 32342 [2019-12-27 19:12:21,620 INFO L226 Difference]: Without dead ends: 32324 [2019-12-27 19:12:21,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1214, Invalid=4486, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:12:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32324 states. [2019-12-27 19:12:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32324 to 8878. [2019-12-27 19:12:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-27 19:12:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 40685 transitions. [2019-12-27 19:12:21,955 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 40685 transitions. Word has length 25 [2019-12-27 19:12:21,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:21,956 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 40685 transitions. [2019-12-27 19:12:21,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:12:21,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 40685 transitions. [2019-12-27 19:12:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:21,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:21,959 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:22,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:22,159 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 19:12:22,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:22,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1085836710, now seen corresponding path program 1 times [2019-12-27 19:12:22,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:22,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373955572] [2019-12-27 19:12:22,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:22,220 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 19:12:22,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373955572] [2019-12-27 19:12:22,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776980632] [2019-12-27 19:12:22,221 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 19:12:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:22,297 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:22,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:22,383 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 19:12:22,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:22,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:22,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205711990] [2019-12-27 19:12:22,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:22,387 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:22,395 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:12:22,395 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:22,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:22,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:12:22,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:22,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:12:22,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:12:22,503 INFO L87 Difference]: Start difference. First operand 8878 states and 40685 transitions. Second operand 15 states. [2019-12-27 19:12:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:24,651 INFO L93 Difference]: Finished difference Result 32735 states and 121625 transitions. [2019-12-27 19:12:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:24,652 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:12:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:24,721 INFO L225 Difference]: With dead ends: 32735 [2019-12-27 19:12:24,721 INFO L226 Difference]: Without dead ends: 32717 [2019-12-27 19:12:24,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1214, Invalid=4486, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:12:24,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32717 states. [2019-12-27 19:12:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32717 to 8860. [2019-12-27 19:12:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2019-12-27 19:12:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 40559 transitions. [2019-12-27 19:12:25,208 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 40559 transitions. Word has length 25 [2019-12-27 19:12:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:25,208 INFO L462 AbstractCegarLoop]: Abstraction has 8860 states and 40559 transitions. [2019-12-27 19:12:25,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:12:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 40559 transitions. [2019-12-27 19:12:25,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:25,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:25,211 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 19:12:25,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:25,412 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 19:12:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1072019855, now seen corresponding path program 4 times [2019-12-27 19:12:25,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:25,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102546512] [2019-12-27 19:12:25,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:25,480 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 19:12:25,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102546512] [2019-12-27 19:12:25,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482205470] [2019-12-27 19:12:25,481 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 19:12:25,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:12:25,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:25,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:25,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:25,650 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 19:12:25,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:25,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:25,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170644729] [2019-12-27 19:12:25,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:25,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:25,660 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 19:12:25,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:25,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:12:25,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:12:25,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:25,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:12:25,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:12:25,689 INFO L87 Difference]: Start difference. First operand 8860 states and 40559 transitions. Second operand 11 states. [2019-12-27 19:12:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:27,079 INFO L93 Difference]: Finished difference Result 31097 states and 116701 transitions. [2019-12-27 19:12:27,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:27,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 19:12:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:27,144 INFO L225 Difference]: With dead ends: 31097 [2019-12-27 19:12:27,144 INFO L226 Difference]: Without dead ends: 31078 [2019-12-27 19:12:27,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2432, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:12:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31078 states. [2019-12-27 19:12:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31078 to 8857. [2019-12-27 19:12:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2019-12-27 19:12:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 40508 transitions. [2019-12-27 19:12:27,474 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 40508 transitions. Word has length 25 [2019-12-27 19:12:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:27,474 INFO L462 AbstractCegarLoop]: Abstraction has 8857 states and 40508 transitions. [2019-12-27 19:12:27,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:12:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 40508 transitions. [2019-12-27 19:12:27,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:27,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:27,478 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 19:12:27,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:27,678 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 19:12:27,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1072028070, now seen corresponding path program 2 times [2019-12-27 19:12:27,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:27,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208928207] [2019-12-27 19:12:27,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:27,748 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 19:12:27,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208928207] [2019-12-27 19:12:27,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520744904] [2019-12-27 19:12:27,749 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 19:12:27,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:12:27,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:27,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:27,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:27,913 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 19:12:27,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:27,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:27,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1941762630] [2019-12-27 19:12:27,914 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:27,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:27,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 19:12:27,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:27,950 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:12:27,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:12:27,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:12:27,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:12:27,951 INFO L87 Difference]: Start difference. First operand 8857 states and 40508 transitions. Second operand 11 states. [2019-12-27 19:12:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:29,384 INFO L93 Difference]: Finished difference Result 30950 states and 116337 transitions. [2019-12-27 19:12:29,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:29,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 19:12:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:29,451 INFO L225 Difference]: With dead ends: 30950 [2019-12-27 19:12:29,451 INFO L226 Difference]: Without dead ends: 30927 [2019-12-27 19:12:29,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2432, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:12:29,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30927 states. [2019-12-27 19:12:29,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30927 to 8722. [2019-12-27 19:12:29,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 19:12:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39857 transitions. [2019-12-27 19:12:30,012 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39857 transitions. Word has length 25 [2019-12-27 19:12:30,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:30,012 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39857 transitions. [2019-12-27 19:12:30,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:12:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39857 transitions. [2019-12-27 19:12:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:30,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:30,016 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:30,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:30,217 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 19:12:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2071430200, now seen corresponding path program 1 times [2019-12-27 19:12:30,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:30,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952083005] [2019-12-27 19:12:30,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:30,251 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 19:12:30,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952083005] [2019-12-27 19:12:30,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:30,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:12:30,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052223980] [2019-12-27 19:12:30,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:30,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:30,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:30,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:30,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:30,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:12:30,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:30,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:12:30,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:12:30,261 INFO L87 Difference]: Start difference. First operand 8722 states and 39857 transitions. Second operand 5 states. [2019-12-27 19:12:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:30,424 INFO L93 Difference]: Finished difference Result 14188 states and 62117 transitions. [2019-12-27 19:12:30,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:12:30,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:12:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:30,455 INFO L225 Difference]: With dead ends: 14188 [2019-12-27 19:12:30,455 INFO L226 Difference]: Without dead ends: 14156 [2019-12-27 19:12:30,455 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 19:12:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-27 19:12:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 10325. [2019-12-27 19:12:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10325 states. [2019-12-27 19:12:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 46869 transitions. [2019-12-27 19:12:30,661 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 46869 transitions. Word has length 25 [2019-12-27 19:12:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:30,661 INFO L462 AbstractCegarLoop]: Abstraction has 10325 states and 46869 transitions. [2019-12-27 19:12:30,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:12:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 46869 transitions. [2019-12-27 19:12:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:30,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:30,664 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 19:12:30,664 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 19:12:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193032, now seen corresponding path program 3 times [2019-12-27 19:12:30,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:30,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677812049] [2019-12-27 19:12:30,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:30,733 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 19:12:30,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677812049] [2019-12-27 19:12:30,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:30,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:30,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615466208] [2019-12-27 19:12:30,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:30,737 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:30,747 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:12:30,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:30,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 19:12:30,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:12:30,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:30,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:12:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:12:30,917 INFO L87 Difference]: Start difference. First operand 10325 states and 46869 transitions. Second operand 19 states. [2019-12-27 19:12:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:33,903 INFO L93 Difference]: Finished difference Result 37672 states and 138225 transitions. [2019-12-27 19:12:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 19:12:33,903 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 19:12:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:33,980 INFO L225 Difference]: With dead ends: 37672 [2019-12-27 19:12:33,980 INFO L226 Difference]: Without dead ends: 37642 [2019-12-27 19:12:33,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3151 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2051, Invalid=7261, Unknown=0, NotChecked=0, Total=9312 [2019-12-27 19:12:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2019-12-27 19:12:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 10175. [2019-12-27 19:12:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10175 states. [2019-12-27 19:12:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 46142 transitions. [2019-12-27 19:12:34,374 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 46142 transitions. Word has length 25 [2019-12-27 19:12:34,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:34,374 INFO L462 AbstractCegarLoop]: Abstraction has 10175 states and 46142 transitions. [2019-12-27 19:12:34,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:12:34,374 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 46142 transitions. [2019-12-27 19:12:34,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:34,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:34,377 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 19:12:34,377 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 19:12:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:34,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1737482051, now seen corresponding path program 3 times [2019-12-27 19:12:34,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:34,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790393272] [2019-12-27 19:12:34,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:34,432 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 19:12:34,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790393272] [2019-12-27 19:12:34,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:34,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:34,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281362067] [2019-12-27 19:12:34,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:34,436 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:34,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:12:34,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:34,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 19:12:34,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 19:12:34,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:34,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 19:12:34,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:12:34,718 INFO L87 Difference]: Start difference. First operand 10175 states and 46142 transitions. Second operand 21 states. [2019-12-27 19:12:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:37,721 INFO L93 Difference]: Finished difference Result 37241 states and 136421 transitions. [2019-12-27 19:12:37,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 19:12:37,722 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 19:12:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:37,797 INFO L225 Difference]: With dead ends: 37241 [2019-12-27 19:12:37,797 INFO L226 Difference]: Without dead ends: 37211 [2019-12-27 19:12:37,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3231 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2189, Invalid=7513, Unknown=0, NotChecked=0, Total=9702 [2019-12-27 19:12:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37211 states. [2019-12-27 19:12:38,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37211 to 10057. [2019-12-27 19:12:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2019-12-27 19:12:38,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 45612 transitions. [2019-12-27 19:12:38,211 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 45612 transitions. Word has length 25 [2019-12-27 19:12:38,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:38,212 INFO L462 AbstractCegarLoop]: Abstraction has 10057 states and 45612 transitions. [2019-12-27 19:12:38,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 19:12:38,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 45612 transitions. [2019-12-27 19:12:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:38,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:38,215 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 19:12:38,216 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 19:12:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1743407112, now seen corresponding path program 4 times [2019-12-27 19:12:38,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:38,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740046931] [2019-12-27 19:12:38,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:38,282 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 19:12:38,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740046931] [2019-12-27 19:12:38,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:38,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:38,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1367882560] [2019-12-27 19:12:38,283 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:38,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:38,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:12:38,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:38,403 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:12:38,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:12:38,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:38,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:12:38,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:38,405 INFO L87 Difference]: Start difference. First operand 10057 states and 45612 transitions. Second operand 15 states. [2019-12-27 19:12:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:40,561 INFO L93 Difference]: Finished difference Result 36263 states and 135250 transitions. [2019-12-27 19:12:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 19:12:40,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:12:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:40,645 INFO L225 Difference]: With dead ends: 36263 [2019-12-27 19:12:40,645 INFO L226 Difference]: Without dead ends: 36228 [2019-12-27 19:12:40,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1138, Invalid=3974, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 19:12:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36228 states. [2019-12-27 19:12:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36228 to 10010. [2019-12-27 19:12:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10010 states. [2019-12-27 19:12:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 45376 transitions. [2019-12-27 19:12:41,036 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 45376 transitions. Word has length 25 [2019-12-27 19:12:41,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:41,036 INFO L462 AbstractCegarLoop]: Abstraction has 10010 states and 45376 transitions. [2019-12-27 19:12:41,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:12:41,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 45376 transitions. [2019-12-27 19:12:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:41,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:41,039 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 19:12:41,039 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 19:12:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:41,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1743404291, now seen corresponding path program 4 times [2019-12-27 19:12:41,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:41,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113126848] [2019-12-27 19:12:41,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:41,122 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 19:12:41,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113126848] [2019-12-27 19:12:41,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:41,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:41,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1291030144] [2019-12-27 19:12:41,124 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:41,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:41,148 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:12:41,148 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:41,445 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:12:41,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:12:41,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:41,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:12:41,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:41,446 INFO L87 Difference]: Start difference. First operand 10010 states and 45376 transitions. Second operand 15 states. [2019-12-27 19:12:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:43,527 INFO L93 Difference]: Finished difference Result 35790 states and 133386 transitions. [2019-12-27 19:12:43,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 19:12:43,528 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:12:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:43,603 INFO L225 Difference]: With dead ends: 35790 [2019-12-27 19:12:43,603 INFO L226 Difference]: Without dead ends: 35755 [2019-12-27 19:12:43,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1138, Invalid=3974, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 19:12:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35755 states. [2019-12-27 19:12:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35755 to 9827. [2019-12-27 19:12:43,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9827 states. [2019-12-27 19:12:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44489 transitions. [2019-12-27 19:12:43,983 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 44489 transitions. Word has length 25 [2019-12-27 19:12:43,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:43,983 INFO L462 AbstractCegarLoop]: Abstraction has 9827 states and 44489 transitions. [2019-12-27 19:12:43,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:12:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 44489 transitions. [2019-12-27 19:12:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:43,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:43,987 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 19:12:43,987 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 19:12:43,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2139211039, now seen corresponding path program 5 times [2019-12-27 19:12:43,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:43,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20033096] [2019-12-27 19:12:43,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:44,045 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 19:12:44,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20033096] [2019-12-27 19:12:44,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:44,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:44,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101396329] [2019-12-27 19:12:44,046 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:44,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:44,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:44,055 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:44,055 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:44,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:44,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:44,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:44,056 INFO L87 Difference]: Start difference. First operand 9827 states and 44489 transitions. Second operand 9 states. [2019-12-27 19:12:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:44,847 INFO L93 Difference]: Finished difference Result 31623 states and 123094 transitions. [2019-12-27 19:12:44,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:44,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:12:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:44,914 INFO L225 Difference]: With dead ends: 31623 [2019-12-27 19:12:44,914 INFO L226 Difference]: Without dead ends: 31607 [2019-12-27 19:12:44,914 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 19:12:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2019-12-27 19:12:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 9671. [2019-12-27 19:12:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 19:12:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 43725 transitions. [2019-12-27 19:12:45,263 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 43725 transitions. Word has length 25 [2019-12-27 19:12:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:45,263 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 43725 transitions. [2019-12-27 19:12:45,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 43725 transitions. [2019-12-27 19:12:45,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:45,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:45,266 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 19:12:45,266 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 19:12:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2139202824, now seen corresponding path program 5 times [2019-12-27 19:12:45,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:45,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826103773] [2019-12-27 19:12:45,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:45,338 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 19:12:45,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826103773] [2019-12-27 19:12:45,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781071163] [2019-12-27 19:12:45,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:45,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:45,346 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:45,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:45,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:45,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:45,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:45,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:45,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:45,347 INFO L87 Difference]: Start difference. First operand 9671 states and 43725 transitions. Second operand 9 states. [2019-12-27 19:12:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:46,208 INFO L93 Difference]: Finished difference Result 31103 states and 120876 transitions. [2019-12-27 19:12:46,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:46,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:12:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:46,270 INFO L225 Difference]: With dead ends: 31103 [2019-12-27 19:12:46,271 INFO L226 Difference]: Without dead ends: 31087 [2019-12-27 19:12:46,271 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 19:12:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31087 states. [2019-12-27 19:12:46,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31087 to 9503. [2019-12-27 19:12:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2019-12-27 19:12:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 42917 transitions. [2019-12-27 19:12:46,773 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 42917 transitions. Word has length 25 [2019-12-27 19:12:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:46,773 INFO L462 AbstractCegarLoop]: Abstraction has 9503 states and 42917 transitions. [2019-12-27 19:12:46,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 42917 transitions. [2019-12-27 19:12:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:46,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:46,776 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 19:12:46,776 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 19:12:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2136502879, now seen corresponding path program 6 times [2019-12-27 19:12:46,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:46,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111284864] [2019-12-27 19:12:46,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:46,843 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 19:12:46,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111284864] [2019-12-27 19:12:46,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:46,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:46,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122149308] [2019-12-27 19:12:46,845 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:46,846 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:46,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:46,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:46,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:46,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:46,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:46,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:46,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:46,852 INFO L87 Difference]: Start difference. First operand 9503 states and 42917 transitions. Second operand 9 states. [2019-12-27 19:12:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:47,810 INFO L93 Difference]: Finished difference Result 30789 states and 119448 transitions. [2019-12-27 19:12:47,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:47,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:12:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:47,879 INFO L225 Difference]: With dead ends: 30789 [2019-12-27 19:12:47,879 INFO L226 Difference]: Without dead ends: 30769 [2019-12-27 19:12:47,879 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 19:12:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30769 states. [2019-12-27 19:12:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30769 to 9172. [2019-12-27 19:12:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9172 states. [2019-12-27 19:12:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9172 states to 9172 states and 41398 transitions. [2019-12-27 19:12:48,235 INFO L78 Accepts]: Start accepts. Automaton has 9172 states and 41398 transitions. Word has length 25 [2019-12-27 19:12:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:48,235 INFO L462 AbstractCegarLoop]: Abstraction has 9172 states and 41398 transitions. [2019-12-27 19:12:48,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 9172 states and 41398 transitions. [2019-12-27 19:12:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:48,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:48,238 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 19:12:48,238 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 19:12:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:48,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2136491843, now seen corresponding path program 5 times [2019-12-27 19:12:48,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:48,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864515053] [2019-12-27 19:12:48,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:48,302 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 19:12:48,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864515053] [2019-12-27 19:12:48,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:48,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:48,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [169803908] [2019-12-27 19:12:48,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:48,306 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:48,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:48,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:48,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:48,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:48,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:48,312 INFO L87 Difference]: Start difference. First operand 9172 states and 41398 transitions. Second operand 9 states. [2019-12-27 19:12:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:49,227 INFO L93 Difference]: Finished difference Result 30398 states and 117772 transitions. [2019-12-27 19:12:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:49,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:12:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:49,291 INFO L225 Difference]: With dead ends: 30398 [2019-12-27 19:12:49,291 INFO L226 Difference]: Without dead ends: 30382 [2019-12-27 19:12:49,291 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 19:12:49,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30382 states. [2019-12-27 19:12:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30382 to 9066. [2019-12-27 19:12:49,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-27 19:12:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 40900 transitions. [2019-12-27 19:12:49,627 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 40900 transitions. Word has length 25 [2019-12-27 19:12:49,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:49,628 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 40900 transitions. [2019-12-27 19:12:49,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 40900 transitions. [2019-12-27 19:12:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:49,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:49,630 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 19:12:49,631 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 19:12:49,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash -2128608264, now seen corresponding path program 6 times [2019-12-27 19:12:49,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:49,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613863251] [2019-12-27 19:12:49,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:49,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:49,703 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 19:12:49,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613863251] [2019-12-27 19:12:49,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:49,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:49,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1255743422] [2019-12-27 19:12:49,704 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:49,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:49,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:49,710 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:49,710 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:49,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:49,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:49,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:49,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:49,711 INFO L87 Difference]: Start difference. First operand 9066 states and 40900 transitions. Second operand 9 states. [2019-12-27 19:12:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:50,608 INFO L93 Difference]: Finished difference Result 30130 states and 116617 transitions. [2019-12-27 19:12:50,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:50,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:12:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:50,674 INFO L225 Difference]: With dead ends: 30130 [2019-12-27 19:12:50,674 INFO L226 Difference]: Without dead ends: 30110 [2019-12-27 19:12:50,675 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 19:12:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-27 19:12:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 8819. [2019-12-27 19:12:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8819 states. [2019-12-27 19:12:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8819 states to 8819 states and 39792 transitions. [2019-12-27 19:12:51,006 INFO L78 Accepts]: Start accepts. Automaton has 8819 states and 39792 transitions. Word has length 25 [2019-12-27 19:12:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:51,006 INFO L462 AbstractCegarLoop]: Abstraction has 8819 states and 39792 transitions. [2019-12-27 19:12:51,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8819 states and 39792 transitions. [2019-12-27 19:12:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:51,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:51,009 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 19:12:51,009 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 19:12:51,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:51,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2128605443, now seen corresponding path program 6 times [2019-12-27 19:12:51,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:51,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235505144] [2019-12-27 19:12:51,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:51,073 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 19:12:51,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235505144] [2019-12-27 19:12:51,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:51,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:51,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [779257000] [2019-12-27 19:12:51,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:51,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:51,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:51,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:51,084 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:51,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:51,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:51,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:51,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:51,085 INFO L87 Difference]: Start difference. First operand 8819 states and 39792 transitions. Second operand 9 states. [2019-12-27 19:12:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:52,026 INFO L93 Difference]: Finished difference Result 29741 states and 115009 transitions. [2019-12-27 19:12:52,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:52,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:12:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:52,094 INFO L225 Difference]: With dead ends: 29741 [2019-12-27 19:12:52,094 INFO L226 Difference]: Without dead ends: 29721 [2019-12-27 19:12:52,094 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 19:12:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2019-12-27 19:12:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 8516. [2019-12-27 19:12:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 19:12:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 19:12:52,418 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 19:12:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:52,418 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 19:12:52,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 19:12:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 19:12:52,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:52,422 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:52,422 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 19:12:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash -214879977, now seen corresponding path program 1 times [2019-12-27 19:12:52,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:52,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187773112] [2019-12-27 19:12:52,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:12:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:12:52,441 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:12:52,441 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:12:52,441 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:12:52,441 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 19:12:52,456 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,456 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,456 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,457 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,457 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,457 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,457 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,457 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,457 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,457 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,458 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,458 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,458 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,458 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,458 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,458 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,458 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,459 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,460 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,461 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,461 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,461 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,461 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,461 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,461 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,462 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,463 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,463 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,463 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,463 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,463 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,463 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,463 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,464 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,465 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,465 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,465 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,465 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,465 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,465 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,466 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,467 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,467 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,467 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,469 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,470 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,470 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,470 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,470 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,470 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,482 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,482 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,482 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,483 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,483 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,484 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,484 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,484 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,484 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,484 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,486 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,486 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,486 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,486 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,486 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,487 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,488 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,488 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,488 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,488 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,490 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,490 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,491 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,491 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,491 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,492 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,492 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,492 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,492 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,492 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,493 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,494 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,494 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,494 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,494 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,494 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,494 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,495 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,496 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,496 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,496 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,496 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,496 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,497 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,497 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,497 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,498 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,498 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,498 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,499 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,499 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,500 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,500 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,500 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,501 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,501 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,501 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,501 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,501 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,502 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:12:52,503 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 19:12:52,503 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:12:52,503 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:12:52,503 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:12:52,503 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:12:52,503 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:12:52,503 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:12:52,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:12:52,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:12:52,505 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 133 transitions [2019-12-27 19:12:52,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 19:12:52,528 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 19:12:52,528 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:12:52,531 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 19:12:52,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 19:12:52,562 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 19:12:52,562 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:12:52,565 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 19:12:52,572 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 19:12:52,572 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:12:54,447 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 19:12:54,637 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-27 19:12:54,851 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-27 19:12:54,930 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3471 [2019-12-27 19:12:54,931 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 19:12:54,931 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 19:12:56,121 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 19:12:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 19:12:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:12:56,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:56,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:12:56,121 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 19:12:56,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1229452, now seen corresponding path program 1 times [2019-12-27 19:12:56,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:56,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208518960] [2019-12-27 19:12:56,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:56,138 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 19:12:56,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208518960] [2019-12-27 19:12:56,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:56,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:12:56,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489588199] [2019-12-27 19:12:56,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:56,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:56,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:12:56,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:56,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:56,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:12:56,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:12:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:12:56,141 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 19:12:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:56,268 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 19:12:56,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:12:56,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:12:56,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:56,315 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 19:12:56,315 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 19:12:56,315 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 19:12:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 19:12:56,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 19:12:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 19:12:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 19:12:58,060 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 19:12:58,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:58,060 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 19:12:58,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:12:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 19:12:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:12:58,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:58,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:58,060 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 19:12:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:58,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2087713608, now seen corresponding path program 1 times [2019-12-27 19:12:58,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:58,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796443335] [2019-12-27 19:12:58,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:58,109 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 19:12:58,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796443335] [2019-12-27 19:12:58,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:58,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:12:58,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [678367604] [2019-12-27 19:12:58,110 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:58,111 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:58,111 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:12:58,111 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:58,112 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:58,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:12:58,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:58,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:12:58,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:12:58,112 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 19:12:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:58,383 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 19:12:58,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:12:58,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:12:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:58,466 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 19:12:58,466 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 19:12:58,466 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 19:12:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 19:12:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 19:12:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 19:12:59,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 19:12:59,049 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 19:12:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:59,049 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 19:12:59,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:12:59,049 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 19:12:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:12:59,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:59,049 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:59,050 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 19:12:59,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash -973722539, now seen corresponding path program 1 times [2019-12-27 19:12:59,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:59,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552424606] [2019-12-27 19:12:59,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:59,073 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 19:12:59,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552424606] [2019-12-27 19:12:59,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:59,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:12:59,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1857990313] [2019-12-27 19:12:59,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:59,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:59,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:12:59,076 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:59,076 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:59,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:12:59,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:12:59,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:12:59,077 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 19:12:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:59,360 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 19:12:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:12:59,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:12:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:59,456 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 19:12:59,456 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 19:12:59,456 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 19:12:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 19:13:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 19:13:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 19:13:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 19:13:00,121 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 19:13:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:00,121 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 19:13:00,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:13:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 19:13:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:13:00,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:00,122 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:00,122 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 19:13:00,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1543295844, now seen corresponding path program 1 times [2019-12-27 19:13:00,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:00,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366188377] [2019-12-27 19:13:00,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:00,174 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 19:13:00,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366188377] [2019-12-27 19:13:00,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255903079] [2019-12-27 19:13:00,174 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 19:13:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:00,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:00,275 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:13:00,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:00,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:00,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1670992002] [2019-12-27 19:13:00,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:00,326 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:00,328 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:13:00,329 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:00,329 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:13:00,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:00,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:00,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:13:00,329 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-27 19:13:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:00,931 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 19:13:00,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:00,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:13:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:01,099 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 19:13:01,099 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 19:13:01,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:13:01,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 19:13:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 19:13:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 19:13:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 19:13:02,362 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 19:13:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:02,362 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 19:13:02,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 19:13:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:13:02,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:02,362 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:02,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:02,563 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 19:13:02,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 555508526, now seen corresponding path program 2 times [2019-12-27 19:13:02,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:02,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109644121] [2019-12-27 19:13:02,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:02,602 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 19:13:02,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109644121] [2019-12-27 19:13:02,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:02,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:13:02,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1877896752] [2019-12-27 19:13:02,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:02,604 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:02,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:13:02,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:02,606 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:02,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:02,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:02,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:02,607 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 19:13:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:03,196 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 19:13:03,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:03,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:13:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:03,360 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 19:13:03,360 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 19:13:03,360 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 19:13:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 19:13:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 19:13:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 19:13:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 19:13:04,246 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 19:13:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:04,246 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 19:13:04,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 19:13:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:13:04,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:04,247 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:04,247 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 19:13:04,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:04,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1552042877, now seen corresponding path program 1 times [2019-12-27 19:13:04,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:04,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100369021] [2019-12-27 19:13:04,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:04,273 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 19:13:04,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100369021] [2019-12-27 19:13:04,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:04,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:13:04,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1588779414] [2019-12-27 19:13:04,274 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:04,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:04,276 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:13:04,276 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:04,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:04,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:13:04,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:04,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:13:04,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:13:04,277 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 19:13:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:04,607 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 19:13:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:13:04,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:13:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:04,725 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 19:13:04,725 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 19:13:04,725 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 19:13:06,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 19:13:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 19:13:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 19:13:07,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 19:13:07,290 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 19:13:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:07,291 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 19:13:07,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:13:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 19:13:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:07,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:07,291 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:07,292 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 19:13:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1878511684, now seen corresponding path program 1 times [2019-12-27 19:13:07,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:07,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282500269] [2019-12-27 19:13:07,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:07,332 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 19:13:07,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282500269] [2019-12-27 19:13:07,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464277724] [2019-12-27 19:13:07,333 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 19:13:07,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:07,422 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:07,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:07,478 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 19:13:07,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:07,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:07,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175841301] [2019-12-27 19:13:07,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:07,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:07,484 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 19:13:07,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:07,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:13:07,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:07,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:13:07,485 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-27 19:13:08,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:08,154 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 19:13:08,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:08,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:13:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:08,337 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 19:13:08,338 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 19:13:08,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:13:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 19:13:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 19:13:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 19:13:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 19:13:09,392 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 19:13:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:09,392 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 19:13:09,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 19:13:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:09,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:09,393 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:09,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:09,594 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 19:13:09,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:09,594 INFO L82 PathProgramCache]: Analyzing trace with hash -90006000, now seen corresponding path program 1 times [2019-12-27 19:13:09,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:09,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821379616] [2019-12-27 19:13:09,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:09,633 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 19:13:09,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821379616] [2019-12-27 19:13:09,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291233938] [2019-12-27 19:13:09,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:13:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:09,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:09,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:09,785 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 19:13:09,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:09,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:09,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074228829] [2019-12-27 19:13:09,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:09,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:09,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 19:13:09,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:09,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:13:09,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:09,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:09,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:09,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:13:09,821 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 9 states. [2019-12-27 19:13:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:11,323 INFO L93 Difference]: Finished difference Result 72790 states and 343256 transitions. [2019-12-27 19:13:11,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:13:11,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 19:13:11,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:11,536 INFO L225 Difference]: With dead ends: 72790 [2019-12-27 19:13:11,536 INFO L226 Difference]: Without dead ends: 72777 [2019-12-27 19:13:11,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:13:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72777 states. [2019-12-27 19:13:12,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72777 to 27791. [2019-12-27 19:13:12,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-27 19:13:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-27 19:13:12,617 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-27 19:13:12,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:12,617 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-27 19:13:12,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-27 19:13:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:12,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:12,618 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:12,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:12,819 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 19:13:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:12,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551062, now seen corresponding path program 2 times [2019-12-27 19:13:12,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:12,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185567162] [2019-12-27 19:13:12,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:12,853 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 19:13:12,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185567162] [2019-12-27 19:13:12,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:12,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:13:12,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [743587938] [2019-12-27 19:13:12,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:12,855 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:12,858 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:13:12,858 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:12,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:12,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:12,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:12,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:12,859 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 7 states. [2019-12-27 19:13:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:13,545 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-27 19:13:13,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:13,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:13:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:13,754 INFO L225 Difference]: With dead ends: 68100 [2019-12-27 19:13:13,755 INFO L226 Difference]: Without dead ends: 68091 [2019-12-27 19:13:13,755 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 19:13:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-27 19:13:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-27 19:13:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 19:13:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-27 19:13:17,383 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-27 19:13:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:17,383 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-27 19:13:17,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-27 19:13:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:17,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:17,384 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:17,385 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 19:13:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551992, now seen corresponding path program 2 times [2019-12-27 19:13:17,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:17,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748084998] [2019-12-27 19:13:17,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:17,423 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 19:13:17,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748084998] [2019-12-27 19:13:17,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:17,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:13:17,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [449929992] [2019-12-27 19:13:17,425 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:17,426 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:17,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:13:17,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:17,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:17,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:17,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:17,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:17,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:17,429 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 7 states. [2019-12-27 19:13:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:18,120 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 19:13:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:18,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:13:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:18,329 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 19:13:18,329 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 19:13:18,329 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 19:13:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 19:13:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 19:13:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 19:13:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 19:13:19,441 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 19:13:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:19,441 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 19:13:19,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 19:13:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:19,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:19,442 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 19:13:19,443 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 19:13:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash 113904919, now seen corresponding path program 1 times [2019-12-27 19:13:19,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:19,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886803577] [2019-12-27 19:13:19,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:19,494 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 19:13:19,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886803577] [2019-12-27 19:13:19,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077425915] [2019-12-27 19:13:19,495 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 19:13:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:19,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:19,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:19,674 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 19:13:19,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:19,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:19,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219744675] [2019-12-27 19:13:19,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:19,677 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:19,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 19:13:19,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:19,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:13:19,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:13:19,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:19,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:13:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:13:19,718 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 11 states. [2019-12-27 19:13:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:21,983 INFO L93 Difference]: Finished difference Result 104572 states and 466018 transitions. [2019-12-27 19:13:21,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 19:13:21,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 19:13:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:22,284 INFO L225 Difference]: With dead ends: 104572 [2019-12-27 19:13:22,284 INFO L226 Difference]: Without dead ends: 104567 [2019-12-27 19:13:22,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 19:13:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104567 states. [2019-12-27 19:13:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104567 to 27697. [2019-12-27 19:13:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-27 19:13:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-27 19:13:23,822 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-27 19:13:23,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:23,822 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-27 19:13:23,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:13:23,822 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-27 19:13:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:23,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:23,823 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 19:13:24,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:24,024 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 19:13:24,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:24,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1363462911, now seen corresponding path program 2 times [2019-12-27 19:13:24,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:24,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663945116] [2019-12-27 19:13:24,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:24,080 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 19:13:24,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663945116] [2019-12-27 19:13:24,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613307655] [2019-12-27 19:13:24,080 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 19:13:24,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:13:24,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:13:24,176 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:24,177 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:24,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 19:13:24,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:24,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:24,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [715791704] [2019-12-27 19:13:24,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:24,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:24,264 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:13:24,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:24,264 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:13:24,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:24,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:24,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:13:24,265 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 9 states. [2019-12-27 19:13:25,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:25,611 INFO L93 Difference]: Finished difference Result 96837 states and 436529 transitions. [2019-12-27 19:13:25,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:25,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:13:25,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:26,549 INFO L225 Difference]: With dead ends: 96837 [2019-12-27 19:13:26,549 INFO L226 Difference]: Without dead ends: 96831 [2019-12-27 19:13:26,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:13:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96831 states. [2019-12-27 19:13:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96831 to 27343. [2019-12-27 19:13:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 19:13:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 19:13:27,796 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 19:13:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:27,796 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 19:13:27,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 19:13:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:27,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:27,797 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 19:13:27,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:27,998 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 19:13:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:27,998 INFO L82 PathProgramCache]: Analyzing trace with hash -596422103, now seen corresponding path program 3 times [2019-12-27 19:13:27,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:27,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987957759] [2019-12-27 19:13:27,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:28,055 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 19:13:28,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987957759] [2019-12-27 19:13:28,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171863911] [2019-12-27 19:13:28,056 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 19:13:28,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:13:28,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:13:28,141 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:28,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:28,219 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 19:13:28,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:28,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:28,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318838358] [2019-12-27 19:13:28,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:28,221 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:28,224 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 19:13:28,224 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:28,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:13:28,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:13:28,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:28,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:13:28,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:13:28,254 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 11 states. [2019-12-27 19:13:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:30,229 INFO L93 Difference]: Finished difference Result 105437 states and 468029 transitions. [2019-12-27 19:13:30,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:13:30,229 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 19:13:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:31,081 INFO L225 Difference]: With dead ends: 105437 [2019-12-27 19:13:31,081 INFO L226 Difference]: Without dead ends: 105430 [2019-12-27 19:13:31,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2432, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:13:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105430 states. [2019-12-27 19:13:32,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105430 to 26991. [2019-12-27 19:13:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26991 states. [2019-12-27 19:13:32,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26991 states to 26991 states and 145461 transitions. [2019-12-27 19:13:32,487 INFO L78 Accepts]: Start accepts. Automaton has 26991 states and 145461 transitions. Word has length 21 [2019-12-27 19:13:32,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:32,487 INFO L462 AbstractCegarLoop]: Abstraction has 26991 states and 145461 transitions. [2019-12-27 19:13:32,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:13:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 26991 states and 145461 transitions. [2019-12-27 19:13:32,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:32,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:32,489 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 19:13:32,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:32,689 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 19:13:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash -607849943, now seen corresponding path program 4 times [2019-12-27 19:13:32,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:32,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106266973] [2019-12-27 19:13:32,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:32,746 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 19:13:32,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106266973] [2019-12-27 19:13:32,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327139205] [2019-12-27 19:13:32,747 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 19:13:32,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:13:32,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:13:32,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:32,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:32,919 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 19:13:32,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:32,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:32,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1816314686] [2019-12-27 19:13:32,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:32,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:32,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:13:32,927 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:33,016 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 19:13:33,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:13:33,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:33,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:13:33,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:13:33,018 INFO L87 Difference]: Start difference. First operand 26991 states and 145461 transitions. Second operand 15 states. [2019-12-27 19:13:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:35,982 INFO L93 Difference]: Finished difference Result 107711 states and 472765 transitions. [2019-12-27 19:13:35,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:13:35,982 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-27 19:13:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:36,274 INFO L225 Difference]: With dead ends: 107711 [2019-12-27 19:13:36,274 INFO L226 Difference]: Without dead ends: 107702 [2019-12-27 19:13:36,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1214, Invalid=4486, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:13:36,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107702 states. [2019-12-27 19:13:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107702 to 26339. [2019-12-27 19:13:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2019-12-27 19:13:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 142000 transitions. [2019-12-27 19:13:37,723 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 142000 transitions. Word has length 21 [2019-12-27 19:13:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:37,723 INFO L462 AbstractCegarLoop]: Abstraction has 26339 states and 142000 transitions. [2019-12-27 19:13:37,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:13:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 142000 transitions. [2019-12-27 19:13:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:37,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:37,724 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:37,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:37,925 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 19:13:37,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:37,926 INFO L82 PathProgramCache]: Analyzing trace with hash 671564070, now seen corresponding path program 1 times [2019-12-27 19:13:37,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:37,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739911957] [2019-12-27 19:13:37,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:37,954 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 19:13:37,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739911957] [2019-12-27 19:13:37,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:37,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:13:37,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1210905835] [2019-12-27 19:13:37,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:37,957 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:37,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:13:37,959 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:37,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:37,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:13:37,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:37,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:13:37,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:13:37,960 INFO L87 Difference]: Start difference. First operand 26339 states and 142000 transitions. Second operand 5 states. [2019-12-27 19:13:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:38,321 INFO L93 Difference]: Finished difference Result 47340 states and 243927 transitions. [2019-12-27 19:13:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:13:38,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 19:13:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:38,463 INFO L225 Difference]: With dead ends: 47340 [2019-12-27 19:13:38,464 INFO L226 Difference]: Without dead ends: 47324 [2019-12-27 19:13:38,464 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 19:13:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2019-12-27 19:13:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 32794. [2019-12-27 19:13:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32794 states. [2019-12-27 19:13:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32794 states to 32794 states and 178171 transitions. [2019-12-27 19:13:39,737 INFO L78 Accepts]: Start accepts. Automaton has 32794 states and 178171 transitions. Word has length 21 [2019-12-27 19:13:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:39,737 INFO L462 AbstractCegarLoop]: Abstraction has 32794 states and 178171 transitions. [2019-12-27 19:13:39,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:13:39,737 INFO L276 IsEmpty]: Start isEmpty. Operand 32794 states and 178171 transitions. [2019-12-27 19:13:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:39,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:39,738 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 19:13:39,738 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 19:13:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:39,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1932039825, now seen corresponding path program 5 times [2019-12-27 19:13:39,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:39,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157887250] [2019-12-27 19:13:39,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:39,791 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 19:13:39,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157887250] [2019-12-27 19:13:39,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:39,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:39,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484912053] [2019-12-27 19:13:39,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:39,794 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:39,798 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:13:39,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:39,798 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:39,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:39,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:39,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:39,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:39,799 INFO L87 Difference]: Start difference. First operand 32794 states and 178171 transitions. Second operand 9 states. [2019-12-27 19:13:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:41,133 INFO L93 Difference]: Finished difference Result 112140 states and 515003 transitions. [2019-12-27 19:13:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:41,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:13:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:41,459 INFO L225 Difference]: With dead ends: 112140 [2019-12-27 19:13:41,460 INFO L226 Difference]: Without dead ends: 112133 [2019-12-27 19:13:41,460 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 19:13:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112133 states. [2019-12-27 19:13:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112133 to 31942. [2019-12-27 19:13:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31942 states. [2019-12-27 19:13:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31942 states to 31942 states and 173493 transitions. [2019-12-27 19:13:43,709 INFO L78 Accepts]: Start accepts. Automaton has 31942 states and 173493 transitions. Word has length 21 [2019-12-27 19:13:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:43,710 INFO L462 AbstractCegarLoop]: Abstraction has 31942 states and 173493 transitions. [2019-12-27 19:13:43,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31942 states and 173493 transitions. [2019-12-27 19:13:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:43,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:43,711 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 19:13:43,711 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 19:13:43,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932625, now seen corresponding path program 6 times [2019-12-27 19:13:43,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:43,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718002840] [2019-12-27 19:13:43,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:43,785 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 19:13:43,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718002840] [2019-12-27 19:13:43,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:43,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:43,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562910742] [2019-12-27 19:13:43,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:43,788 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:43,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:13:43,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:43,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:43,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:43,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:43,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:43,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:43,793 INFO L87 Difference]: Start difference. First operand 31942 states and 173493 transitions. Second operand 9 states. [2019-12-27 19:13:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:45,138 INFO L93 Difference]: Finished difference Result 111030 states and 509192 transitions. [2019-12-27 19:13:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:45,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:13:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:45,461 INFO L225 Difference]: With dead ends: 111030 [2019-12-27 19:13:45,461 INFO L226 Difference]: Without dead ends: 111020 [2019-12-27 19:13:45,462 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 19:13:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111020 states. [2019-12-27 19:13:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111020 to 30899. [2019-12-27 19:13:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 19:13:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 19:13:47,651 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 19:13:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:47,651 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 19:13:47,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 19:13:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:13:47,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:47,652 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:47,653 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 19:13:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash -938538387, now seen corresponding path program 1 times [2019-12-27 19:13:47,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:47,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846835972] [2019-12-27 19:13:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:47,694 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 19:13:47,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846835972] [2019-12-27 19:13:47,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750767907] [2019-12-27 19:13:47,695 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 19:13:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:47,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:47,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:47,852 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 19:13:47,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:47,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:47,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882201958] [2019-12-27 19:13:47,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:47,854 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:47,862 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 19:13:47,863 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:47,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:13:47,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:47,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:13:47,864 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-27 19:13:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:48,611 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 19:13:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:48,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:13:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:48,829 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 19:13:48,829 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 19:13:48,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:13:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 19:13:50,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 19:13:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 19:13:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 19:13:50,472 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 19:13:50,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:50,472 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 19:13:50,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:50,472 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 19:13:50,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:13:50,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:50,474 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:50,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:50,675 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 19:13:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:50,675 INFO L82 PathProgramCache]: Analyzing trace with hash -912298617, now seen corresponding path program 1 times [2019-12-27 19:13:50,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:50,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431715909] [2019-12-27 19:13:50,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:13:50,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431715909] [2019-12-27 19:13:50,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843604087] [2019-12-27 19:13:50,721 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 19:13:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:50,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:50,824 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:50,873 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 19:13:50,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:50,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:50,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [705536077] [2019-12-27 19:13:50,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:50,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:50,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 19:13:50,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:50,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:13:50,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:13:50,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:50,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:13:50,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:13:50,931 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 10 states. [2019-12-27 19:13:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:51,918 INFO L93 Difference]: Finished difference Result 84143 states and 401649 transitions. [2019-12-27 19:13:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:13:51,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-27 19:13:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:52,169 INFO L225 Difference]: With dead ends: 84143 [2019-12-27 19:13:52,169 INFO L226 Difference]: Without dead ends: 84121 [2019-12-27 19:13:52,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:13:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84121 states. [2019-12-27 19:13:53,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84121 to 32848. [2019-12-27 19:13:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32848 states. [2019-12-27 19:13:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32848 states to 32848 states and 178265 transitions. [2019-12-27 19:13:54,001 INFO L78 Accepts]: Start accepts. Automaton has 32848 states and 178265 transitions. Word has length 23 [2019-12-27 19:13:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:54,001 INFO L462 AbstractCegarLoop]: Abstraction has 32848 states and 178265 transitions. [2019-12-27 19:13:54,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:13:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32848 states and 178265 transitions. [2019-12-27 19:13:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:13:54,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:54,003 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:54,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:54,204 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 19:13:54,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:54,204 INFO L82 PathProgramCache]: Analyzing trace with hash 475670957, now seen corresponding path program 1 times [2019-12-27 19:13:54,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:54,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865192095] [2019-12-27 19:13:54,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:54,245 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 19:13:54,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865192095] [2019-12-27 19:13:54,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131559326] [2019-12-27 19:13:54,246 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 19:13:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:54,337 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:54,338 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:54,388 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 19:13:54,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:54,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:54,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [955863306] [2019-12-27 19:13:54,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:54,391 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:54,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 19:13:54,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:54,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:13:54,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:54,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:13:54,398 INFO L87 Difference]: Start difference. First operand 32848 states and 178265 transitions. Second operand 7 states. [2019-12-27 19:13:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:55,152 INFO L93 Difference]: Finished difference Result 80192 states and 391837 transitions. [2019-12-27 19:13:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:55,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:13:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:55,405 INFO L225 Difference]: With dead ends: 80192 [2019-12-27 19:13:55,405 INFO L226 Difference]: Without dead ends: 80173 [2019-12-27 19:13:55,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:13:55,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80173 states. [2019-12-27 19:13:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80173 to 33665. [2019-12-27 19:13:57,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33665 states. [2019-12-27 19:13:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33665 states to 33665 states and 182914 transitions. [2019-12-27 19:13:57,475 INFO L78 Accepts]: Start accepts. Automaton has 33665 states and 182914 transitions. Word has length 23 [2019-12-27 19:13:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:57,475 INFO L462 AbstractCegarLoop]: Abstraction has 33665 states and 182914 transitions. [2019-12-27 19:13:57,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 33665 states and 182914 transitions. [2019-12-27 19:13:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:13:57,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:57,477 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:57,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:57,678 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 19:13:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:57,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1127986751, now seen corresponding path program 2 times [2019-12-27 19:13:57,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:57,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984789114] [2019-12-27 19:13:57,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:57,720 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 19:13:57,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984789114] [2019-12-27 19:13:57,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:57,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:13:57,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590095289] [2019-12-27 19:13:57,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:57,722 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:57,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:13:57,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:57,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:57,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:57,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:57,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:57,726 INFO L87 Difference]: Start difference. First operand 33665 states and 182914 transitions. Second operand 7 states. [2019-12-27 19:13:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:58,453 INFO L93 Difference]: Finished difference Result 80956 states and 395965 transitions. [2019-12-27 19:13:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:58,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:13:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:58,706 INFO L225 Difference]: With dead ends: 80956 [2019-12-27 19:13:58,707 INFO L226 Difference]: Without dead ends: 80937 [2019-12-27 19:13:58,707 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 19:13:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80937 states. [2019-12-27 19:13:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80937 to 34532. [2019-12-27 19:13:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34532 states. [2019-12-27 19:14:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34532 states to 34532 states and 187636 transitions. [2019-12-27 19:14:00,047 INFO L78 Accepts]: Start accepts. Automaton has 34532 states and 187636 transitions. Word has length 23 [2019-12-27 19:14:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:00,048 INFO L462 AbstractCegarLoop]: Abstraction has 34532 states and 187636 transitions. [2019-12-27 19:14:00,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 34532 states and 187636 transitions. [2019-12-27 19:14:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:00,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:00,050 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:00,050 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 19:14:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1127974847, now seen corresponding path program 2 times [2019-12-27 19:14:00,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:00,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140114675] [2019-12-27 19:14:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:00,324 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-27 19:14:00,346 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 19:14:00,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140114675] [2019-12-27 19:14:00,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:14:00,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:14:00,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462280714] [2019-12-27 19:14:00,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:00,352 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:00,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:14:00,358 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:00,358 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:14:00,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:14:00,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:14:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:14:00,359 INFO L87 Difference]: Start difference. First operand 34532 states and 187636 transitions. Second operand 7 states. [2019-12-27 19:14:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:01,121 INFO L93 Difference]: Finished difference Result 81082 states and 396008 transitions. [2019-12-27 19:14:01,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:14:01,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:14:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:01,364 INFO L225 Difference]: With dead ends: 81082 [2019-12-27 19:14:01,364 INFO L226 Difference]: Without dead ends: 81063 [2019-12-27 19:14:01,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:14:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81063 states. [2019-12-27 19:14:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81063 to 35153. [2019-12-27 19:14:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35153 states. [2019-12-27 19:14:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35153 states to 35153 states and 191087 transitions. [2019-12-27 19:14:02,681 INFO L78 Accepts]: Start accepts. Automaton has 35153 states and 191087 transitions. Word has length 23 [2019-12-27 19:14:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:02,682 INFO L462 AbstractCegarLoop]: Abstraction has 35153 states and 191087 transitions. [2019-12-27 19:14:02,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 35153 states and 191087 transitions. [2019-12-27 19:14:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:02,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:02,684 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:02,684 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 19:14:02,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:02,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1127975777, now seen corresponding path program 2 times [2019-12-27 19:14:02,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:02,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604452252] [2019-12-27 19:14:02,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:02,722 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 19:14:02,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604452252] [2019-12-27 19:14:02,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:14:02,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:14:02,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593865776] [2019-12-27 19:14:02,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:02,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:02,729 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:14:02,729 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:02,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:14:02,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:14:02,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:14:02,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:14:02,730 INFO L87 Difference]: Start difference. First operand 35153 states and 191087 transitions. Second operand 7 states. [2019-12-27 19:14:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:03,791 INFO L93 Difference]: Finished difference Result 81506 states and 397808 transitions. [2019-12-27 19:14:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:14:03,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:14:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:04,076 INFO L225 Difference]: With dead ends: 81506 [2019-12-27 19:14:04,076 INFO L226 Difference]: Without dead ends: 81487 [2019-12-27 19:14:04,076 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 19:14:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81487 states. [2019-12-27 19:14:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81487 to 35912. [2019-12-27 19:14:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 19:14:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 19:14:05,461 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 19:14:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:05,462 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 19:14:05,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 19:14:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:05,465 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:05,465 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 19:14:05,465 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 19:14:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2032533234, now seen corresponding path program 1 times [2019-12-27 19:14:05,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:05,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602612891] [2019-12-27 19:14:05,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:05,527 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 19:14:05,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602612891] [2019-12-27 19:14:05,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914579272] [2019-12-27 19:14:05,528 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 19:14:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:05,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:05,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:05,726 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 19:14:05,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:05,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:05,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1543099884] [2019-12-27 19:14:05,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:05,729 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:05,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 19:14:05,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:05,800 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:14:05,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:14:05,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:05,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:14:05,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:14:05,801 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 12 states. [2019-12-27 19:14:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:08,007 INFO L93 Difference]: Finished difference Result 129266 states and 587409 transitions. [2019-12-27 19:14:08,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 19:14:08,007 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 19:14:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:08,385 INFO L225 Difference]: With dead ends: 129266 [2019-12-27 19:14:08,385 INFO L226 Difference]: Without dead ends: 129252 [2019-12-27 19:14:08,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=621, Invalid=2135, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 19:14:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129252 states. [2019-12-27 19:14:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129252 to 35590. [2019-12-27 19:14:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-12-27 19:14:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 193098 transitions. [2019-12-27 19:14:13,376 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 193098 transitions. Word has length 25 [2019-12-27 19:14:13,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:13,376 INFO L462 AbstractCegarLoop]: Abstraction has 35590 states and 193098 transitions. [2019-12-27 19:14:13,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:14:13,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 193098 transitions. [2019-12-27 19:14:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:13,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:13,379 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 19:14:13,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:13,580 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 19:14:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash -644563660, now seen corresponding path program 1 times [2019-12-27 19:14:13,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:13,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126469972] [2019-12-27 19:14:13,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:13,645 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 19:14:13,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126469972] [2019-12-27 19:14:13,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073401765] [2019-12-27 19:14:13,646 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 19:14:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:13,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:13,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:13,823 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 19:14:13,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:13,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:13,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [165237169] [2019-12-27 19:14:13,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:13,827 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:13,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:14:13,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:13,839 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:14:13,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:13,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:13,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:14:13,840 INFO L87 Difference]: Start difference. First operand 35590 states and 193098 transitions. Second operand 9 states. [2019-12-27 19:14:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:15,466 INFO L93 Difference]: Finished difference Result 118371 states and 546721 transitions. [2019-12-27 19:14:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:15,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:14:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:15,824 INFO L225 Difference]: With dead ends: 118371 [2019-12-27 19:14:15,824 INFO L226 Difference]: Without dead ends: 118361 [2019-12-27 19:14:15,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:14:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118361 states. [2019-12-27 19:14:18,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118361 to 35384. [2019-12-27 19:14:18,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35384 states. [2019-12-27 19:14:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35384 states to 35384 states and 191757 transitions. [2019-12-27 19:14:18,239 INFO L78 Accepts]: Start accepts. Automaton has 35384 states and 191757 transitions. Word has length 25 [2019-12-27 19:14:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:18,240 INFO L462 AbstractCegarLoop]: Abstraction has 35384 states and 191757 transitions. [2019-12-27 19:14:18,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 35384 states and 191757 transitions. [2019-12-27 19:14:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:18,244 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:18,244 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 19:14:18,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:18,444 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 19:14:18,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:18,445 INFO L82 PathProgramCache]: Analyzing trace with hash 7752134, now seen corresponding path program 2 times [2019-12-27 19:14:18,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:18,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449468729] [2019-12-27 19:14:18,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:18,520 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 19:14:18,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449468729] [2019-12-27 19:14:18,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513781237] [2019-12-27 19:14:18,520 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 19:14:18,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:14:18,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:18,611 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:18,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:18,732 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 19:14:18,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:18,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:18,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970806069] [2019-12-27 19:14:18,732 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:18,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:18,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:14:18,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:18,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:14:18,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:18,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:14:18,746 INFO L87 Difference]: Start difference. First operand 35384 states and 191757 transitions. Second operand 9 states. [2019-12-27 19:14:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:20,260 INFO L93 Difference]: Finished difference Result 117247 states and 540902 transitions. [2019-12-27 19:14:20,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:20,260 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:14:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:20,600 INFO L225 Difference]: With dead ends: 117247 [2019-12-27 19:14:20,600 INFO L226 Difference]: Without dead ends: 117236 [2019-12-27 19:14:20,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:14:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117236 states. [2019-12-27 19:14:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117236 to 35317. [2019-12-27 19:14:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35317 states. [2019-12-27 19:14:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35317 states to 35317 states and 191252 transitions. [2019-12-27 19:14:25,243 INFO L78 Accepts]: Start accepts. Automaton has 35317 states and 191252 transitions. Word has length 25 [2019-12-27 19:14:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:25,243 INFO L462 AbstractCegarLoop]: Abstraction has 35317 states and 191252 transitions. [2019-12-27 19:14:25,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 35317 states and 191252 transitions. [2019-12-27 19:14:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:25,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:25,246 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 19:14:25,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:25,446 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 19:14:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash 7741160, now seen corresponding path program 2 times [2019-12-27 19:14:25,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:25,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211145277] [2019-12-27 19:14:25,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:25,534 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 19:14:25,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211145277] [2019-12-27 19:14:25,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308802389] [2019-12-27 19:14:25,535 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 19:14:25,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:14:25,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:25,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:25,666 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:25,788 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 19:14:25,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:25,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:25,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2000101637] [2019-12-27 19:14:25,789 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:25,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:25,802 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:14:25,802 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:25,803 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:14:25,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:25,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:25,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:25,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:14:25,804 INFO L87 Difference]: Start difference. First operand 35317 states and 191252 transitions. Second operand 9 states. [2019-12-27 19:14:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:27,860 INFO L93 Difference]: Finished difference Result 116261 states and 536103 transitions. [2019-12-27 19:14:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:27,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:14:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:28,200 INFO L225 Difference]: With dead ends: 116261 [2019-12-27 19:14:28,201 INFO L226 Difference]: Without dead ends: 116250 [2019-12-27 19:14:28,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:14:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116250 states. [2019-12-27 19:14:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116250 to 34934. [2019-12-27 19:14:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 19:14:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 19:14:29,885 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 19:14:29,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:29,886 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 19:14:29,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 19:14:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:29,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:29,889 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 19:14:30,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:30,089 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 19:14:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -545632672, now seen corresponding path program 1 times [2019-12-27 19:14:30,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:30,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505678291] [2019-12-27 19:14:30,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:30,152 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 19:14:30,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505678291] [2019-12-27 19:14:30,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162871886] [2019-12-27 19:14:30,152 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 19:14:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:30,243 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:30,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:30,326 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 19:14:30,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:30,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:30,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [569415452] [2019-12-27 19:14:30,327 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:30,329 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:30,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:14:30,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:31,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:14:31,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:14:31,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:31,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:14:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:14:31,776 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 12 states. [2019-12-27 19:14:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:34,122 INFO L93 Difference]: Finished difference Result 129922 states and 588511 transitions. [2019-12-27 19:14:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:14:34,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 19:14:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:34,503 INFO L225 Difference]: With dead ends: 129922 [2019-12-27 19:14:34,503 INFO L226 Difference]: Without dead ends: 129904 [2019-12-27 19:14:34,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:14:34,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129904 states. [2019-12-27 19:14:36,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129904 to 35058. [2019-12-27 19:14:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35058 states. [2019-12-27 19:14:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35058 states to 35058 states and 189558 transitions. [2019-12-27 19:14:36,763 INFO L78 Accepts]: Start accepts. Automaton has 35058 states and 189558 transitions. Word has length 25 [2019-12-27 19:14:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:36,763 INFO L462 AbstractCegarLoop]: Abstraction has 35058 states and 189558 transitions. [2019-12-27 19:14:36,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:14:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 35058 states and 189558 transitions. [2019-12-27 19:14:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:36,766 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:36,766 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 19:14:36,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:36,967 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 19:14:36,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:36,967 INFO L82 PathProgramCache]: Analyzing trace with hash -545644576, now seen corresponding path program 3 times [2019-12-27 19:14:36,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:36,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159338258] [2019-12-27 19:14:36,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:37,024 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 19:14:37,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159338258] [2019-12-27 19:14:37,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227431852] [2019-12-27 19:14:37,025 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 19:14:37,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 19:14:37,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:37,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:37,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:37,194 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 19:14:37,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:37,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:37,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1726887293] [2019-12-27 19:14:37,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:37,196 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:37,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:14:37,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:37,262 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:14:37,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:14:37,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:37,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:14:37,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:14:37,262 INFO L87 Difference]: Start difference. First operand 35058 states and 189558 transitions. Second operand 12 states. [2019-12-27 19:14:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:39,550 INFO L93 Difference]: Finished difference Result 128374 states and 580360 transitions. [2019-12-27 19:14:39,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:14:39,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 19:14:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:39,931 INFO L225 Difference]: With dead ends: 128374 [2019-12-27 19:14:39,931 INFO L226 Difference]: Without dead ends: 128356 [2019-12-27 19:14:39,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:14:40,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128356 states. [2019-12-27 19:14:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128356 to 34750. [2019-12-27 19:14:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34750 states. [2019-12-27 19:14:42,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34750 states to 34750 states and 187700 transitions. [2019-12-27 19:14:42,371 INFO L78 Accepts]: Start accepts. Automaton has 34750 states and 187700 transitions. Word has length 25 [2019-12-27 19:14:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:42,371 INFO L462 AbstractCegarLoop]: Abstraction has 34750 states and 187700 transitions. [2019-12-27 19:14:42,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:14:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 34750 states and 187700 transitions. [2019-12-27 19:14:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:42,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:42,374 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 19:14:42,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:42,575 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 19:14:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash -530395552, now seen corresponding path program 2 times [2019-12-27 19:14:42,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:42,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998263602] [2019-12-27 19:14:42,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:42,628 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 19:14:42,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998263602] [2019-12-27 19:14:42,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130374382] [2019-12-27 19:14:42,629 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 19:14:42,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:14:42,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:42,720 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:42,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:42,800 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 19:14:42,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:42,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:42,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1068827896] [2019-12-27 19:14:42,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:42,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:42,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:14:42,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:42,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:14:42,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:14:42,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:42,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:14:42,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:14:42,922 INFO L87 Difference]: Start difference. First operand 34750 states and 187700 transitions. Second operand 16 states. [2019-12-27 19:14:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:45,788 INFO L93 Difference]: Finished difference Result 132603 states and 593294 transitions. [2019-12-27 19:14:45,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:14:45,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 19:14:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:46,158 INFO L225 Difference]: With dead ends: 132603 [2019-12-27 19:14:46,159 INFO L226 Difference]: Without dead ends: 132580 [2019-12-27 19:14:46,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1255, Invalid=4597, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 19:14:46,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132580 states. [2019-12-27 19:14:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132580 to 34277. [2019-12-27 19:14:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-27 19:14:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 184965 transitions. [2019-12-27 19:14:48,672 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 184965 transitions. Word has length 25 [2019-12-27 19:14:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:48,672 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 184965 transitions. [2019-12-27 19:14:48,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:14:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 184965 transitions. [2019-12-27 19:14:48,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:48,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:48,674 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 19:14:48,875 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:48,875 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 19:14:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash -541835296, now seen corresponding path program 4 times [2019-12-27 19:14:48,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:48,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478274039] [2019-12-27 19:14:48,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:48,942 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 19:14:48,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478274039] [2019-12-27 19:14:48,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332385004] [2019-12-27 19:14:48,942 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 19:14:49,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:14:49,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:49,035 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:49,035 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:49,119 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 19:14:49,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:49,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:49,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168642355] [2019-12-27 19:14:49,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:49,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:49,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:14:49,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:49,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 19:14:49,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 19:14:49,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:49,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 19:14:49,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:14:49,313 INFO L87 Difference]: Start difference. First operand 34277 states and 184965 transitions. Second operand 18 states. [2019-12-27 19:14:52,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:52,292 INFO L93 Difference]: Finished difference Result 128459 states and 572031 transitions. [2019-12-27 19:14:52,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:14:52,292 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-12-27 19:14:52,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:52,708 INFO L225 Difference]: With dead ends: 128459 [2019-12-27 19:14:52,708 INFO L226 Difference]: Without dead ends: 128440 [2019-12-27 19:14:52,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1361, Invalid=4801, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 19:14:52,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128440 states. [2019-12-27 19:14:57,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128440 to 33768. [2019-12-27 19:14:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 19:14:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182281 transitions. [2019-12-27 19:14:57,936 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182281 transitions. Word has length 25 [2019-12-27 19:14:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:57,936 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182281 transitions. [2019-12-27 19:14:57,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 19:14:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182281 transitions. [2019-12-27 19:14:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:57,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:57,939 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 19:14:58,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:58,142 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 19:14:58,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:58,143 INFO L82 PathProgramCache]: Analyzing trace with hash -298046732, now seen corresponding path program 3 times [2019-12-27 19:14:58,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:58,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229320067] [2019-12-27 19:14:58,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:58,218 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 19:14:58,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229320067] [2019-12-27 19:14:58,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085005717] [2019-12-27 19:14:58,219 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 19:14:58,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:14:58,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:58,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:58,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:58,492 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 19:14:58,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:58,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:58,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175541641] [2019-12-27 19:14:58,493 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:58,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:58,510 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:14:58,510 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:58,511 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:14:58,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:58,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:58,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:14:58,512 INFO L87 Difference]: Start difference. First operand 33768 states and 182281 transitions. Second operand 9 states. Received shutdown request... [2019-12-27 19:14:59,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:59,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:59,649 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:14:59,655 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:14:59,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:14:59 BasicIcfg [2019-12-27 19:14:59,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:14:59,656 INFO L168 Benchmark]: Toolchain (without parser) took 232393.42 ms. Allocated memory was 139.5 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 102.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 19:14:59,657 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 19:14:59,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.92 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.1 MB in the beginning and 164.3 MB in the end (delta: -62.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 19:14:59,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 204.5 MB. Free memory was 163.6 MB in the beginning and 161.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 19:14:59,658 INFO L168 Benchmark]: Boogie Preprocessor took 25.11 ms. Allocated memory is still 204.5 MB. Free memory was 161.7 MB in the beginning and 160.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:14:59,658 INFO L168 Benchmark]: RCFGBuilder took 397.16 ms. Allocated memory is still 204.5 MB. Free memory was 160.4 MB in the beginning and 140.8 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:14:59,658 INFO L168 Benchmark]: TraceAbstraction took 231210.66 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 140.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 19:14:59,660 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.22 ms. Allocated memory is still 139.5 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.92 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 102.1 MB in the beginning and 164.3 MB in the end (delta: -62.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 204.5 MB. Free memory was 163.6 MB in the beginning and 161.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.11 ms. Allocated memory is still 204.5 MB. Free memory was 161.7 MB in the beginning and 160.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 397.16 ms. Allocated memory is still 204.5 MB. Free memory was 160.4 MB in the beginning and 140.8 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231210.66 ms. Allocated memory was 204.5 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 140.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 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.4s, 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.5s, 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: 1.8s, 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.7s, 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.4s, 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 BasicCegarLoop was constructing difference of abstraction (33768states) and FLOYD_HOARE automaton (currently 29 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (24499 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Result: TIMEOUT, OverallTime: 127.1s, OverallIterations: 32, TraceHistogramMax: 4, AutomataDifference: 50.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1917 SDtfs, 8453 SDslu, 6037 SDs, 0 SdLazy, 13052 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1327 GetRequests, 361 SyntacticMatches, 8 SemanticMatches, 958 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12038 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35912occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 61.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 1743395 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1089 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1038 ConstructedInterpolants, 0 QuantifiedInterpolants, 146236 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2119 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 51 InterpolantComputations, 13 PerfectInterpolantSequences, 320/648 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