/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 00:20:23,480 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 00:20:23,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 00:20:23,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 00:20:23,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 00:20:23,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 00:20:23,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 00:20:23,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 00:20:23,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 00:20:23,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 00:20:23,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 00:20:23,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 00:20:23,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 00:20:23,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 00:20:23,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 00:20:23,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 00:20:23,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 00:20:23,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 00:20:23,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 00:20:23,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 00:20:23,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 00:20:23,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 00:20:23,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 00:20:23,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 00:20:23,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 00:20:23,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 00:20:23,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 00:20:23,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 00:20:23,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 00:20:23,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 00:20:23,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 00:20:23,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 00:20:23,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 00:20:23,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 00:20:23,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 00:20:23,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 00:20:23,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 00:20:23,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 00:20:23,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 00:20:23,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 00:20:23,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 00:20:23,562 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-27 00:20:23,590 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 00:20:23,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 00:20:23,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 00:20:23,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 00:20:23,594 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 00:20:23,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 00:20:23,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 00:20:23,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 00:20:23,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 00:20:23,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 00:20:23,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 00:20:23,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 00:20:23,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 00:20:23,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 00:20:23,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 00:20:23,602 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 00:20:23,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 00:20:23,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 00:20:23,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 00:20:23,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 00:20:23,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 00:20:23,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 00:20:23,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 00:20:23,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 00:20:23,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 00:20:23,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 00:20:23,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 00:20:23,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 00:20:23,604 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-27 00:20:23,605 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 00:20:23,868 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 00:20:23,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 00:20:23,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 00:20:23,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 00:20:23,888 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 00:20:23,889 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-27 00:20:23,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6800e44e7/e8908dc043c1443fb00fcbf6a9989a6a/FLAG3a25636aa [2019-12-27 00:20:24,502 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 00:20:24,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-lit/fkp2013-1.i [2019-12-27 00:20:24,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6800e44e7/e8908dc043c1443fb00fcbf6a9989a6a/FLAG3a25636aa [2019-12-27 00:20:24,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6800e44e7/e8908dc043c1443fb00fcbf6a9989a6a [2019-12-27 00:20:24,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 00:20:24,810 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 00:20:24,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 00:20:24,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 00:20:24,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 00:20:24,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:20:24" (1/1) ... [2019-12-27 00:20:24,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5131fd0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:24, skipping insertion in model container [2019-12-27 00:20:24,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:20:24" (1/1) ... [2019-12-27 00:20:24,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 00:20:24,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 00:20:25,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:20:25,442 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 00:20:25,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 00:20:25,584 INFO L208 MainTranslator]: Completed translation [2019-12-27 00:20:25,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25 WrapperNode [2019-12-27 00:20:25,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 00:20:25,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 00:20:25,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 00:20:25,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 00:20:25,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 00:20:25,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 00:20:25,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 00:20:25,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 00:20:25,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (1/1) ... [2019-12-27 00:20:25,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 00:20:25,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 00:20:25,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 00:20:25,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 00:20:25,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (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 00:20:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 00:20:25,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 00:20:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 00:20:25,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 00:20:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 00:20:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 00:20:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 00:20:25,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 00:20:25,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 00:20:25,735 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 00:20:26,081 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 00:20:26,081 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 00:20:26,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:20:26 BoogieIcfgContainer [2019-12-27 00:20:26,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 00:20:26,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 00:20:26,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 00:20:26,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 00:20:26,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:20:24" (1/3) ... [2019-12-27 00:20:26,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcb28b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:20:26, skipping insertion in model container [2019-12-27 00:20:26,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:20:25" (2/3) ... [2019-12-27 00:20:26,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcb28b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:20:26, skipping insertion in model container [2019-12-27 00:20:26,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:20:26" (3/3) ... [2019-12-27 00:20:26,092 INFO L109 eAbstractionObserver]: Analyzing ICFG fkp2013-1.i [2019-12-27 00:20:26,102 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 00:20:26,103 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 00:20:26,110 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 00:20:26,110 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 00:20:26,141 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,141 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,142 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,142 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,143 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,144 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,144 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,145 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,145 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,146 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,146 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,147 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,147 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,148 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,157 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,157 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,158 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,158 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,158 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,178 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,178 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,179 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,179 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,179 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:26,192 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 00:20:26,208 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:20:26,208 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:20:26,208 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:20:26,208 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:20:26,209 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:20:26,209 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:20:26,209 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:20:26,209 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:20:26,221 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions [2019-12-27 00:20:26,223 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 00:20:26,266 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 00:20:26,267 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:20:26,273 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 00:20:26,277 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions [2019-12-27 00:20:26,300 INFO L132 PetriNetUnfolder]: 3/61 cut-off events. [2019-12-27 00:20:26,300 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 00:20:26,301 INFO L76 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 61 events. 3/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs. 0/55 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2019-12-27 00:20:26,305 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 692 [2019-12-27 00:20:26,307 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:20:27,479 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 00:20:27,629 INFO L206 etLargeBlockEncoding]: Checked pairs total: 524 [2019-12-27 00:20:27,629 INFO L214 etLargeBlockEncoding]: Total number of compositions: 42 [2019-12-27 00:20:27,634 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 00:20:27,648 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 00:20:27,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 00:20:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:20:27,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:27,659 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:20:27,660 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:20:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash 203253, now seen corresponding path program 1 times [2019-12-27 00:20:27,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:27,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541257297] [2019-12-27 00:20:27,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:27,874 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 00:20:27,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541257297] [2019-12-27 00:20:27,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:27,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:20:27,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985535116] [2019-12-27 00:20:27,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:27,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:27,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:27,907 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 00:20:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:27,944 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 00:20:27,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:27,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:20:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:27,958 INFO L225 Difference]: With dead ends: 35 [2019-12-27 00:20:27,959 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 00:20:27,960 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 00:20:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 00:20:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 00:20:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 00:20:27,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 00:20:28,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 00:20:28,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:28,001 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 00:20:28,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 00:20:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 00:20:28,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:28,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:28,002 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:20:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:28,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1281245876, now seen corresponding path program 1 times [2019-12-27 00:20:28,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:28,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615199751] [2019-12-27 00:20:28,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:28,125 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 00:20:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615199751] [2019-12-27 00:20:28,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:28,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 00:20:28,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372777667] [2019-12-27 00:20:28,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 00:20:28,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:28,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 00:20:28,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 00:20:28,129 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 00:20:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:28,149 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 00:20:28,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 00:20:28,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 00:20:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:28,150 INFO L225 Difference]: With dead ends: 26 [2019-12-27 00:20:28,151 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 00:20:28,152 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 00:20:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 00:20:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 00:20:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 00:20:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 00:20:28,159 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 00:20:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:28,159 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 00:20:28,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 00:20:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 00:20:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 00:20:28,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:28,161 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:28,161 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 00:20:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1063926653, now seen corresponding path program 1 times [2019-12-27 00:20:28,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:28,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105706680] [2019-12-27 00:20:28,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:28,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:20:28,274 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:20:28,275 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:20:28,275 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 00:20:28,290 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,290 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,291 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,291 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,291 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,291 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,292 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,292 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,292 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,292 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,292 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,293 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,293 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,293 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,294 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,294 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,294 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,294 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,296 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,296 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,296 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,297 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,297 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,297 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,297 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,297 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,298 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,298 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,298 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,298 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,299 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,299 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,299 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,299 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,300 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,300 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,300 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,300 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,300 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,301 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,301 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,301 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,302 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,302 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,302 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,302 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,302 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,304 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,304 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,305 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,305 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,305 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,307 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,307 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,308 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,308 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,308 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,308 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,310 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,310 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,310 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,310 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,311 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,311 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:28,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 00:20:28,313 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:20:28,313 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:20:28,313 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:20:28,313 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:20:28,313 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:20:28,313 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:20:28,314 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:20:28,314 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:20:28,316 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 00:20:28,316 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 00:20:28,338 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 00:20:28,339 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 00:20:28,341 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 00:20:28,345 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 00:20:28,364 INFO L132 PetriNetUnfolder]: 4/83 cut-off events. [2019-12-27 00:20:28,364 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 00:20:28,366 INFO L76 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 4/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 134 event pairs. 0/75 useless extension candidates. Maximal degree in co-relation 92. Up to 6 conditions per place. [2019-12-27 00:20:28,371 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1108 [2019-12-27 00:20:28,371 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:20:29,467 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 00:20:29,841 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1164 [2019-12-27 00:20:29,841 INFO L214 etLargeBlockEncoding]: Total number of compositions: 55 [2019-12-27 00:20:29,841 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 00:20:29,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 00:20:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 00:20:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:20:29,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:29,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:20:29,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash 348690, now seen corresponding path program 1 times [2019-12-27 00:20:29,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:29,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253995957] [2019-12-27 00:20:29,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:29,914 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 00:20:29,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253995957] [2019-12-27 00:20:29,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:29,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:20:29,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484732616] [2019-12-27 00:20:29,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:29,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:29,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:29,917 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 00:20:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:29,952 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 00:20:29,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:29,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:20:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:29,957 INFO L225 Difference]: With dead ends: 185 [2019-12-27 00:20:29,957 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 00:20:29,958 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 00:20:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 00:20:29,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 00:20:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 00:20:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 00:20:29,989 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 00:20:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:29,990 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 00:20:29,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 00:20:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:20:29,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:29,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:29,991 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash -772734140, now seen corresponding path program 1 times [2019-12-27 00:20:29,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:29,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982836825] [2019-12-27 00:20:29,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:30,058 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 00:20:30,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982836825] [2019-12-27 00:20:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:30,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:30,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942509807] [2019-12-27 00:20:30,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:30,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:30,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:30,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:30,060 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 00:20:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:30,136 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 00:20:30,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:30,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:20:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:30,141 INFO L225 Difference]: With dead ends: 204 [2019-12-27 00:20:30,141 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 00:20:30,141 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 00:20:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 00:20:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 00:20:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 00:20:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 00:20:30,162 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 00:20:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:30,162 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 00:20:30,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:30,162 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 00:20:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:20:30,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:30,163 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:30,164 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1323473150, now seen corresponding path program 1 times [2019-12-27 00:20:30,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:30,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287243560] [2019-12-27 00:20:30,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:30,257 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 00:20:30,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287243560] [2019-12-27 00:20:30,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:30,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:30,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474572094] [2019-12-27 00:20:30,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:30,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:30,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:30,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:30,260 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 00:20:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:30,315 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 00:20:30,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:30,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:20:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:30,319 INFO L225 Difference]: With dead ends: 189 [2019-12-27 00:20:30,319 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 00:20:30,320 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 00:20:30,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 00:20:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 00:20:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 00:20:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 00:20:30,336 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 00:20:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:30,338 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 00:20:30,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 00:20:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 00:20:30,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:30,339 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:30,340 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:20:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1919381761, now seen corresponding path program 1 times [2019-12-27 00:20:30,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:30,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827995420] [2019-12-27 00:20:30,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:30,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:20:30,372 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:20:30,372 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:20:30,372 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 00:20:30,382 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,382 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,382 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,382 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,383 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,383 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,383 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,383 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,384 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,384 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,384 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,384 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,385 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,385 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,385 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,385 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,385 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,386 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,386 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,387 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,387 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,387 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,387 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,387 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,388 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,388 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,389 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,389 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,389 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,389 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,390 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,390 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,390 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,390 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,390 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,391 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,391 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,391 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,391 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,392 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,392 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,393 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,393 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,394 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,394 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,394 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,394 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,395 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,395 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,396 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,396 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,397 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,397 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,397 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,398 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,398 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,399 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,399 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,399 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,400 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,400 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,401 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,401 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,402 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,402 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,403 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,403 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,404 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,404 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,405 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,405 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:30,406 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 00:20:30,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:20:30,407 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:20:30,407 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:20:30,407 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:20:30,407 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:20:30,407 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:20:30,407 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:20:30,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:20:30,410 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 87 transitions [2019-12-27 00:20:30,410 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 00:20:30,429 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 00:20:30,429 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 00:20:30,431 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 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 00:20:30,435 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions [2019-12-27 00:20:30,453 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 00:20:30,454 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 00:20:30,456 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 173 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 00:20:30,459 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1608 [2019-12-27 00:20:30,459 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:20:31,958 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 00:20:32,020 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1613 [2019-12-27 00:20:32,021 INFO L214 etLargeBlockEncoding]: Total number of compositions: 72 [2019-12-27 00:20:32,021 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 00:20:32,046 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 00:20:32,046 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 00:20:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:20:32,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:32,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:20:32,047 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 00:20:32,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 527830, now seen corresponding path program 1 times [2019-12-27 00:20:32,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:32,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11682645] [2019-12-27 00:20:32,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:32,072 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 00:20:32,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11682645] [2019-12-27 00:20:32,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:32,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:20:32,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88004732] [2019-12-27 00:20:32,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:32,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:32,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:32,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:32,074 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 00:20:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:32,120 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 00:20:32,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:32,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:20:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:32,127 INFO L225 Difference]: With dead ends: 600 [2019-12-27 00:20:32,127 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 00:20:32,127 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 00:20:32,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 00:20:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 00:20:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 00:20:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 00:20:32,166 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 00:20:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:32,166 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 00:20:32,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 00:20:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:20:32,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:32,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:32,167 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 00:20:32,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1521627850, now seen corresponding path program 1 times [2019-12-27 00:20:32,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:32,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226761692] [2019-12-27 00:20:32,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:32,206 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 00:20:32,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226761692] [2019-12-27 00:20:32,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:32,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:32,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010104120] [2019-12-27 00:20:32,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:32,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:32,209 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 00:20:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:32,290 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 00:20:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:32,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:20:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:32,298 INFO L225 Difference]: With dead ends: 802 [2019-12-27 00:20:32,298 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 00:20:32,299 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 00:20:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 00:20:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 00:20:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 00:20:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 00:20:32,331 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 00:20:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:32,332 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 00:20:32,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 00:20:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:20:32,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:32,339 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:32,339 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 00:20:32,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash -311693869, now seen corresponding path program 1 times [2019-12-27 00:20:32,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:32,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171810056] [2019-12-27 00:20:32,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:32,392 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 00:20:32,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171810056] [2019-12-27 00:20:32,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:32,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:32,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437260114] [2019-12-27 00:20:32,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:32,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:32,394 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 00:20:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:32,466 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 00:20:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:32,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:20:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:32,473 INFO L225 Difference]: With dead ends: 832 [2019-12-27 00:20:32,473 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 00:20:32,473 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 00:20:32,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 00:20:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 00:20:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 00:20:32,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 00:20:32,498 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 00:20:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:32,498 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 00:20:32,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:32,498 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 00:20:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:20:32,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:32,499 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:32,499 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 00:20:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1756107436, now seen corresponding path program 1 times [2019-12-27 00:20:32,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:32,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217081044] [2019-12-27 00:20:32,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:32,548 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 00:20:32,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217081044] [2019-12-27 00:20:32,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409855827] [2019-12-27 00:20:32,549 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 00:20:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:32,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:20:32,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:32,683 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 00:20:32,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:32,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:20:32,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944181227] [2019-12-27 00:20:32,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:32,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:32,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:32,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:32,686 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-27 00:20:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:32,867 INFO L93 Difference]: Finished difference Result 1052 states and 2813 transitions. [2019-12-27 00:20:32,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:32,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 00:20:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:32,875 INFO L225 Difference]: With dead ends: 1052 [2019-12-27 00:20:32,875 INFO L226 Difference]: Without dead ends: 1048 [2019-12-27 00:20:32,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-12-27 00:20:32,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 587. [2019-12-27 00:20:32,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 00:20:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 00:20:32,900 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 00:20:32,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:32,901 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 00:20:32,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 00:20:32,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:20:32,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:32,902 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:33,107 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:33,107 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 00:20:33,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:33,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1109903596, now seen corresponding path program 2 times [2019-12-27 00:20:33,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:33,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65202111] [2019-12-27 00:20:33,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:33,158 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 00:20:33,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65202111] [2019-12-27 00:20:33,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:33,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:33,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348945222] [2019-12-27 00:20:33,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:20:33,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:20:33,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:33,160 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 00:20:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:33,358 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 00:20:33,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:33,359 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:20:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:33,368 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 00:20:33,368 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 00:20:33,368 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 00:20:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 00:20:33,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 00:20:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 00:20:33,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 00:20:33,394 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 00:20:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:33,395 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 00:20:33,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:20:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 00:20:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:20:33,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:33,396 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:33,397 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 00:20:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash -436948988, now seen corresponding path program 1 times [2019-12-27 00:20:33,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:33,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39449295] [2019-12-27 00:20:33,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:20:33,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39449295] [2019-12-27 00:20:33,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:33,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:33,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22064778] [2019-12-27 00:20:33,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:33,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:33,525 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 00:20:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:33,607 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 00:20:33,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:33,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:20:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:33,613 INFO L225 Difference]: With dead ends: 736 [2019-12-27 00:20:33,614 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 00:20:33,614 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 00:20:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 00:20:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 00:20:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 00:20:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 00:20:33,635 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 00:20:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:33,635 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 00:20:33,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 00:20:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 00:20:33,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:33,637 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:33,637 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 00:20:33,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash -663795530, now seen corresponding path program 1 times [2019-12-27 00:20:33,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:33,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032091772] [2019-12-27 00:20:33,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:33,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:20:33,686 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:20:33,687 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:20:33,687 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 00:20:33,702 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,703 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,703 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,704 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,704 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,704 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,708 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,708 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,708 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,708 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,709 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,709 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,709 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,715 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,715 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,716 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,716 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,717 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,717 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,717 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,717 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,718 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,720 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,720 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,720 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,721 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,721 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,723 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,724 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,724 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,728 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,728 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,728 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,729 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,729 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,730 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,731 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,731 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,731 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,731 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,731 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,733 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,733 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,733 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,733 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,733 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,734 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,739 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,739 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,740 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,740 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:33,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 00:20:33,742 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:20:33,742 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:20:33,743 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:20:33,743 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:20:33,743 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:20:33,743 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:20:33,743 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:20:33,743 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:20:33,744 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 105 transitions [2019-12-27 00:20:33,745 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 00:20:33,767 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 00:20:33,767 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 00:20:33,769 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 00:20:33,774 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 118 places, 105 transitions [2019-12-27 00:20:33,792 INFO L132 PetriNetUnfolder]: 6/127 cut-off events. [2019-12-27 00:20:33,792 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 00:20:33,794 INFO L76 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 127 events. 6/127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs. 0/115 useless extension candidates. Maximal degree in co-relation 147. Up to 10 conditions per place. [2019-12-27 00:20:33,799 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2192 [2019-12-27 00:20:33,799 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:20:35,350 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 00:20:35,709 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2358 [2019-12-27 00:20:35,709 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2019-12-27 00:20:35,709 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 00:20:35,816 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 00:20:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 00:20:35,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:20:35,817 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:35,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:20:35,817 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 00:20:35,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:35,818 INFO L82 PathProgramCache]: Analyzing trace with hash 738879, now seen corresponding path program 1 times [2019-12-27 00:20:35,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:35,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622350192] [2019-12-27 00:20:35,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:35,834 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 00:20:35,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622350192] [2019-12-27 00:20:35,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:35,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:20:35,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759923926] [2019-12-27 00:20:35,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:35,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:35,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:35,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:35,840 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 00:20:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:35,897 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 00:20:35,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:35,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:20:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:35,913 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 00:20:35,914 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 00:20:35,914 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 00:20:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 00:20:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 00:20:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 00:20:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 00:20:35,981 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 00:20:35,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:35,981 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 00:20:35,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:35,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 00:20:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:20:35,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:35,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:35,982 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 00:20:35,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1226090643, now seen corresponding path program 1 times [2019-12-27 00:20:35,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:35,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880576007] [2019-12-27 00:20:35,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:36,015 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 00:20:36,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880576007] [2019-12-27 00:20:36,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:36,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:36,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787265500] [2019-12-27 00:20:36,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:36,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:36,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:36,017 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 00:20:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:36,100 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 00:20:36,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:36,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:20:36,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:36,124 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 00:20:36,125 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 00:20:36,125 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 00:20:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 00:20:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 00:20:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 00:20:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 00:20:36,209 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 00:20:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:36,210 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 00:20:36,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 00:20:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:20:36,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:36,211 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:36,211 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 00:20:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash 236764173, now seen corresponding path program 1 times [2019-12-27 00:20:36,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:36,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549968224] [2019-12-27 00:20:36,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:36,242 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 00:20:36,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549968224] [2019-12-27 00:20:36,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:36,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:36,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711833729] [2019-12-27 00:20:36,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:36,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:36,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:36,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:36,244 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 00:20:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:36,326 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 00:20:36,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:36,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:20:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:36,351 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 00:20:36,352 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 00:20:36,352 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 00:20:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 00:20:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 00:20:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 00:20:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 00:20:36,441 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 00:20:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:36,442 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 00:20:36,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 00:20:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:20:36,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:36,443 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:36,443 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 00:20:36,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:36,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2036551869, now seen corresponding path program 1 times [2019-12-27 00:20:36,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:36,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032435008] [2019-12-27 00:20:36,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 00:20:36,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032435008] [2019-12-27 00:20:36,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751708474] [2019-12-27 00:20:36,494 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 00:20:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:36,575 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:20:36,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:36,593 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 00:20:36,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:36,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:20:36,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060410427] [2019-12-27 00:20:36,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:36,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:36,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:36,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:36,595 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-27 00:20:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:36,839 INFO L93 Difference]: Finished difference Result 4460 states and 14778 transitions. [2019-12-27 00:20:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:36,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 00:20:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:36,864 INFO L225 Difference]: With dead ends: 4460 [2019-12-27 00:20:36,865 INFO L226 Difference]: Without dead ends: 4456 [2019-12-27 00:20:36,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:36,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2019-12-27 00:20:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 2109. [2019-12-27 00:20:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 00:20:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 00:20:36,965 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 00:20:36,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:36,965 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 00:20:36,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 00:20:36,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:20:36,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:36,967 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:37,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:37,179 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 00:20:37,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:37,179 INFO L82 PathProgramCache]: Analyzing trace with hash -102912933, now seen corresponding path program 2 times [2019-12-27 00:20:37,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:37,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848037055] [2019-12-27 00:20:37,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:37,235 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 00:20:37,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848037055] [2019-12-27 00:20:37,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:37,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:37,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341275947] [2019-12-27 00:20:37,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:20:37,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:20:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:37,239 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 00:20:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:37,473 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 00:20:37,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:37,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:20:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:37,501 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 00:20:37,501 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 00:20:37,506 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 00:20:37,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 00:20:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 00:20:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 00:20:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 00:20:37,604 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 00:20:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:37,604 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 00:20:37,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:20:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 00:20:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:20:37,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:37,606 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:37,606 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 00:20:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2147198306, now seen corresponding path program 1 times [2019-12-27 00:20:37,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:37,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155349331] [2019-12-27 00:20:37,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:37,652 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 00:20:37,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155349331] [2019-12-27 00:20:37,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:37,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:37,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992063584] [2019-12-27 00:20:37,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:37,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:37,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:37,654 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 00:20:37,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:37,735 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 00:20:37,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:37,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:20:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:37,748 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 00:20:37,748 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 00:20:37,748 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 00:20:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 00:20:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 00:20:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 00:20:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 00:20:37,827 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 00:20:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:37,827 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 00:20:37,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 00:20:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:37,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:37,829 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:37,829 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 00:20:37,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:37,829 INFO L82 PathProgramCache]: Analyzing trace with hash 557011806, now seen corresponding path program 1 times [2019-12-27 00:20:37,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:37,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946511469] [2019-12-27 00:20:37,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:20:37,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946511469] [2019-12-27 00:20:37,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060249414] [2019-12-27 00:20:37,959 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 00:20:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:38,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:20:38,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:20:38,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:38,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:20:38,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784281831] [2019-12-27 00:20:38,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:38,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:38,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:38,057 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 9 states. [2019-12-27 00:20:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:38,269 INFO L93 Difference]: Finished difference Result 4759 states and 15906 transitions. [2019-12-27 00:20:38,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:38,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 00:20:38,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:38,285 INFO L225 Difference]: With dead ends: 4759 [2019-12-27 00:20:38,286 INFO L226 Difference]: Without dead ends: 4753 [2019-12-27 00:20:38,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-12-27 00:20:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 2270. [2019-12-27 00:20:38,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 00:20:38,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 00:20:38,367 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 00:20:38,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:38,368 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 00:20:38,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 00:20:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:38,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:38,371 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:38,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:38,575 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 00:20:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:38,576 INFO L82 PathProgramCache]: Analyzing trace with hash 864407617, now seen corresponding path program 1 times [2019-12-27 00:20:38,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:38,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485943267] [2019-12-27 00:20:38,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 00:20:38,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485943267] [2019-12-27 00:20:38,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612292831] [2019-12-27 00:20:38,623 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 00:20:38,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:38,691 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:20:38,693 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:38,717 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 00:20:38,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:38,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:20:38,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604754384] [2019-12-27 00:20:38,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:38,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:38,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:38,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:38,720 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-27 00:20:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:38,961 INFO L93 Difference]: Finished difference Result 4884 states and 16344 transitions. [2019-12-27 00:20:38,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:38,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 00:20:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:38,979 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 00:20:38,979 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 00:20:38,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 00:20:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2267. [2019-12-27 00:20:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 00:20:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 00:20:39,137 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 00:20:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:39,137 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 00:20:39,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 00:20:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:39,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:39,139 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:39,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:39,348 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 00:20:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:39,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1873265869, now seen corresponding path program 2 times [2019-12-27 00:20:39,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:39,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589428081] [2019-12-27 00:20:39,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:39,401 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 00:20:39,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589428081] [2019-12-27 00:20:39,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:39,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:39,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715777895] [2019-12-27 00:20:39,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:20:39,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:20:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:39,403 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 00:20:39,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:39,616 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 00:20:39,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:39,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:20:39,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:39,633 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 00:20:39,634 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 00:20:39,635 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 00:20:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 00:20:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 00:20:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 00:20:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 00:20:39,712 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 00:20:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:39,713 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 00:20:39,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:20:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 00:20:39,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:39,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:39,715 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:39,716 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 00:20:39,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:39,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1873286484, now seen corresponding path program 2 times [2019-12-27 00:20:39,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:39,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915565979] [2019-12-27 00:20:39,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:39,769 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 00:20:39,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915565979] [2019-12-27 00:20:39,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:39,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:39,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542180689] [2019-12-27 00:20:39,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:20:39,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:20:39,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:39,771 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 00:20:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:39,980 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 00:20:39,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:39,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:20:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:39,992 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 00:20:39,992 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 00:20:39,992 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 00:20:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 00:20:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 00:20:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 00:20:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 00:20:40,068 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 00:20:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:40,068 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 00:20:40,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:20:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 00:20:40,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:40,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:40,070 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 00:20:40,070 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 00:20:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 356549993, now seen corresponding path program 1 times [2019-12-27 00:20:40,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:40,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496480057] [2019-12-27 00:20:40,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:20:40,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496480057] [2019-12-27 00:20:40,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766131861] [2019-12-27 00:20:40,135 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 00:20:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:40,201 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:20:40,204 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:40,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:20:40,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:40,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:20:40,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888467906] [2019-12-27 00:20:40,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:20:40,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:40,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:20:40,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:20:40,224 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 11 states. [2019-12-27 00:20:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:40,903 INFO L93 Difference]: Finished difference Result 5995 states and 18718 transitions. [2019-12-27 00:20:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:40,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:20:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:40,914 INFO L225 Difference]: With dead ends: 5995 [2019-12-27 00:20:40,914 INFO L226 Difference]: Without dead ends: 5991 [2019-12-27 00:20:40,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:20:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2019-12-27 00:20:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 2101. [2019-12-27 00:20:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 00:20:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 00:20:41,002 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 00:20:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:41,002 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 00:20:41,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:20:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 00:20:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:41,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:41,005 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 00:20:41,208 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:41,208 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 00:20:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1582562317, now seen corresponding path program 2 times [2019-12-27 00:20:41,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:41,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524576518] [2019-12-27 00:20:41,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:20:41,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524576518] [2019-12-27 00:20:41,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871890323] [2019-12-27 00:20:41,288 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 00:20:41,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:20:41,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:20:41,372 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:20:41,374 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-27 00:20:41,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:41,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:20:41,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007917709] [2019-12-27 00:20:41,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:20:41,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:41,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:20:41,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:20:41,396 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 11 states. [2019-12-27 00:20:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:41,918 INFO L93 Difference]: Finished difference Result 5889 states and 18361 transitions. [2019-12-27 00:20:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:41,918 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:20:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:41,926 INFO L225 Difference]: With dead ends: 5889 [2019-12-27 00:20:41,927 INFO L226 Difference]: Without dead ends: 5883 [2019-12-27 00:20:41,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:20:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2019-12-27 00:20:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 2071. [2019-12-27 00:20:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 00:20:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 00:20:42,074 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 00:20:42,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:42,075 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 00:20:42,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:20:42,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 00:20:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:42,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:42,077 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 00:20:42,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:42,278 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 00:20:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1260159245, now seen corresponding path program 3 times [2019-12-27 00:20:42,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:42,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308453320] [2019-12-27 00:20:42,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:42,362 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 00:20:42,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308453320] [2019-12-27 00:20:42,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001940922] [2019-12-27 00:20:42,363 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 00:20:42,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:20:42,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:20:42,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:20:42,474 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:42,523 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 00:20:42,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:42,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:20:42,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793178608] [2019-12-27 00:20:42,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:20:42,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:20:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:20:42,529 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 11 states. [2019-12-27 00:20:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:43,129 INFO L93 Difference]: Finished difference Result 5888 states and 18357 transitions. [2019-12-27 00:20:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:43,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:20:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:43,138 INFO L225 Difference]: With dead ends: 5888 [2019-12-27 00:20:43,139 INFO L226 Difference]: Without dead ends: 5884 [2019-12-27 00:20:43,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:20:43,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5884 states. [2019-12-27 00:20:43,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5884 to 1997. [2019-12-27 00:20:43,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 00:20:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 00:20:43,213 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 00:20:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:43,213 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 00:20:43,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:20:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 00:20:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:43,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:43,215 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 00:20:43,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:43,419 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 00:20:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:43,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1767015311, now seen corresponding path program 4 times [2019-12-27 00:20:43,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:43,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803830686] [2019-12-27 00:20:43,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:43,473 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 00:20:43,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803830686] [2019-12-27 00:20:43,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428573341] [2019-12-27 00:20:43,473 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 00:20:43,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:20:43,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:20:43,554 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:20:43,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:43,578 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 00:20:43,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:43,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:20:43,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853274815] [2019-12-27 00:20:43,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:20:43,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:43,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:20:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:20:43,580 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-27 00:20:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:44,174 INFO L93 Difference]: Finished difference Result 5819 states and 18141 transitions. [2019-12-27 00:20:44,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:44,174 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:20:44,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:44,182 INFO L225 Difference]: With dead ends: 5819 [2019-12-27 00:20:44,182 INFO L226 Difference]: Without dead ends: 5813 [2019-12-27 00:20:44,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:20:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5813 states. [2019-12-27 00:20:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5813 to 1967. [2019-12-27 00:20:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 00:20:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 00:20:44,232 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 00:20:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:44,232 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 00:20:44,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:20:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 00:20:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:44,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:44,234 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:44,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:44,438 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 00:20:44,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1366430690, now seen corresponding path program 1 times [2019-12-27 00:20:44,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:44,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753158908] [2019-12-27 00:20:44,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:44,476 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 00:20:44,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753158908] [2019-12-27 00:20:44,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:44,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:44,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949857780] [2019-12-27 00:20:44,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:44,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:44,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:44,478 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 00:20:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:44,541 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 00:20:44,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:44,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:20:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:44,549 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 00:20:44,549 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 00:20:44,550 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 00:20:44,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 00:20:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 00:20:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 00:20:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 00:20:44,616 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 00:20:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:44,616 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 00:20:44,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 00:20:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:44,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:44,619 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 00:20:44,619 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 00:20:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash -617219583, now seen corresponding path program 5 times [2019-12-27 00:20:44,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:44,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597015347] [2019-12-27 00:20:44,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:44,682 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 00:20:44,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597015347] [2019-12-27 00:20:44,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:44,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:20:44,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143290007] [2019-12-27 00:20:44,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:44,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:44,683 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 00:20:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:45,132 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 00:20:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:45,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:20:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:45,145 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 00:20:45,145 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 00:20:45,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:20:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 00:20:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 00:20:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 00:20:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 00:20:45,200 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 00:20:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:45,200 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 00:20:45,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 00:20:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:45,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:45,202 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 00:20:45,202 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 00:20:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash -637009983, now seen corresponding path program 6 times [2019-12-27 00:20:45,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:45,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735172161] [2019-12-27 00:20:45,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:45,295 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 00:20:45,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735172161] [2019-12-27 00:20:45,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:45,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:20:45,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570073135] [2019-12-27 00:20:45,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:45,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:45,296 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 00:20:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:45,857 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 00:20:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:45,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:20:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:45,866 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 00:20:45,867 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 00:20:45,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:20:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 00:20:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 00:20:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 00:20:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 00:20:45,939 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 00:20:45,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:45,939 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 00:20:45,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 00:20:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 00:20:45,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:45,942 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:45,942 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 00:20:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash -594503999, now seen corresponding path program 1 times [2019-12-27 00:20:45,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:45,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197007183] [2019-12-27 00:20:45,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:20:45,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:20:45,964 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:20:45,964 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:20:45,964 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 00:20:45,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,977 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,977 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,978 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,978 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,979 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,979 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,979 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,980 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,980 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,981 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,981 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,982 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,982 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,982 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,982 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,982 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,983 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,983 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,983 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,984 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,984 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,984 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,985 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,985 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,986 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,986 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,987 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,987 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,988 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,988 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,989 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,989 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,990 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,990 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,990 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,991 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,991 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,992 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,992 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,993 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,993 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,994 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,994 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,994 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,994 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,995 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,996 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,996 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,996 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,996 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,996 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,998 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,998 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,998 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,998 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,998 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,999 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:45,999 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,000 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,000 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,001 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,001 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,001 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,001 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,002 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,003 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,003 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,004 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,005 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,005 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,006 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,007 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,007 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,008 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,009 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,009 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,010 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,010 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,011 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,011 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:20:46,012 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 00:20:46,012 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:20:46,013 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:20:46,013 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:20:46,013 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:20:46,013 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:20:46,013 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:20:46,013 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:20:46,013 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:20:46,015 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 123 transitions [2019-12-27 00:20:46,016 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 00:20:46,045 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 00:20:46,045 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 00:20:46,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 00:20:46,055 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 123 transitions [2019-12-27 00:20:46,076 INFO L132 PetriNetUnfolder]: 7/149 cut-off events. [2019-12-27 00:20:46,077 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 00:20:46,079 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 149 events. 7/149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 252 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 176. Up to 12 conditions per place. [2019-12-27 00:20:46,086 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2860 [2019-12-27 00:20:46,086 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:20:47,682 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-12-27 00:20:48,144 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3115 [2019-12-27 00:20:48,144 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 00:20:48,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 00:20:48,581 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 00:20:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 00:20:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:20:48,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:48,582 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:20:48,582 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 00:20:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 983675, now seen corresponding path program 1 times [2019-12-27 00:20:48,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:48,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898171879] [2019-12-27 00:20:48,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:48,600 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 00:20:48,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898171879] [2019-12-27 00:20:48,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:48,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:20:48,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715137526] [2019-12-27 00:20:48,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:20:48,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:20:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:20:48,602 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 00:20:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:48,659 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 00:20:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:20:48,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:20:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:48,678 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 00:20:48,678 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 00:20:48,678 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 00:20:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 00:20:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 00:20:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 00:20:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 00:20:48,824 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 00:20:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:48,824 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 00:20:48,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:20:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 00:20:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:20:48,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:48,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:48,825 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 00:20:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -768832426, now seen corresponding path program 1 times [2019-12-27 00:20:48,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:48,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370727708] [2019-12-27 00:20:48,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:48,848 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 00:20:48,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370727708] [2019-12-27 00:20:48,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:48,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:48,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498515078] [2019-12-27 00:20:48,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:48,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:48,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:48,849 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 00:20:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:48,964 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 00:20:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:48,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:20:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:49,541 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 00:20:49,541 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 00:20:49,541 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 00:20:49,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 00:20:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 00:20:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 00:20:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 00:20:49,676 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 00:20:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:49,677 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 00:20:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 00:20:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:20:49,677 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:49,677 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:49,677 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 00:20:49,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:49,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1710988516, now seen corresponding path program 1 times [2019-12-27 00:20:49,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:49,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776863736] [2019-12-27 00:20:49,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:49,726 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 00:20:49,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776863736] [2019-12-27 00:20:49,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:49,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:49,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11320957] [2019-12-27 00:20:49,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:49,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:49,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:49,728 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 00:20:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:49,840 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 00:20:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:49,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:20:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:49,866 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 00:20:49,866 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 00:20:49,867 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 00:20:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 00:20:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 00:20:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 00:20:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 00:20:50,035 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 00:20:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:50,036 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 00:20:50,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 00:20:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:20:50,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:50,036 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:50,037 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 00:20:50,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:50,037 INFO L82 PathProgramCache]: Analyzing trace with hash 173591493, now seen corresponding path program 1 times [2019-12-27 00:20:50,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:50,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317400479] [2019-12-27 00:20:50,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:50,082 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 00:20:50,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317400479] [2019-12-27 00:20:50,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346481806] [2019-12-27 00:20:50,083 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 00:20:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:50,157 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:20:50,158 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:50,178 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 00:20:50,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:50,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:20:50,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709542093] [2019-12-27 00:20:50,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:50,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:50,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:50,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:50,180 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-27 00:20:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:50,555 INFO L93 Difference]: Finished difference Result 16250 states and 64977 transitions. [2019-12-27 00:20:50,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:50,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 00:20:50,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:50,594 INFO L225 Difference]: With dead ends: 16250 [2019-12-27 00:20:50,594 INFO L226 Difference]: Without dead ends: 16246 [2019-12-27 00:20:50,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16246 states. [2019-12-27 00:20:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16246 to 7067. [2019-12-27 00:20:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 00:20:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 00:20:50,810 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 00:20:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:50,810 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 00:20:50,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 00:20:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:20:50,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:50,811 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:51,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:51,012 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 00:20:51,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:51,013 INFO L82 PathProgramCache]: Analyzing trace with hash 712521883, now seen corresponding path program 2 times [2019-12-27 00:20:51,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:51,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630564143] [2019-12-27 00:20:51,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:51,072 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 00:20:51,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630564143] [2019-12-27 00:20:51,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:51,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:51,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254947992] [2019-12-27 00:20:51,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:20:51,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:20:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:51,074 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 00:20:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:51,363 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 00:20:51,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:51,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:20:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:51,404 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 00:20:51,404 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 00:20:51,405 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 00:20:51,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 00:20:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 00:20:51,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 00:20:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 00:20:51,725 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 00:20:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:51,725 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 00:20:51,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:20:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 00:20:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:20:51,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:51,726 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:51,726 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 00:20:51,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash -137837239, now seen corresponding path program 1 times [2019-12-27 00:20:51,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:51,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148738124] [2019-12-27 00:20:51,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:51,769 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 00:20:51,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148738124] [2019-12-27 00:20:51,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:51,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:20:51,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762472195] [2019-12-27 00:20:51,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:20:51,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:20:51,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:20:51,772 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 00:20:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:51,885 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 00:20:51,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:20:51,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:20:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:51,911 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 00:20:51,911 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 00:20:51,911 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 00:20:51,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 00:20:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 00:20:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 00:20:52,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 00:20:52,084 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 00:20:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:52,084 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 00:20:52,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:20:52,084 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 00:20:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:52,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:52,086 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:52,086 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 00:20:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:52,086 INFO L82 PathProgramCache]: Analyzing trace with hash 411145966, now seen corresponding path program 1 times [2019-12-27 00:20:52,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:52,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647594395] [2019-12-27 00:20:52,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:52,143 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 00:20:52,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647594395] [2019-12-27 00:20:52,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471358457] [2019-12-27 00:20:52,144 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 00:20:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:52,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:20:52,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:52,240 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 00:20:52,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:52,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:20:52,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006642148] [2019-12-27 00:20:52,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:52,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:52,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:52,242 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 9 states. [2019-12-27 00:20:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:52,525 INFO L93 Difference]: Finished difference Result 18509 states and 75177 transitions. [2019-12-27 00:20:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:52,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 00:20:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:52,567 INFO L225 Difference]: With dead ends: 18509 [2019-12-27 00:20:52,567 INFO L226 Difference]: Without dead ends: 18503 [2019-12-27 00:20:52,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18503 states. [2019-12-27 00:20:52,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18503 to 8204. [2019-12-27 00:20:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 00:20:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 00:20:52,926 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 00:20:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:52,926 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 00:20:52,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 00:20:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:52,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:52,927 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:53,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:53,128 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 00:20:53,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1348912267, now seen corresponding path program 1 times [2019-12-27 00:20:53,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:53,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167426285] [2019-12-27 00:20:53,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:53,183 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 00:20:53,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167426285] [2019-12-27 00:20:53,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70580570] [2019-12-27 00:20:53,184 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 00:20:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:53,269 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:20:53,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:53,303 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 00:20:53,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:53,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:20:53,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937613814] [2019-12-27 00:20:53,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:20:53,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:53,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:20:53,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:20:53,306 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 9 states. [2019-12-27 00:20:53,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:53,779 INFO L93 Difference]: Finished difference Result 19158 states and 78016 transitions. [2019-12-27 00:20:53,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:53,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 00:20:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:53,863 INFO L225 Difference]: With dead ends: 19158 [2019-12-27 00:20:53,864 INFO L226 Difference]: Without dead ends: 19149 [2019-12-27 00:20:53,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:20:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19149 states. [2019-12-27 00:20:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19149 to 8237. [2019-12-27 00:20:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 00:20:54,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 38262 transitions. [2019-12-27 00:20:54,235 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 38262 transitions. Word has length 19 [2019-12-27 00:20:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:54,235 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 38262 transitions. [2019-12-27 00:20:54,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:20:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 38262 transitions. [2019-12-27 00:20:54,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:54,236 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:54,236 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:54,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:54,440 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 00:20:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash 682417739, now seen corresponding path program 2 times [2019-12-27 00:20:54,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:54,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871474381] [2019-12-27 00:20:54,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:54,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 00:20:54,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871474381] [2019-12-27 00:20:54,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:54,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:54,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528368211] [2019-12-27 00:20:54,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:20:54,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:54,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:20:54,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:54,484 INFO L87 Difference]: Start difference. First operand 8237 states and 38262 transitions. Second operand 7 states. [2019-12-27 00:20:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:54,865 INFO L93 Difference]: Finished difference Result 19350 states and 78857 transitions. [2019-12-27 00:20:54,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:54,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:20:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:54,908 INFO L225 Difference]: With dead ends: 19350 [2019-12-27 00:20:54,908 INFO L226 Difference]: Without dead ends: 19341 [2019-12-27 00:20:54,908 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 00:20:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19341 states. [2019-12-27 00:20:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19341 to 8154. [2019-12-27 00:20:55,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8154 states. [2019-12-27 00:20:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 37883 transitions. [2019-12-27 00:20:55,148 INFO L78 Accepts]: Start accepts. Automaton has 8154 states and 37883 transitions. Word has length 19 [2019-12-27 00:20:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:55,148 INFO L462 AbstractCegarLoop]: Abstraction has 8154 states and 37883 transitions. [2019-12-27 00:20:55,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:20:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 8154 states and 37883 transitions. [2019-12-27 00:20:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:20:55,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:55,150 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:55,150 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 00:20:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 682410888, now seen corresponding path program 2 times [2019-12-27 00:20:55,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:55,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40200104] [2019-12-27 00:20:55,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:55,198 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 00:20:55,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40200104] [2019-12-27 00:20:55,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:20:55,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:20:55,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264687578] [2019-12-27 00:20:55,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:20:55,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:20:55,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:20:55,200 INFO L87 Difference]: Start difference. First operand 8154 states and 37883 transitions. Second operand 7 states. [2019-12-27 00:20:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:55,501 INFO L93 Difference]: Finished difference Result 19087 states and 77644 transitions. [2019-12-27 00:20:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:20:55,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:20:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:55,548 INFO L225 Difference]: With dead ends: 19087 [2019-12-27 00:20:55,549 INFO L226 Difference]: Without dead ends: 19078 [2019-12-27 00:20:55,549 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 00:20:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2019-12-27 00:20:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 8107. [2019-12-27 00:20:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 00:20:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 00:20:55,800 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 00:20:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:55,800 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 00:20:55,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:20:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 00:20:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:55,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:55,802 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 00:20:55,802 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 00:20:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:55,803 INFO L82 PathProgramCache]: Analyzing trace with hash -20610704, now seen corresponding path program 1 times [2019-12-27 00:20:55,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:55,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585117806] [2019-12-27 00:20:55,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:55,859 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 00:20:55,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585117806] [2019-12-27 00:20:55,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221765804] [2019-12-27 00:20:55,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:55,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:20:55,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:55,961 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 00:20:55,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:55,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:20:55,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008290332] [2019-12-27 00:20:55,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:20:55,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:20:55,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:20:55,966 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 11 states. [2019-12-27 00:20:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:56,670 INFO L93 Difference]: Finished difference Result 26399 states and 100480 transitions. [2019-12-27 00:20:56,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:56,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:20:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:56,730 INFO L225 Difference]: With dead ends: 26399 [2019-12-27 00:20:56,730 INFO L226 Difference]: Without dead ends: 26395 [2019-12-27 00:20:56,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:20:56,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2019-12-27 00:20:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 7999. [2019-12-27 00:20:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7999 states. [2019-12-27 00:20:57,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7999 states to 7999 states and 37154 transitions. [2019-12-27 00:20:57,021 INFO L78 Accepts]: Start accepts. Automaton has 7999 states and 37154 transitions. Word has length 21 [2019-12-27 00:20:57,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:57,021 INFO L462 AbstractCegarLoop]: Abstraction has 7999 states and 37154 transitions. [2019-12-27 00:20:57,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:20:57,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7999 states and 37154 transitions. [2019-12-27 00:20:57,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:57,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:57,023 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 00:20:57,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:57,223 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 00:20:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash -25699664, now seen corresponding path program 2 times [2019-12-27 00:20:57,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:57,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911433518] [2019-12-27 00:20:57,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:57,276 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 00:20:57,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911433518] [2019-12-27 00:20:57,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648709389] [2019-12-27 00:20:57,277 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:57,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:20:57,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:20:57,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:20:57,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:57,384 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 00:20:57,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:57,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:20:57,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961775235] [2019-12-27 00:20:57,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:20:57,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:57,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:20:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:20:57,386 INFO L87 Difference]: Start difference. First operand 7999 states and 37154 transitions. Second operand 11 states. [2019-12-27 00:20:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:58,136 INFO L93 Difference]: Finished difference Result 26109 states and 99244 transitions. [2019-12-27 00:20:58,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:58,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:20:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:58,345 INFO L225 Difference]: With dead ends: 26109 [2019-12-27 00:20:58,345 INFO L226 Difference]: Without dead ends: 26103 [2019-12-27 00:20:58,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:20:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26103 states. [2019-12-27 00:20:58,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26103 to 7893. [2019-12-27 00:20:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 00:20:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 00:20:58,611 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 00:20:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:58,611 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 00:20:58,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:20:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 00:20:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:58,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:58,613 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:20:58,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:58,816 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 00:20:58,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:20:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1336970474, now seen corresponding path program 3 times [2019-12-27 00:20:58,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:20:58,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833472819] [2019-12-27 00:20:58,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:20:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:20:58,870 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 00:20:58,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833472819] [2019-12-27 00:20:58,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485278485] [2019-12-27 00:20:58,871 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:20:58,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:20:58,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:20:58,944 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:20:58,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:20:58,969 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 00:20:58,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:20:58,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:20:58,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125249285] [2019-12-27 00:20:58,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:20:58,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:20:58,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:20:58,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:20:58,971 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 11 states. [2019-12-27 00:20:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:20:59,618 INFO L93 Difference]: Finished difference Result 26144 states and 99382 transitions. [2019-12-27 00:20:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:20:59,618 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:20:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:20:59,682 INFO L225 Difference]: With dead ends: 26144 [2019-12-27 00:20:59,682 INFO L226 Difference]: Without dead ends: 26140 [2019-12-27 00:20:59,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:20:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26140 states. [2019-12-27 00:20:59,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26140 to 7675. [2019-12-27 00:20:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7675 states. [2019-12-27 00:20:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7675 states to 7675 states and 35630 transitions. [2019-12-27 00:20:59,966 INFO L78 Accepts]: Start accepts. Automaton has 7675 states and 35630 transitions. Word has length 21 [2019-12-27 00:20:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:20:59,967 INFO L462 AbstractCegarLoop]: Abstraction has 7675 states and 35630 transitions. [2019-12-27 00:20:59,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:20:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 7675 states and 35630 transitions. [2019-12-27 00:20:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:20:59,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:20:59,968 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 00:21:00,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:00,169 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 00:21:00,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -775423414, now seen corresponding path program 4 times [2019-12-27 00:21:00,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:00,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58267272] [2019-12-27 00:21:00,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:00,221 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 00:21:00,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58267272] [2019-12-27 00:21:00,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480448708] [2019-12-27 00:21:00,222 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:00,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:21:00,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:21:00,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:00,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:00,336 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 00:21:00,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:00,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:00,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771952102] [2019-12-27 00:21:00,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:00,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:00,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:00,337 INFO L87 Difference]: Start difference. First operand 7675 states and 35630 transitions. Second operand 11 states. [2019-12-27 00:21:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:01,083 INFO L93 Difference]: Finished difference Result 25959 states and 98649 transitions. [2019-12-27 00:21:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:01,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 00:21:01,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:01,145 INFO L225 Difference]: With dead ends: 25959 [2019-12-27 00:21:01,145 INFO L226 Difference]: Without dead ends: 25953 [2019-12-27 00:21:01,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:01,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25953 states. [2019-12-27 00:21:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25953 to 7569. [2019-12-27 00:21:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2019-12-27 00:21:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 35092 transitions. [2019-12-27 00:21:01,417 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 35092 transitions. Word has length 21 [2019-12-27 00:21:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:01,417 INFO L462 AbstractCegarLoop]: Abstraction has 7569 states and 35092 transitions. [2019-12-27 00:21:01,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 35092 transitions. [2019-12-27 00:21:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:21:01,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:01,418 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:01,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:01,619 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 00:21:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1590921030, now seen corresponding path program 1 times [2019-12-27 00:21:01,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:01,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97133447] [2019-12-27 00:21:01,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:01,643 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 00:21:01,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97133447] [2019-12-27 00:21:01,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:01,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:21:01,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246453963] [2019-12-27 00:21:01,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:21:01,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:01,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:21:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:21:01,645 INFO L87 Difference]: Start difference. First operand 7569 states and 35092 transitions. Second operand 5 states. [2019-12-27 00:21:01,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:01,771 INFO L93 Difference]: Finished difference Result 12952 states and 56892 transitions. [2019-12-27 00:21:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:21:01,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:21:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:01,819 INFO L225 Difference]: With dead ends: 12952 [2019-12-27 00:21:01,819 INFO L226 Difference]: Without dead ends: 12936 [2019-12-27 00:21:01,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 00:21:01,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12936 states. [2019-12-27 00:21:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12936 to 9048. [2019-12-27 00:21:02,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9048 states. [2019-12-27 00:21:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9048 states to 9048 states and 41931 transitions. [2019-12-27 00:21:02,038 INFO L78 Accepts]: Start accepts. Automaton has 9048 states and 41931 transitions. Word has length 21 [2019-12-27 00:21:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:02,038 INFO L462 AbstractCegarLoop]: Abstraction has 9048 states and 41931 transitions. [2019-12-27 00:21:02,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:21:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9048 states and 41931 transitions. [2019-12-27 00:21:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:21:02,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:02,040 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 00:21:02,040 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 00:21:02,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:02,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1326537718, now seen corresponding path program 5 times [2019-12-27 00:21:02,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:02,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762258371] [2019-12-27 00:21:02,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:02,097 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 00:21:02,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762258371] [2019-12-27 00:21:02,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:02,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:02,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287748009] [2019-12-27 00:21:02,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:02,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:02,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:02,099 INFO L87 Difference]: Start difference. First operand 9048 states and 41931 transitions. Second operand 9 states. [2019-12-27 00:21:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:02,759 INFO L93 Difference]: Finished difference Result 29252 states and 112901 transitions. [2019-12-27 00:21:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:02,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:21:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:02,821 INFO L225 Difference]: With dead ends: 29252 [2019-12-27 00:21:02,822 INFO L226 Difference]: Without dead ends: 29245 [2019-12-27 00:21:02,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:02,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29245 states. [2019-12-27 00:21:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29245 to 8772. [2019-12-27 00:21:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 00:21:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40625 transitions. [2019-12-27 00:21:03,152 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40625 transitions. Word has length 21 [2019-12-27 00:21:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:03,152 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40625 transitions. [2019-12-27 00:21:03,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40625 transitions. [2019-12-27 00:21:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:21:03,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:03,154 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 00:21:03,154 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 00:21:03,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1333114678, now seen corresponding path program 6 times [2019-12-27 00:21:03,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:03,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265025316] [2019-12-27 00:21:03,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:03,215 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 00:21:03,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265025316] [2019-12-27 00:21:03,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:03,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:03,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654683498] [2019-12-27 00:21:03,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:03,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:03,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:03,218 INFO L87 Difference]: Start difference. First operand 8772 states and 40625 transitions. Second operand 9 states. [2019-12-27 00:21:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:03,913 INFO L93 Difference]: Finished difference Result 28866 states and 111199 transitions. [2019-12-27 00:21:03,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:03,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:21:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:03,994 INFO L225 Difference]: With dead ends: 28866 [2019-12-27 00:21:03,995 INFO L226 Difference]: Without dead ends: 28856 [2019-12-27 00:21:03,995 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 00:21:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28856 states. [2019-12-27 00:21:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28856 to 8405. [2019-12-27 00:21:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 00:21:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 00:21:04,328 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 00:21:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:04,329 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 00:21:04,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 00:21:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:21:04,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:04,331 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:04,331 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 00:21:04,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:04,331 INFO L82 PathProgramCache]: Analyzing trace with hash 627672841, now seen corresponding path program 1 times [2019-12-27 00:21:04,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:04,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144644029] [2019-12-27 00:21:04,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:04,382 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 00:21:04,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144644029] [2019-12-27 00:21:04,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024676540] [2019-12-27 00:21:04,383 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 00:21:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:04,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:21:04,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:04,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:21:04,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:04,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:21:04,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520721704] [2019-12-27 00:21:04,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:04,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:04,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:04,594 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 9 states. [2019-12-27 00:21:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:04,963 INFO L93 Difference]: Finished difference Result 19371 states and 79602 transitions. [2019-12-27 00:21:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:04,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-27 00:21:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:05,007 INFO L225 Difference]: With dead ends: 19371 [2019-12-27 00:21:05,008 INFO L226 Difference]: Without dead ends: 19359 [2019-12-27 00:21:05,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:21:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2019-12-27 00:21:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 8674. [2019-12-27 00:21:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 00:21:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 00:21:05,252 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 00:21:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:05,252 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 00:21:05,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 00:21:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:21:05,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:05,255 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:05,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:05,458 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 00:21:05,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:05,459 INFO L82 PathProgramCache]: Analyzing trace with hash 771495304, now seen corresponding path program 1 times [2019-12-27 00:21:05,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:05,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812768902] [2019-12-27 00:21:05,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:05,516 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 00:21:05,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812768902] [2019-12-27 00:21:05,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870332001] [2019-12-27 00:21:05,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:05,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:21:05,597 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:05,612 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 00:21:05,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:05,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-27 00:21:05,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278560145] [2019-12-27 00:21:05,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:05,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:05,614 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 9 states. [2019-12-27 00:21:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:05,913 INFO L93 Difference]: Finished difference Result 20331 states and 83597 transitions. [2019-12-27 00:21:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:05,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-27 00:21:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:05,959 INFO L225 Difference]: With dead ends: 20331 [2019-12-27 00:21:05,959 INFO L226 Difference]: Without dead ends: 20317 [2019-12-27 00:21:05,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-12-27 00:21:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20317 states. [2019-12-27 00:21:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20317 to 8938. [2019-12-27 00:21:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8938 states. [2019-12-27 00:21:06,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8938 states to 8938 states and 41305 transitions. [2019-12-27 00:21:06,213 INFO L78 Accepts]: Start accepts. Automaton has 8938 states and 41305 transitions. Word has length 23 [2019-12-27 00:21:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:06,213 INFO L462 AbstractCegarLoop]: Abstraction has 8938 states and 41305 transitions. [2019-12-27 00:21:06,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8938 states and 41305 transitions. [2019-12-27 00:21:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:21:06,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:06,216 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:06,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:06,419 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 00:21:06,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash -133229304, now seen corresponding path program 2 times [2019-12-27 00:21:06,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:06,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451775521] [2019-12-27 00:21:06,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:06,456 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 00:21:06,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451775521] [2019-12-27 00:21:06,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:06,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:06,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34211611] [2019-12-27 00:21:06,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:06,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:06,458 INFO L87 Difference]: Start difference. First operand 8938 states and 41305 transitions. Second operand 7 states. [2019-12-27 00:21:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:06,721 INFO L93 Difference]: Finished difference Result 20594 states and 84698 transitions. [2019-12-27 00:21:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:06,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:21:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:06,765 INFO L225 Difference]: With dead ends: 20594 [2019-12-27 00:21:06,766 INFO L226 Difference]: Without dead ends: 20575 [2019-12-27 00:21:06,766 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 00:21:06,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20575 states. [2019-12-27 00:21:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20575 to 8847. [2019-12-27 00:21:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8847 states. [2019-12-27 00:21:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 40829 transitions. [2019-12-27 00:21:07,157 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 40829 transitions. Word has length 23 [2019-12-27 00:21:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:07,157 INFO L462 AbstractCegarLoop]: Abstraction has 8847 states and 40829 transitions. [2019-12-27 00:21:07,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 40829 transitions. [2019-12-27 00:21:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:21:07,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:07,159 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:07,159 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 00:21:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash -133236155, now seen corresponding path program 2 times [2019-12-27 00:21:07,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:07,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188305738] [2019-12-27 00:21:07,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:07,205 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 00:21:07,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188305738] [2019-12-27 00:21:07,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:07,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:07,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082541497] [2019-12-27 00:21:07,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:07,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:07,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:07,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:07,207 INFO L87 Difference]: Start difference. First operand 8847 states and 40829 transitions. Second operand 7 states. [2019-12-27 00:21:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:07,488 INFO L93 Difference]: Finished difference Result 20360 states and 83494 transitions. [2019-12-27 00:21:07,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:07,488 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:21:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:07,528 INFO L225 Difference]: With dead ends: 20360 [2019-12-27 00:21:07,529 INFO L226 Difference]: Without dead ends: 20341 [2019-12-27 00:21:07,529 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 00:21:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-12-27 00:21:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 8772. [2019-12-27 00:21:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8772 states. [2019-12-27 00:21:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8772 states to 8772 states and 40442 transitions. [2019-12-27 00:21:07,779 INFO L78 Accepts]: Start accepts. Automaton has 8772 states and 40442 transitions. Word has length 23 [2019-12-27 00:21:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:07,779 INFO L462 AbstractCegarLoop]: Abstraction has 8772 states and 40442 transitions. [2019-12-27 00:21:07,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 8772 states and 40442 transitions. [2019-12-27 00:21:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:21:07,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:07,781 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:07,781 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 00:21:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash -133234605, now seen corresponding path program 1 times [2019-12-27 00:21:07,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:07,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902333385] [2019-12-27 00:21:07,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:07,824 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 00:21:07,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902333385] [2019-12-27 00:21:07,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:07,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:07,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675797406] [2019-12-27 00:21:07,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:07,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:07,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:07,826 INFO L87 Difference]: Start difference. First operand 8772 states and 40442 transitions. Second operand 7 states. [2019-12-27 00:21:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:08,115 INFO L93 Difference]: Finished difference Result 20740 states and 85213 transitions. [2019-12-27 00:21:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:08,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:21:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:08,161 INFO L225 Difference]: With dead ends: 20740 [2019-12-27 00:21:08,162 INFO L226 Difference]: Without dead ends: 20721 [2019-12-27 00:21:08,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:21:08,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-12-27 00:21:08,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 9181. [2019-12-27 00:21:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9181 states. [2019-12-27 00:21:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9181 states to 9181 states and 42287 transitions. [2019-12-27 00:21:08,416 INFO L78 Accepts]: Start accepts. Automaton has 9181 states and 42287 transitions. Word has length 23 [2019-12-27 00:21:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:08,416 INFO L462 AbstractCegarLoop]: Abstraction has 9181 states and 42287 transitions. [2019-12-27 00:21:08,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:08,416 INFO L276 IsEmpty]: Start isEmpty. Operand 9181 states and 42287 transitions. [2019-12-27 00:21:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:21:08,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:08,418 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:08,418 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 00:21:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:08,419 INFO L82 PathProgramCache]: Analyzing trace with hash -139067565, now seen corresponding path program 2 times [2019-12-27 00:21:08,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:08,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498667582] [2019-12-27 00:21:08,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:08,451 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 00:21:08,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498667582] [2019-12-27 00:21:08,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:08,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:08,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749613857] [2019-12-27 00:21:08,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:08,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:08,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:08,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:08,453 INFO L87 Difference]: Start difference. First operand 9181 states and 42287 transitions. Second operand 7 states. [2019-12-27 00:21:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:08,741 INFO L93 Difference]: Finished difference Result 20896 states and 85782 transitions. [2019-12-27 00:21:08,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:08,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:21:08,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:08,788 INFO L225 Difference]: With dead ends: 20896 [2019-12-27 00:21:08,788 INFO L226 Difference]: Without dead ends: 20877 [2019-12-27 00:21:08,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:21:08,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20877 states. [2019-12-27 00:21:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20877 to 9286. [2019-12-27 00:21:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 00:21:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 00:21:09,209 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 00:21:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:09,210 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 00:21:09,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 00:21:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:09,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:09,213 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 00:21:09,213 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 00:21:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1897453003, now seen corresponding path program 1 times [2019-12-27 00:21:09,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:09,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973321814] [2019-12-27 00:21:09,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:09,265 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 00:21:09,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973321814] [2019-12-27 00:21:09,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779654116] [2019-12-27 00:21:09,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:09,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:09,344 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:09,368 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 00:21:09,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:09,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:09,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241249774] [2019-12-27 00:21:09,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:09,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:09,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:09,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:09,369 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 11 states. [2019-12-27 00:21:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:10,063 INFO L93 Difference]: Finished difference Result 29793 states and 115235 transitions. [2019-12-27 00:21:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:10,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:10,126 INFO L225 Difference]: With dead ends: 29793 [2019-12-27 00:21:10,126 INFO L226 Difference]: Without dead ends: 29783 [2019-12-27 00:21:10,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29783 states. [2019-12-27 00:21:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29783 to 9200. [2019-12-27 00:21:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9200 states. [2019-12-27 00:21:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9200 states to 9200 states and 42331 transitions. [2019-12-27 00:21:10,464 INFO L78 Accepts]: Start accepts. Automaton has 9200 states and 42331 transitions. Word has length 25 [2019-12-27 00:21:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:10,464 INFO L462 AbstractCegarLoop]: Abstraction has 9200 states and 42331 transitions. [2019-12-27 00:21:10,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 9200 states and 42331 transitions. [2019-12-27 00:21:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:10,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:10,468 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 00:21:10,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:10,669 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 00:21:10,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:10,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1898197003, now seen corresponding path program 2 times [2019-12-27 00:21:10,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:10,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655606251] [2019-12-27 00:21:10,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:10,717 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 00:21:10,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655606251] [2019-12-27 00:21:10,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202712728] [2019-12-27 00:21:10,717 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:10,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:21:10,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:21:10,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:10,797 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:10,821 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 00:21:10,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:10,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:10,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675713684] [2019-12-27 00:21:10,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:10,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:10,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:10,822 INFO L87 Difference]: Start difference. First operand 9200 states and 42331 transitions. Second operand 11 states. [2019-12-27 00:21:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:11,583 INFO L93 Difference]: Finished difference Result 29319 states and 113201 transitions. [2019-12-27 00:21:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:11,583 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:11,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:11,644 INFO L225 Difference]: With dead ends: 29319 [2019-12-27 00:21:11,644 INFO L226 Difference]: Without dead ends: 29308 [2019-12-27 00:21:11,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29308 states. [2019-12-27 00:21:12,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29308 to 9197. [2019-12-27 00:21:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9197 states. [2019-12-27 00:21:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9197 states to 9197 states and 42279 transitions. [2019-12-27 00:21:12,128 INFO L78 Accepts]: Start accepts. Automaton has 9197 states and 42279 transitions. Word has length 25 [2019-12-27 00:21:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:12,128 INFO L462 AbstractCegarLoop]: Abstraction has 9197 states and 42279 transitions. [2019-12-27 00:21:12,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9197 states and 42279 transitions. [2019-12-27 00:21:12,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:12,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:12,132 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 00:21:12,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:12,333 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 00:21:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1898191702, now seen corresponding path program 1 times [2019-12-27 00:21:12,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:12,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036786349] [2019-12-27 00:21:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:12,380 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 00:21:12,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036786349] [2019-12-27 00:21:12,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716122154] [2019-12-27 00:21:12,381 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 00:21:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:12,469 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:12,470 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:12,491 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 00:21:12,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:12,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:12,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260160739] [2019-12-27 00:21:12,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:12,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:12,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:12,493 INFO L87 Difference]: Start difference. First operand 9197 states and 42279 transitions. Second operand 11 states. [2019-12-27 00:21:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:13,334 INFO L93 Difference]: Finished difference Result 28997 states and 111934 transitions. [2019-12-27 00:21:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:13,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:13,399 INFO L225 Difference]: With dead ends: 28997 [2019-12-27 00:21:13,399 INFO L226 Difference]: Without dead ends: 28987 [2019-12-27 00:21:13,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28987 states. [2019-12-27 00:21:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28987 to 9121. [2019-12-27 00:21:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9121 states. [2019-12-27 00:21:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9121 states to 9121 states and 41862 transitions. [2019-12-27 00:21:13,747 INFO L78 Accepts]: Start accepts. Automaton has 9121 states and 41862 transitions. Word has length 25 [2019-12-27 00:21:13,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:13,748 INFO L462 AbstractCegarLoop]: Abstraction has 9121 states and 41862 transitions. [2019-12-27 00:21:13,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9121 states and 41862 transitions. [2019-12-27 00:21:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:13,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:13,751 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 00:21:13,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:13,952 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 00:21:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:13,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358742, now seen corresponding path program 2 times [2019-12-27 00:21:13,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:13,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756359517] [2019-12-27 00:21:13,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:13,999 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 00:21:14,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756359517] [2019-12-27 00:21:14,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784333732] [2019-12-27 00:21:14,000 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:14,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:21:14,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:21:14,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:14,076 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:14,097 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 00:21:14,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:14,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:14,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952725876] [2019-12-27 00:21:14,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:14,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:14,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:14,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:14,099 INFO L87 Difference]: Start difference. First operand 9121 states and 41862 transitions. Second operand 11 states. [2019-12-27 00:21:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:14,734 INFO L93 Difference]: Finished difference Result 28781 states and 111002 transitions. [2019-12-27 00:21:14,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:14,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:14,796 INFO L225 Difference]: With dead ends: 28781 [2019-12-27 00:21:14,796 INFO L226 Difference]: Without dead ends: 28770 [2019-12-27 00:21:14,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28770 states. [2019-12-27 00:21:15,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28770 to 9044. [2019-12-27 00:21:15,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 00:21:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 00:21:15,113 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 00:21:15,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:15,114 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 00:21:15,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 00:21:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:15,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:15,118 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 00:21:15,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:15,319 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 00:21:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:15,319 INFO L82 PathProgramCache]: Analyzing trace with hash 756879153, now seen corresponding path program 3 times [2019-12-27 00:21:15,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:15,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217559567] [2019-12-27 00:21:15,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:15,382 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 00:21:15,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217559567] [2019-12-27 00:21:15,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88803766] [2019-12-27 00:21:15,383 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:15,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-27 00:21:15,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:21:15,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:15,466 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:15,607 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 00:21:15,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:15,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:15,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509524540] [2019-12-27 00:21:15,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:15,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:15,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:15,608 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 11 states. [2019-12-27 00:21:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:16,294 INFO L93 Difference]: Finished difference Result 28747 states and 110799 transitions. [2019-12-27 00:21:16,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:16,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:16,354 INFO L225 Difference]: With dead ends: 28747 [2019-12-27 00:21:16,355 INFO L226 Difference]: Without dead ends: 28737 [2019-12-27 00:21:16,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28737 states. [2019-12-27 00:21:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28737 to 8874. [2019-12-27 00:21:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8874 states. [2019-12-27 00:21:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8874 states to 8874 states and 40677 transitions. [2019-12-27 00:21:16,661 INFO L78 Accepts]: Start accepts. Automaton has 8874 states and 40677 transitions. Word has length 25 [2019-12-27 00:21:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:16,661 INFO L462 AbstractCegarLoop]: Abstraction has 8874 states and 40677 transitions. [2019-12-27 00:21:16,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8874 states and 40677 transitions. [2019-12-27 00:21:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:16,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:16,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 00:21:16,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:16,865 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 00:21:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1622343673, now seen corresponding path program 4 times [2019-12-27 00:21:16,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:16,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129226571] [2019-12-27 00:21:16,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:16,918 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 00:21:16,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129226571] [2019-12-27 00:21:16,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456291021] [2019-12-27 00:21:16,918 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:16,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:21:16,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:21:16,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:17,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:17,014 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 00:21:17,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:17,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:17,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686057017] [2019-12-27 00:21:17,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:17,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:17,016 INFO L87 Difference]: Start difference. First operand 8874 states and 40677 transitions. Second operand 11 states. [2019-12-27 00:21:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:17,613 INFO L93 Difference]: Finished difference Result 28993 states and 111827 transitions. [2019-12-27 00:21:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:17,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:17,675 INFO L225 Difference]: With dead ends: 28993 [2019-12-27 00:21:17,676 INFO L226 Difference]: Without dead ends: 28982 [2019-12-27 00:21:17,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28982 states. [2019-12-27 00:21:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28982 to 8871. [2019-12-27 00:21:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8871 states. [2019-12-27 00:21:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8871 states to 8871 states and 40625 transitions. [2019-12-27 00:21:17,982 INFO L78 Accepts]: Start accepts. Automaton has 8871 states and 40625 transitions. Word has length 25 [2019-12-27 00:21:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:17,983 INFO L462 AbstractCegarLoop]: Abstraction has 8871 states and 40625 transitions. [2019-12-27 00:21:17,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8871 states and 40625 transitions. [2019-12-27 00:21:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:17,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:17,986 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 00:21:18,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:18,187 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 00:21:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:18,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1622342123, now seen corresponding path program 1 times [2019-12-27 00:21:18,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:18,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793475740] [2019-12-27 00:21:18,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:18,235 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 00:21:18,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793475740] [2019-12-27 00:21:18,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482313013] [2019-12-27 00:21:18,236 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 00:21:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:18,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:18,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:18,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 00:21:18,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:18,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:18,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724427493] [2019-12-27 00:21:18,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:18,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:18,327 INFO L87 Difference]: Start difference. First operand 8871 states and 40625 transitions. Second operand 11 states. [2019-12-27 00:21:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:19,132 INFO L93 Difference]: Finished difference Result 28840 states and 111427 transitions. [2019-12-27 00:21:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:19,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:19,193 INFO L225 Difference]: With dead ends: 28840 [2019-12-27 00:21:19,193 INFO L226 Difference]: Without dead ends: 28830 [2019-12-27 00:21:19,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28830 states. [2019-12-27 00:21:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28830 to 8831. [2019-12-27 00:21:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8831 states. [2019-12-27 00:21:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8831 states to 8831 states and 40384 transitions. [2019-12-27 00:21:19,480 INFO L78 Accepts]: Start accepts. Automaton has 8831 states and 40384 transitions. Word has length 25 [2019-12-27 00:21:19,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:19,481 INFO L462 AbstractCegarLoop]: Abstraction has 8831 states and 40384 transitions. [2019-12-27 00:21:19,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 8831 states and 40384 transitions. [2019-12-27 00:21:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:19,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:19,484 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 00:21:19,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:19,685 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 00:21:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1628175083, now seen corresponding path program 2 times [2019-12-27 00:21:19,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:19,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703948061] [2019-12-27 00:21:19,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:19,735 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 00:21:19,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703948061] [2019-12-27 00:21:19,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576459105] [2019-12-27 00:21:19,735 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:19,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:21:19,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:21:19,819 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:19,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:19,841 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 00:21:19,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:19,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-12-27 00:21:19,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939753351] [2019-12-27 00:21:19,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 00:21:19,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 00:21:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 00:21:19,843 INFO L87 Difference]: Start difference. First operand 8831 states and 40384 transitions. Second operand 11 states. [2019-12-27 00:21:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:20,577 INFO L93 Difference]: Finished difference Result 28552 states and 110204 transitions. [2019-12-27 00:21:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:20,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 00:21:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:20,639 INFO L225 Difference]: With dead ends: 28552 [2019-12-27 00:21:20,639 INFO L226 Difference]: Without dead ends: 28538 [2019-12-27 00:21:20,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 00:21:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28538 states. [2019-12-27 00:21:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28538 to 8722. [2019-12-27 00:21:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 00:21:20,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39861 transitions. [2019-12-27 00:21:20,945 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39861 transitions. Word has length 25 [2019-12-27 00:21:20,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:20,945 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39861 transitions. [2019-12-27 00:21:20,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 00:21:20,945 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39861 transitions. [2019-12-27 00:21:20,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:20,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:20,949 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 00:21:21,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:21,150 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 00:21:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash 815669127, now seen corresponding path program 5 times [2019-12-27 00:21:21,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:21,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499013335] [2019-12-27 00:21:21,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:21,253 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 00:21:21,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499013335] [2019-12-27 00:21:21,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:21,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:21,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308194398] [2019-12-27 00:21:21,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:21,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:21,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:21,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:21,256 INFO L87 Difference]: Start difference. First operand 8722 states and 39861 transitions. Second operand 9 states. [2019-12-27 00:21:21,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:21,920 INFO L93 Difference]: Finished difference Result 28362 states and 109208 transitions. [2019-12-27 00:21:21,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:21,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:21,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:21,980 INFO L225 Difference]: With dead ends: 28362 [2019-12-27 00:21:21,981 INFO L226 Difference]: Without dead ends: 28352 [2019-12-27 00:21:21,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28352 states. [2019-12-27 00:21:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28352 to 8506. [2019-12-27 00:21:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-27 00:21:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 38850 transitions. [2019-12-27 00:21:22,281 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 38850 transitions. Word has length 25 [2019-12-27 00:21:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:22,281 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 38850 transitions. [2019-12-27 00:21:22,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 38850 transitions. [2019-12-27 00:21:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:22,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:22,284 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 00:21:22,284 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 00:21:22,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:22,285 INFO L82 PathProgramCache]: Analyzing trace with hash 815670677, now seen corresponding path program 3 times [2019-12-27 00:21:22,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:22,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435141904] [2019-12-27 00:21:22,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:22,340 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 00:21:22,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435141904] [2019-12-27 00:21:22,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:22,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:22,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096109441] [2019-12-27 00:21:22,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:22,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:22,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:22,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:22,342 INFO L87 Difference]: Start difference. First operand 8506 states and 38850 transitions. Second operand 9 states. [2019-12-27 00:21:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:23,063 INFO L93 Difference]: Finished difference Result 28156 states and 108503 transitions. [2019-12-27 00:21:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:23,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:23,125 INFO L225 Difference]: With dead ends: 28156 [2019-12-27 00:21:23,125 INFO L226 Difference]: Without dead ends: 28146 [2019-12-27 00:21:23,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28146 states. [2019-12-27 00:21:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28146 to 8362. [2019-12-27 00:21:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8362 states. [2019-12-27 00:21:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8362 states to 8362 states and 38183 transitions. [2019-12-27 00:21:23,403 INFO L78 Accepts]: Start accepts. Automaton has 8362 states and 38183 transitions. Word has length 25 [2019-12-27 00:21:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:23,404 INFO L462 AbstractCegarLoop]: Abstraction has 8362 states and 38183 transitions. [2019-12-27 00:21:23,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 8362 states and 38183 transitions. [2019-12-27 00:21:23,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:23,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:23,407 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:23,407 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 00:21:23,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:23,407 INFO L82 PathProgramCache]: Analyzing trace with hash 809092167, now seen corresponding path program 6 times [2019-12-27 00:21:23,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:23,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100796829] [2019-12-27 00:21:23,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:23,475 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 00:21:23,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100796829] [2019-12-27 00:21:23,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:23,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:23,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444529264] [2019-12-27 00:21:23,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:23,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:23,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:23,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:23,477 INFO L87 Difference]: Start difference. First operand 8362 states and 38183 transitions. Second operand 9 states. [2019-12-27 00:21:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:24,060 INFO L93 Difference]: Finished difference Result 27714 states and 106431 transitions. [2019-12-27 00:21:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:24,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:24,133 INFO L225 Difference]: With dead ends: 27714 [2019-12-27 00:21:24,133 INFO L226 Difference]: Without dead ends: 27700 [2019-12-27 00:21:24,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27700 states. [2019-12-27 00:21:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27700 to 8063. [2019-12-27 00:21:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8063 states. [2019-12-27 00:21:24,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8063 states to 8063 states and 36856 transitions. [2019-12-27 00:21:24,441 INFO L78 Accepts]: Start accepts. Automaton has 8063 states and 36856 transitions. Word has length 25 [2019-12-27 00:21:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:24,441 INFO L462 AbstractCegarLoop]: Abstraction has 8063 states and 36856 transitions. [2019-12-27 00:21:24,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 8063 states and 36856 transitions. [2019-12-27 00:21:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:24,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:24,444 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 00:21:24,445 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 00:21:24,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash 809086866, now seen corresponding path program 3 times [2019-12-27 00:21:24,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:24,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000310407] [2019-12-27 00:21:24,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:24,491 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 00:21:24,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000310407] [2019-12-27 00:21:24,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:24,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:24,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842639581] [2019-12-27 00:21:24,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:24,493 INFO L87 Difference]: Start difference. First operand 8063 states and 36856 transitions. Second operand 9 states. [2019-12-27 00:21:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:25,130 INFO L93 Difference]: Finished difference Result 27553 states and 105964 transitions. [2019-12-27 00:21:25,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:25,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:25,191 INFO L225 Difference]: With dead ends: 27553 [2019-12-27 00:21:25,191 INFO L226 Difference]: Without dead ends: 27543 [2019-12-27 00:21:25,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27543 states. [2019-12-27 00:21:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27543 to 7969. [2019-12-27 00:21:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7969 states. [2019-12-27 00:21:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7969 states to 7969 states and 36432 transitions. [2019-12-27 00:21:25,481 INFO L78 Accepts]: Start accepts. Automaton has 7969 states and 36432 transitions. Word has length 25 [2019-12-27 00:21:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:25,481 INFO L462 AbstractCegarLoop]: Abstraction has 7969 states and 36432 transitions. [2019-12-27 00:21:25,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7969 states and 36432 transitions. [2019-12-27 00:21:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:25,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:25,484 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 00:21:25,484 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 00:21:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash 810581717, now seen corresponding path program 4 times [2019-12-27 00:21:25,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:25,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993139322] [2019-12-27 00:21:25,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:25,552 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 00:21:25,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993139322] [2019-12-27 00:21:25,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:25,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:25,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138280127] [2019-12-27 00:21:25,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:25,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:25,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:25,554 INFO L87 Difference]: Start difference. First operand 7969 states and 36432 transitions. Second operand 9 states. [2019-12-27 00:21:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:26,296 INFO L93 Difference]: Finished difference Result 27570 states and 106062 transitions. [2019-12-27 00:21:26,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:26,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:26,358 INFO L225 Difference]: With dead ends: 27570 [2019-12-27 00:21:26,358 INFO L226 Difference]: Without dead ends: 27556 [2019-12-27 00:21:26,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27556 states. [2019-12-27 00:21:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27556 to 7970. [2019-12-27 00:21:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7970 states. [2019-12-27 00:21:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7970 states to 7970 states and 36401 transitions. [2019-12-27 00:21:26,637 INFO L78 Accepts]: Start accepts. Automaton has 7970 states and 36401 transitions. Word has length 25 [2019-12-27 00:21:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:26,638 INFO L462 AbstractCegarLoop]: Abstraction has 7970 states and 36401 transitions. [2019-12-27 00:21:26,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:26,638 INFO L276 IsEmpty]: Start isEmpty. Operand 7970 states and 36401 transitions. [2019-12-27 00:21:26,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:26,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:26,641 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 00:21:26,641 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 00:21:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash 810574866, now seen corresponding path program 4 times [2019-12-27 00:21:26,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:26,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657944055] [2019-12-27 00:21:26,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:26,685 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 00:21:26,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657944055] [2019-12-27 00:21:26,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:26,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:26,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612096077] [2019-12-27 00:21:26,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:26,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:26,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:26,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:26,687 INFO L87 Difference]: Start difference. First operand 7970 states and 36401 transitions. Second operand 9 states. [2019-12-27 00:21:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:27,356 INFO L93 Difference]: Finished difference Result 27265 states and 104830 transitions. [2019-12-27 00:21:27,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:27,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:27,417 INFO L225 Difference]: With dead ends: 27265 [2019-12-27 00:21:27,417 INFO L226 Difference]: Without dead ends: 27251 [2019-12-27 00:21:27,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27251 states. [2019-12-27 00:21:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27251 to 7917. [2019-12-27 00:21:27,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7917 states. [2019-12-27 00:21:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7917 states to 7917 states and 36127 transitions. [2019-12-27 00:21:27,703 INFO L78 Accepts]: Start accepts. Automaton has 7917 states and 36127 transitions. Word has length 25 [2019-12-27 00:21:27,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:27,703 INFO L462 AbstractCegarLoop]: Abstraction has 7917 states and 36127 transitions. [2019-12-27 00:21:27,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7917 states and 36127 transitions. [2019-12-27 00:21:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:27,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:27,706 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:27,706 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 00:21:27,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:27,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1878167028, now seen corresponding path program 1 times [2019-12-27 00:21:27,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:27,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915387372] [2019-12-27 00:21:27,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:27,733 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 00:21:27,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915387372] [2019-12-27 00:21:27,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:27,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:21:27,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710177437] [2019-12-27 00:21:27,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:21:27,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:27,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:21:27,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:21:27,734 INFO L87 Difference]: Start difference. First operand 7917 states and 36127 transitions. Second operand 5 states. [2019-12-27 00:21:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:27,850 INFO L93 Difference]: Finished difference Result 12944 states and 56476 transitions. [2019-12-27 00:21:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:21:27,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 00:21:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:27,878 INFO L225 Difference]: With dead ends: 12944 [2019-12-27 00:21:27,878 INFO L226 Difference]: Without dead ends: 12912 [2019-12-27 00:21:27,878 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 00:21:27,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2019-12-27 00:21:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 9346. [2019-12-27 00:21:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9346 states. [2019-12-27 00:21:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9346 states to 9346 states and 42193 transitions. [2019-12-27 00:21:28,059 INFO L78 Accepts]: Start accepts. Automaton has 9346 states and 42193 transitions. Word has length 25 [2019-12-27 00:21:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:28,059 INFO L462 AbstractCegarLoop]: Abstraction has 9346 states and 42193 transitions. [2019-12-27 00:21:28,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:21:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9346 states and 42193 transitions. [2019-12-27 00:21:28,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:28,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:28,064 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:28,064 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 00:21:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:28,064 INFO L82 PathProgramCache]: Analyzing trace with hash -500669547, now seen corresponding path program 5 times [2019-12-27 00:21:28,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:28,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773124391] [2019-12-27 00:21:28,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:21:28,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773124391] [2019-12-27 00:21:28,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:28,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:28,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476588779] [2019-12-27 00:21:28,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:28,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:28,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:28,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:28,114 INFO L87 Difference]: Start difference. First operand 9346 states and 42193 transitions. Second operand 9 states. [2019-12-27 00:21:28,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:28,728 INFO L93 Difference]: Finished difference Result 30802 states and 119509 transitions. [2019-12-27 00:21:28,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:28,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:28,797 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 00:21:28,797 INFO L226 Difference]: Without dead ends: 30786 [2019-12-27 00:21:28,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30786 states. [2019-12-27 00:21:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30786 to 9188. [2019-12-27 00:21:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-27 00:21:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 41446 transitions. [2019-12-27 00:21:29,136 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 41446 transitions. Word has length 25 [2019-12-27 00:21:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:29,136 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 41446 transitions. [2019-12-27 00:21:29,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 41446 transitions. [2019-12-27 00:21:29,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:29,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:29,139 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 00:21:29,139 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 00:21:29,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:29,139 INFO L82 PathProgramCache]: Analyzing trace with hash -499925547, now seen corresponding path program 6 times [2019-12-27 00:21:29,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:29,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947002518] [2019-12-27 00:21:29,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:29,185 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 00:21:29,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947002518] [2019-12-27 00:21:29,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:29,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:29,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855449571] [2019-12-27 00:21:29,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:29,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:29,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:29,187 INFO L87 Difference]: Start difference. First operand 9188 states and 41446 transitions. Second operand 9 states. [2019-12-27 00:21:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:29,963 INFO L93 Difference]: Finished difference Result 30412 states and 117823 transitions. [2019-12-27 00:21:29,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:29,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:29,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:30,029 INFO L225 Difference]: With dead ends: 30412 [2019-12-27 00:21:30,029 INFO L226 Difference]: Without dead ends: 30392 [2019-12-27 00:21:30,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30392 states. [2019-12-27 00:21:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30392 to 8937. [2019-12-27 00:21:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8937 states. [2019-12-27 00:21:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8937 states to 8937 states and 40326 transitions. [2019-12-27 00:21:30,351 INFO L78 Accepts]: Start accepts. Automaton has 8937 states and 40326 transitions. Word has length 25 [2019-12-27 00:21:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:30,351 INFO L462 AbstractCegarLoop]: Abstraction has 8937 states and 40326 transitions. [2019-12-27 00:21:30,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 8937 states and 40326 transitions. [2019-12-27 00:21:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:30,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:30,354 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 00:21:30,354 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 00:21:30,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash -499932398, now seen corresponding path program 5 times [2019-12-27 00:21:30,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:30,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526586575] [2019-12-27 00:21:30,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:30,427 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 00:21:30,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526586575] [2019-12-27 00:21:30,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:30,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:30,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265368378] [2019-12-27 00:21:30,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:30,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:30,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:30,429 INFO L87 Difference]: Start difference. First operand 8937 states and 40326 transitions. Second operand 9 states. [2019-12-27 00:21:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:31,141 INFO L93 Difference]: Finished difference Result 30029 states and 116246 transitions. [2019-12-27 00:21:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:31,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:31,206 INFO L225 Difference]: With dead ends: 30029 [2019-12-27 00:21:31,207 INFO L226 Difference]: Without dead ends: 30013 [2019-12-27 00:21:31,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:31,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30013 states. [2019-12-27 00:21:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30013 to 8839. [2019-12-27 00:21:31,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8839 states. [2019-12-27 00:21:31,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8839 states to 8839 states and 39856 transitions. [2019-12-27 00:21:31,522 INFO L78 Accepts]: Start accepts. Automaton has 8839 states and 39856 transitions. Word has length 25 [2019-12-27 00:21:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:31,522 INFO L462 AbstractCegarLoop]: Abstraction has 8839 states and 39856 transitions. [2019-12-27 00:21:31,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 39856 transitions. [2019-12-27 00:21:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:21:31,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:31,525 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 00:21:31,525 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 00:21:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash -507253358, now seen corresponding path program 6 times [2019-12-27 00:21:31,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:31,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536545464] [2019-12-27 00:21:31,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:31,568 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 00:21:31,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536545464] [2019-12-27 00:21:31,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:31,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:21:31,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353884006] [2019-12-27 00:21:31,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:31,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:31,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:31,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:31,569 INFO L87 Difference]: Start difference. First operand 8839 states and 39856 transitions. Second operand 9 states. [2019-12-27 00:21:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:32,273 INFO L93 Difference]: Finished difference Result 29761 states and 115069 transitions. [2019-12-27 00:21:32,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:32,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:21:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:32,342 INFO L225 Difference]: With dead ends: 29761 [2019-12-27 00:21:32,342 INFO L226 Difference]: Without dead ends: 29741 [2019-12-27 00:21:32,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29741 states. [2019-12-27 00:21:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29741 to 8516. [2019-12-27 00:21:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 00:21:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 00:21:32,659 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 00:21:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:32,659 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 00:21:32,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 00:21:32,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 00:21:32,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:32,663 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:32,663 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 00:21:32,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:32,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1901572494, now seen corresponding path program 1 times [2019-12-27 00:21:32,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:32,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218927440] [2019-12-27 00:21:32,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:21:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 00:21:32,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 00:21:32,680 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 00:21:32,680 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 00:21:32,680 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 00:21:32,694 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,694 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,694 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,695 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,696 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,697 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,697 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,698 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,698 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,698 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,699 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,700 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,701 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,701 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,701 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,701 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,702 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,702 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,702 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,702 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,703 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,704 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,704 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,704 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,704 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,704 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,705 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,705 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,705 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,705 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,706 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,706 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,706 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,706 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,706 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,706 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,706 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,707 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,708 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,708 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,709 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,710 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,711 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,711 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,711 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,711 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,712 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,722 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,722 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,722 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,722 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,724 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,724 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,724 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,724 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,725 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,725 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,726 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,726 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,726 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,726 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,727 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,728 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,728 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,728 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,728 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,728 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,736 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,736 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,737 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,737 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,738 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,738 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,738 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,739 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,744 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,744 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,745 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,745 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,745 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,745 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,746 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,746 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,746 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,746 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,747 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,747 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,748 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,748 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,748 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 00:21:32,748 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 00:21:32,749 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 00:21:32,749 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 00:21:32,749 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 00:21:32,749 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 00:21:32,749 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 00:21:32,749 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 00:21:32,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 00:21:32,749 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 00:21:32,751 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 141 transitions [2019-12-27 00:21:32,751 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 00:21:32,776 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 00:21:32,776 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 00:21:32,779 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 00:21:32,788 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 160 places, 141 transitions [2019-12-27 00:21:32,811 INFO L132 PetriNetUnfolder]: 8/171 cut-off events. [2019-12-27 00:21:32,811 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 00:21:32,815 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 171 events. 8/171 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 313 event pairs. 0/155 useless extension candidates. Maximal degree in co-relation 206. Up to 14 conditions per place. [2019-12-27 00:21:32,824 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 3612 [2019-12-27 00:21:32,824 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 00:21:34,226 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2019-12-27 00:21:34,941 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-12-27 00:21:35,111 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4276 [2019-12-27 00:21:35,111 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 00:21:35,112 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 00:21:36,342 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 00:21:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 00:21:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 00:21:36,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:36,343 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 00:21:36,343 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 00:21:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1263148, now seen corresponding path program 1 times [2019-12-27 00:21:36,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:36,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580539755] [2019-12-27 00:21:36,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:36,349 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 00:21:36,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580539755] [2019-12-27 00:21:36,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:36,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 00:21:36,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146495590] [2019-12-27 00:21:36,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 00:21:36,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 00:21:36,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 00:21:36,351 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 00:21:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:36,473 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 00:21:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 00:21:36,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 00:21:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:36,521 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 00:21:36,521 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 00:21:36,521 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 00:21:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 00:21:36,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 00:21:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 00:21:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 00:21:36,879 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 00:21:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:36,879 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 00:21:36,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 00:21:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 00:21:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 00:21:36,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:36,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:36,880 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 00:21:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash 86926032, now seen corresponding path program 1 times [2019-12-27 00:21:36,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:36,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083727975] [2019-12-27 00:21:36,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:36,896 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 00:21:36,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083727975] [2019-12-27 00:21:36,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:36,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:21:36,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069656819] [2019-12-27 00:21:36,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:21:36,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:36,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:21:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:21:36,898 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 00:21:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:37,108 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 00:21:37,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:21:37,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 00:21:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:37,191 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 00:21:37,191 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 00:21:37,192 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 00:21:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 00:21:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 00:21:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 00:21:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 00:21:37,753 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 00:21:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:37,753 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 00:21:37,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:21:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 00:21:37,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 00:21:37,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:37,754 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:37,754 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 00:21:37,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:37,754 INFO L82 PathProgramCache]: Analyzing trace with hash 941737402, now seen corresponding path program 1 times [2019-12-27 00:21:37,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:37,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926034690] [2019-12-27 00:21:37,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:37,776 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 00:21:37,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926034690] [2019-12-27 00:21:37,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:37,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:21:37,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101884233] [2019-12-27 00:21:37,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:21:37,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:37,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:21:37,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:21:37,778 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 00:21:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:38,312 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 00:21:38,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:21:38,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 00:21:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:38,412 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 00:21:38,412 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 00:21:38,412 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 00:21:38,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 00:21:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 00:21:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 00:21:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 00:21:39,084 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 00:21:39,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:39,084 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 00:21:39,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:21:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 00:21:39,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:21:39,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:39,085 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:39,085 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 00:21:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:39,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1055229, now seen corresponding path program 1 times [2019-12-27 00:21:39,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:39,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684715096] [2019-12-27 00:21:39,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:39,123 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 00:21:39,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684715096] [2019-12-27 00:21:39,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870559991] [2019-12-27 00:21:39,124 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 00:21:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:39,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:21:39,213 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:39,215 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 00:21:39,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:39,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 00:21:39,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504237462] [2019-12-27 00:21:39,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:39,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:39,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:39,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:39,217 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-27 00:21:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:39,689 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 00:21:39,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:39,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:21:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:39,852 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 00:21:39,852 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 00:21:39,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:21:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 00:21:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 00:21:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 00:21:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 00:21:43,769 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 00:21:43,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:43,769 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 00:21:43,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 00:21:43,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 00:21:43,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:43,770 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:43,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:43,971 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 00:21:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:43,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1228456205, now seen corresponding path program 2 times [2019-12-27 00:21:43,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:43,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579274616] [2019-12-27 00:21:43,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:44,001 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 00:21:44,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579274616] [2019-12-27 00:21:44,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:44,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:44,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452529041] [2019-12-27 00:21:44,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:44,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:44,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:44,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:44,003 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 00:21:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:44,492 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 00:21:44,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:44,492 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 00:21:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:44,659 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 00:21:44,659 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 00:21:44,659 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 00:21:44,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 00:21:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 00:21:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 00:21:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 00:21:45,493 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 00:21:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:45,494 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 00:21:45,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 00:21:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 00:21:45,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:45,494 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:45,494 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 00:21:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash 642107180, now seen corresponding path program 1 times [2019-12-27 00:21:45,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:45,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109322375] [2019-12-27 00:21:45,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:45,516 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 00:21:45,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109322375] [2019-12-27 00:21:45,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:45,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:21:45,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811552856] [2019-12-27 00:21:45,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:21:45,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:45,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:21:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:21:45,517 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 00:21:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:45,811 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 00:21:45,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:21:45,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 00:21:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:45,930 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 00:21:45,930 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 00:21:45,931 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 00:21:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 00:21:46,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 00:21:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 00:21:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 00:21:47,406 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 00:21:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:47,406 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 00:21:47,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:21:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 00:21:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:21:47,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:47,407 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:47,407 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 00:21:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:47,407 INFO L82 PathProgramCache]: Analyzing trace with hash -889938571, now seen corresponding path program 1 times [2019-12-27 00:21:47,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:47,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270800599] [2019-12-27 00:21:47,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:47,435 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 00:21:47,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270800599] [2019-12-27 00:21:47,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748802767] [2019-12-27 00:21:47,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:47,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:21:47,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:47,528 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 00:21:47,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:47,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 00:21:47,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013182160] [2019-12-27 00:21:47,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:47,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:47,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:47,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:47,530 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-27 00:21:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:48,084 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 00:21:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:48,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:21:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:48,266 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 00:21:48,266 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 00:21:48,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:21:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 00:21:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 00:21:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 00:21:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 00:21:49,271 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 00:21:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:49,271 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 00:21:49,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 00:21:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:21:49,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:49,272 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:49,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:49,475 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 00:21:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:49,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1410290715, now seen corresponding path program 2 times [2019-12-27 00:21:49,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:49,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700292867] [2019-12-27 00:21:49,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:49,505 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 00:21:49,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700292867] [2019-12-27 00:21:49,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:49,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:49,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197919363] [2019-12-27 00:21:49,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:49,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:49,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:49,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:49,507 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 7 states. [2019-12-27 00:21:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:50,077 INFO L93 Difference]: Finished difference Result 66182 states and 316792 transitions. [2019-12-27 00:21:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:50,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:21:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:50,277 INFO L225 Difference]: With dead ends: 66182 [2019-12-27 00:21:50,277 INFO L226 Difference]: Without dead ends: 66173 [2019-12-27 00:21:50,278 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 00:21:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66173 states. [2019-12-27 00:21:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66173 to 27041. [2019-12-27 00:21:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27041 states. [2019-12-27 00:21:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27041 states to 27041 states and 146101 transitions. [2019-12-27 00:21:51,873 INFO L78 Accepts]: Start accepts. Automaton has 27041 states and 146101 transitions. Word has length 19 [2019-12-27 00:21:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:51,873 INFO L462 AbstractCegarLoop]: Abstraction has 27041 states and 146101 transitions. [2019-12-27 00:21:51,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 27041 states and 146101 transitions. [2019-12-27 00:21:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:21:51,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:51,874 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:51,874 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 00:21:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1410299922, now seen corresponding path program 1 times [2019-12-27 00:21:51,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:51,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872783457] [2019-12-27 00:21:51,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 00:21:51,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872783457] [2019-12-27 00:21:51,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:51,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:51,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572658029] [2019-12-27 00:21:51,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:51,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:51,903 INFO L87 Difference]: Start difference. First operand 27041 states and 146101 transitions. Second operand 7 states. [2019-12-27 00:21:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:52,456 INFO L93 Difference]: Finished difference Result 66741 states and 319826 transitions. [2019-12-27 00:21:52,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:52,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:21:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:52,647 INFO L225 Difference]: With dead ends: 66741 [2019-12-27 00:21:52,647 INFO L226 Difference]: Without dead ends: 66732 [2019-12-27 00:21:52,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:21:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66732 states. [2019-12-27 00:21:53,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66732 to 27880. [2019-12-27 00:21:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27880 states. [2019-12-27 00:21:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27880 states to 27880 states and 150604 transitions. [2019-12-27 00:21:53,738 INFO L78 Accepts]: Start accepts. Automaton has 27880 states and 150604 transitions. Word has length 19 [2019-12-27 00:21:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:53,738 INFO L462 AbstractCegarLoop]: Abstraction has 27880 states and 150604 transitions. [2019-12-27 00:21:53,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 27880 states and 150604 transitions. [2019-12-27 00:21:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 00:21:53,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:53,739 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:21:53,739 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 00:21:53,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1433572242, now seen corresponding path program 2 times [2019-12-27 00:21:53,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:53,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881706003] [2019-12-27 00:21:53,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:53,770 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 00:21:53,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881706003] [2019-12-27 00:21:53,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:21:53,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:21:53,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080538104] [2019-12-27 00:21:53,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:21:53,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:21:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:21:53,771 INFO L87 Difference]: Start difference. First operand 27880 states and 150604 transitions. Second operand 7 states. [2019-12-27 00:21:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:54,739 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 00:21:54,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:21:54,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 00:21:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:54,951 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 00:21:54,951 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 00:21:54,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:21:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 00:21:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 00:21:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 00:21:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 00:21:55,965 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 00:21:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:55,966 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 00:21:55,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:21:55,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 00:21:55,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:21:55,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:55,967 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 00:21:55,967 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 00:21:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:55,967 INFO L82 PathProgramCache]: Analyzing trace with hash -532484105, now seen corresponding path program 1 times [2019-12-27 00:21:55,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:55,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867095168] [2019-12-27 00:21:55,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:56,014 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 00:21:56,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867095168] [2019-12-27 00:21:56,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199772826] [2019-12-27 00:21:56,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:56,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:56,106 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:56,109 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 00:21:56,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:56,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:21:56,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177638128] [2019-12-27 00:21:56,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:56,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:56,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:56,111 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 9 states. [2019-12-27 00:21:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:21:57,194 INFO L93 Difference]: Finished difference Result 97639 states and 440644 transitions. [2019-12-27 00:21:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:21:57,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:21:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:21:57,476 INFO L225 Difference]: With dead ends: 97639 [2019-12-27 00:21:57,476 INFO L226 Difference]: Without dead ends: 97635 [2019-12-27 00:21:57,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:21:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97635 states. [2019-12-27 00:21:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97635 to 27701. [2019-12-27 00:21:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27701 states. [2019-12-27 00:21:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27701 states to 27701 states and 149579 transitions. [2019-12-27 00:21:59,413 INFO L78 Accepts]: Start accepts. Automaton has 27701 states and 149579 transitions. Word has length 21 [2019-12-27 00:21:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:21:59,413 INFO L462 AbstractCegarLoop]: Abstraction has 27701 states and 149579 transitions. [2019-12-27 00:21:59,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:21:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 27701 states and 149579 transitions. [2019-12-27 00:21:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:21:59,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:21:59,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 00:21:59,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:59,615 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 00:21:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:21:59,616 INFO L82 PathProgramCache]: Analyzing trace with hash -555756425, now seen corresponding path program 2 times [2019-12-27 00:21:59,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:21:59,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329872761] [2019-12-27 00:21:59,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:21:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:21:59,654 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 00:21:59,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329872761] [2019-12-27 00:21:59,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733777880] [2019-12-27 00:21:59,655 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:21:59,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:21:59,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:21:59,741 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:21:59,741 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:21:59,745 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 00:21:59,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:21:59,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:21:59,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671059849] [2019-12-27 00:21:59,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:21:59,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:21:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:21:59,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:21:59,747 INFO L87 Difference]: Start difference. First operand 27701 states and 149579 transitions. Second operand 9 states. [2019-12-27 00:22:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:00,864 INFO L93 Difference]: Finished difference Result 96845 states and 436549 transitions. [2019-12-27 00:22:00,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:00,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:22:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:01,172 INFO L225 Difference]: With dead ends: 96845 [2019-12-27 00:22:01,172 INFO L226 Difference]: Without dead ends: 96839 [2019-12-27 00:22:01,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96839 states. [2019-12-27 00:22:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96839 to 27343. [2019-12-27 00:22:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 00:22:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 00:22:03,083 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 00:22:03,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:03,083 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 00:22:03,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:03,083 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 00:22:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:22:03,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:03,084 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:22:03,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:03,285 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 00:22:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1079646913, now seen corresponding path program 1 times [2019-12-27 00:22:03,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:03,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870164184] [2019-12-27 00:22:03,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:03,304 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 00:22:03,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870164184] [2019-12-27 00:22:03,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:03,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:22:03,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120062240] [2019-12-27 00:22:03,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:22:03,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:22:03,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:22:03,306 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 5 states. [2019-12-27 00:22:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:03,643 INFO L93 Difference]: Finished difference Result 49005 states and 252892 transitions. [2019-12-27 00:22:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:22:03,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 00:22:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:03,797 INFO L225 Difference]: With dead ends: 49005 [2019-12-27 00:22:03,797 INFO L226 Difference]: Without dead ends: 48989 [2019-12-27 00:22:03,797 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 00:22:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48989 states. [2019-12-27 00:22:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48989 to 34182. [2019-12-27 00:22:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34182 states. [2019-12-27 00:22:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34182 states to 34182 states and 185907 transitions. [2019-12-27 00:22:04,755 INFO L78 Accepts]: Start accepts. Automaton has 34182 states and 185907 transitions. Word has length 21 [2019-12-27 00:22:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:04,755 INFO L462 AbstractCegarLoop]: Abstraction has 34182 states and 185907 transitions. [2019-12-27 00:22:04,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:22:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 34182 states and 185907 transitions. [2019-12-27 00:22:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:22:04,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:04,757 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 00:22:04,757 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 00:22:04,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:04,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1920279143, now seen corresponding path program 3 times [2019-12-27 00:22:04,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:04,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104216658] [2019-12-27 00:22:04,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:04,811 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 00:22:04,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104216658] [2019-12-27 00:22:04,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:04,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:22:04,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669750471] [2019-12-27 00:22:04,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:04,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:04,813 INFO L87 Difference]: Start difference. First operand 34182 states and 185907 transitions. Second operand 9 states. [2019-12-27 00:22:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:05,981 INFO L93 Difference]: Finished difference Result 112418 states and 516541 transitions. [2019-12-27 00:22:05,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:05,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:22:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:06,984 INFO L225 Difference]: With dead ends: 112418 [2019-12-27 00:22:06,984 INFO L226 Difference]: Without dead ends: 112411 [2019-12-27 00:22:06,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112411 states. [2019-12-27 00:22:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112411 to 33330. [2019-12-27 00:22:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33330 states. [2019-12-27 00:22:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33330 states to 33330 states and 181229 transitions. [2019-12-27 00:22:08,522 INFO L78 Accepts]: Start accepts. Automaton has 33330 states and 181229 transitions. Word has length 21 [2019-12-27 00:22:08,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:08,523 INFO L462 AbstractCegarLoop]: Abstraction has 33330 states and 181229 transitions. [2019-12-27 00:22:08,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:08,523 INFO L276 IsEmpty]: Start isEmpty. Operand 33330 states and 181229 transitions. [2019-12-27 00:22:08,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:22:08,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:08,524 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 00:22:08,524 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 00:22:08,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:08,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1911440423, now seen corresponding path program 4 times [2019-12-27 00:22:08,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:08,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704218177] [2019-12-27 00:22:08,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:08,573 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 00:22:08,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704218177] [2019-12-27 00:22:08,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:08,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:22:08,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975272982] [2019-12-27 00:22:08,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:08,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:08,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:08,575 INFO L87 Difference]: Start difference. First operand 33330 states and 181229 transitions. Second operand 9 states. [2019-12-27 00:22:10,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:10,293 INFO L93 Difference]: Finished difference Result 111816 states and 513526 transitions. [2019-12-27 00:22:10,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:10,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:22:10,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:10,644 INFO L225 Difference]: With dead ends: 111816 [2019-12-27 00:22:10,644 INFO L226 Difference]: Without dead ends: 111807 [2019-12-27 00:22:10,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111807 states. [2019-12-27 00:22:12,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111807 to 32802. [2019-12-27 00:22:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32802 states. [2019-12-27 00:22:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32802 states to 32802 states and 178191 transitions. [2019-12-27 00:22:12,215 INFO L78 Accepts]: Start accepts. Automaton has 32802 states and 178191 transitions. Word has length 21 [2019-12-27 00:22:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:12,215 INFO L462 AbstractCegarLoop]: Abstraction has 32802 states and 178191 transitions. [2019-12-27 00:22:12,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 32802 states and 178191 transitions. [2019-12-27 00:22:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:22:12,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:12,217 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 00:22:12,217 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 00:22:12,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:12,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1021577383, now seen corresponding path program 5 times [2019-12-27 00:22:12,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:12,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335698897] [2019-12-27 00:22:12,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:12,270 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 00:22:12,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335698897] [2019-12-27 00:22:12,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:12,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:22:12,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219235080] [2019-12-27 00:22:12,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:12,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:12,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:12,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:12,272 INFO L87 Difference]: Start difference. First operand 32802 states and 178191 transitions. Second operand 9 states. [2019-12-27 00:22:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:13,837 INFO L93 Difference]: Finished difference Result 112148 states and 515023 transitions. [2019-12-27 00:22:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:13,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:22:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:14,182 INFO L225 Difference]: With dead ends: 112148 [2019-12-27 00:22:14,182 INFO L226 Difference]: Without dead ends: 112141 [2019-12-27 00:22:14,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112141 states. [2019-12-27 00:22:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112141 to 31950. [2019-12-27 00:22:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31950 states. [2019-12-27 00:22:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31950 states to 31950 states and 173513 transitions. [2019-12-27 00:22:15,769 INFO L78 Accepts]: Start accepts. Automaton has 31950 states and 173513 transitions. Word has length 21 [2019-12-27 00:22:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:15,770 INFO L462 AbstractCegarLoop]: Abstraction has 31950 states and 173513 transitions. [2019-12-27 00:22:15,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31950 states and 173513 transitions. [2019-12-27 00:22:15,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 00:22:15,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:15,771 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 00:22:15,771 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 00:22:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1007143783, now seen corresponding path program 6 times [2019-12-27 00:22:15,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:15,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118925222] [2019-12-27 00:22:15,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:15,820 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 00:22:15,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118925222] [2019-12-27 00:22:15,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:15,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:22:15,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002441655] [2019-12-27 00:22:15,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:15,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:15,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:15,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:15,822 INFO L87 Difference]: Start difference. First operand 31950 states and 173513 transitions. Second operand 9 states. [2019-12-27 00:22:17,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:17,304 INFO L93 Difference]: Finished difference Result 111038 states and 509212 transitions. [2019-12-27 00:22:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:17,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 00:22:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:17,635 INFO L225 Difference]: With dead ends: 111038 [2019-12-27 00:22:17,635 INFO L226 Difference]: Without dead ends: 111028 [2019-12-27 00:22:17,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111028 states. [2019-12-27 00:22:19,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111028 to 30899. [2019-12-27 00:22:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 00:22:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 00:22:19,217 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 00:22:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:19,218 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 00:22:19,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 00:22:19,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:22:19,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:19,219 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:22:19,220 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 00:22:19,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:19,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1454131756, now seen corresponding path program 1 times [2019-12-27 00:22:19,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:19,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999022845] [2019-12-27 00:22:19,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:19,249 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 00:22:19,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999022845] [2019-12-27 00:22:19,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085410056] [2019-12-27 00:22:19,249 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 00:22:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:19,333 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:22:19,333 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:22:19,335 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 00:22:19,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:22:19,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 00:22:19,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548674130] [2019-12-27 00:22:19,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:22:19,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:22:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:22:19,336 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-27 00:22:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:20,238 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 00:22:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:22:20,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:22:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:20,477 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 00:22:20,477 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 00:22:20,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:22:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 00:22:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 00:22:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 00:22:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 00:22:21,649 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 00:22:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:21,650 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 00:22:21,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:22:21,650 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 00:22:21,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:22:21,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:21,651 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:22:21,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:21,852 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 00:22:21,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1927215539, now seen corresponding path program 1 times [2019-12-27 00:22:21,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:21,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414714967] [2019-12-27 00:22:21,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:21,885 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 00:22:21,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414714967] [2019-12-27 00:22:21,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099163745] [2019-12-27 00:22:21,885 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 00:22:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:21,976 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:22:21,976 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:22:21,978 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 00:22:21,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:22:21,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 00:22:21,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116636969] [2019-12-27 00:22:21,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:22:21,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:21,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:22:21,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:22:21,979 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 7 states. [2019-12-27 00:22:22,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:22,602 INFO L93 Difference]: Finished difference Result 77025 states and 375206 transitions. [2019-12-27 00:22:22,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:22:22,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:22:22,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:23,424 INFO L225 Difference]: With dead ends: 77025 [2019-12-27 00:22:23,424 INFO L226 Difference]: Without dead ends: 77011 [2019-12-27 00:22:23,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:22:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77011 states. [2019-12-27 00:22:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77011 to 32844. [2019-12-27 00:22:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32844 states. [2019-12-27 00:22:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32844 states to 32844 states and 178253 transitions. [2019-12-27 00:22:24,564 INFO L78 Accepts]: Start accepts. Automaton has 32844 states and 178253 transitions. Word has length 23 [2019-12-27 00:22:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:24,565 INFO L462 AbstractCegarLoop]: Abstraction has 32844 states and 178253 transitions. [2019-12-27 00:22:24,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:22:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 32844 states and 178253 transitions. [2019-12-27 00:22:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:22:24,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:24,567 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:22:24,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:24,768 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 00:22:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1841387275, now seen corresponding path program 2 times [2019-12-27 00:22:24,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:24,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496746027] [2019-12-27 00:22:24,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:22:24,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496746027] [2019-12-27 00:22:24,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:24,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:22:24,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007780865] [2019-12-27 00:22:24,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:22:24,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:22:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:22:24,800 INFO L87 Difference]: Start difference. First operand 32844 states and 178253 transitions. Second operand 7 states. [2019-12-27 00:22:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:25,427 INFO L93 Difference]: Finished difference Result 78384 states and 382183 transitions. [2019-12-27 00:22:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:22:25,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:22:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:25,677 INFO L225 Difference]: With dead ends: 78384 [2019-12-27 00:22:25,677 INFO L226 Difference]: Without dead ends: 78365 [2019-12-27 00:22:25,677 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 00:22:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78365 states. [2019-12-27 00:22:27,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78365 to 33117. [2019-12-27 00:22:27,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33117 states. [2019-12-27 00:22:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33117 states to 33117 states and 179680 transitions. [2019-12-27 00:22:27,484 INFO L78 Accepts]: Start accepts. Automaton has 33117 states and 179680 transitions. Word has length 23 [2019-12-27 00:22:27,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:27,484 INFO L462 AbstractCegarLoop]: Abstraction has 33117 states and 179680 transitions. [2019-12-27 00:22:27,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:22:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 33117 states and 179680 transitions. [2019-12-27 00:22:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:22:27,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:27,487 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:22:27,487 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 00:22:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1841402310, now seen corresponding path program 2 times [2019-12-27 00:22:27,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:27,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747076904] [2019-12-27 00:22:27,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:27,516 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 00:22:27,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747076904] [2019-12-27 00:22:27,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:27,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:22:27,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513842439] [2019-12-27 00:22:27,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:22:27,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:27,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:22:27,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:22:27,518 INFO L87 Difference]: Start difference. First operand 33117 states and 179680 transitions. Second operand 7 states. [2019-12-27 00:22:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:28,101 INFO L93 Difference]: Finished difference Result 78506 states and 382218 transitions. [2019-12-27 00:22:28,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:22:28,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:22:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:28,337 INFO L225 Difference]: With dead ends: 78506 [2019-12-27 00:22:28,338 INFO L226 Difference]: Without dead ends: 78487 [2019-12-27 00:22:28,338 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 00:22:28,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78487 states. [2019-12-27 00:22:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78487 to 33426. [2019-12-27 00:22:29,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33426 states. [2019-12-27 00:22:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33426 states to 33426 states and 181402 transitions. [2019-12-27 00:22:30,434 INFO L78 Accepts]: Start accepts. Automaton has 33426 states and 181402 transitions. Word has length 23 [2019-12-27 00:22:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:30,434 INFO L462 AbstractCegarLoop]: Abstraction has 33426 states and 181402 transitions. [2019-12-27 00:22:30,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:22:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 33426 states and 181402 transitions. [2019-12-27 00:22:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:22:30,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:30,436 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:22:30,436 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 00:22:30,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1841411517, now seen corresponding path program 1 times [2019-12-27 00:22:30,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:30,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768551566] [2019-12-27 00:22:30,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:30,483 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 00:22:30,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768551566] [2019-12-27 00:22:30,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:30,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:22:30,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401875389] [2019-12-27 00:22:30,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:22:30,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:22:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:22:30,485 INFO L87 Difference]: Start difference. First operand 33426 states and 181402 transitions. Second operand 7 states. [2019-12-27 00:22:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:31,128 INFO L93 Difference]: Finished difference Result 80886 states and 394638 transitions. [2019-12-27 00:22:31,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:22:31,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:22:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:31,392 INFO L225 Difference]: With dead ends: 80886 [2019-12-27 00:22:31,392 INFO L226 Difference]: Without dead ends: 80867 [2019-12-27 00:22:31,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:22:31,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80867 states. [2019-12-27 00:22:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80867 to 35111. [2019-12-27 00:22:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35111 states. [2019-12-27 00:22:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35111 states to 35111 states and 190468 transitions. [2019-12-27 00:22:32,728 INFO L78 Accepts]: Start accepts. Automaton has 35111 states and 190468 transitions. Word has length 23 [2019-12-27 00:22:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:32,728 INFO L462 AbstractCegarLoop]: Abstraction has 35111 states and 190468 transitions. [2019-12-27 00:22:32,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:22:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 35111 states and 190468 transitions. [2019-12-27 00:22:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 00:22:32,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:32,730 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:22:32,730 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 00:22:32,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:32,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1840221117, now seen corresponding path program 2 times [2019-12-27 00:22:32,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:32,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515951551] [2019-12-27 00:22:32,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 00:22:32,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515951551] [2019-12-27 00:22:32,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:22:32,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 00:22:32,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105279473] [2019-12-27 00:22:32,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:22:32,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:22:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:22:32,789 INFO L87 Difference]: Start difference. First operand 35111 states and 190468 transitions. Second operand 7 states. [2019-12-27 00:22:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:33,930 INFO L93 Difference]: Finished difference Result 81926 states and 399875 transitions. [2019-12-27 00:22:33,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:22:33,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 00:22:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:34,201 INFO L225 Difference]: With dead ends: 81926 [2019-12-27 00:22:34,201 INFO L226 Difference]: Without dead ends: 81907 [2019-12-27 00:22:34,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 00:22:34,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81907 states. [2019-12-27 00:22:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81907 to 35912. [2019-12-27 00:22:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 00:22:35,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 00:22:35,512 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 00:22:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:35,512 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 00:22:35,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 00:22:35,513 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 00:22:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:22:35,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:35,516 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 00:22:35,516 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 00:22:35,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:35,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1580724000, now seen corresponding path program 1 times [2019-12-27 00:22:35,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:35,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626092423] [2019-12-27 00:22:35,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:35,566 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 00:22:35,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626092423] [2019-12-27 00:22:35,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927427710] [2019-12-27 00:22:35,566 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 00:22:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:35,658 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:22:35,659 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:22:35,661 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 00:22:35,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:22:35,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:22:35,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134426688] [2019-12-27 00:22:35,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:35,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:35,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:35,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:35,662 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 9 states. [2019-12-27 00:22:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:37,401 INFO L93 Difference]: Finished difference Result 119601 states and 553012 transitions. [2019-12-27 00:22:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:37,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:22:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:37,785 INFO L225 Difference]: With dead ends: 119601 [2019-12-27 00:22:37,785 INFO L226 Difference]: Without dead ends: 119591 [2019-12-27 00:22:37,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119591 states. [2019-12-27 00:22:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119591 to 35598. [2019-12-27 00:22:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35598 states. [2019-12-27 00:22:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35598 states to 35598 states and 193118 transitions. [2019-12-27 00:22:39,445 INFO L78 Accepts]: Start accepts. Automaton has 35598 states and 193118 transitions. Word has length 25 [2019-12-27 00:22:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:39,445 INFO L462 AbstractCegarLoop]: Abstraction has 35598 states and 193118 transitions. [2019-12-27 00:22:39,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 35598 states and 193118 transitions. [2019-12-27 00:22:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:22:39,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:39,449 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 00:22:39,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:39,649 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 00:22:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1556261280, now seen corresponding path program 2 times [2019-12-27 00:22:39,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:39,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238108187] [2019-12-27 00:22:39,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:39,695 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 00:22:39,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238108187] [2019-12-27 00:22:39,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121563280] [2019-12-27 00:22:39,696 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:39,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:22:39,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:22:39,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:22:39,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:22:39,789 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 00:22:39,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:22:39,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:22:39,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477774950] [2019-12-27 00:22:39,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:39,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:39,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:39,790 INFO L87 Difference]: Start difference. First operand 35598 states and 193118 transitions. Second operand 9 states. [2019-12-27 00:22:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:41,329 INFO L93 Difference]: Finished difference Result 118295 states and 546185 transitions. [2019-12-27 00:22:41,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:41,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:22:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:41,681 INFO L225 Difference]: With dead ends: 118295 [2019-12-27 00:22:41,681 INFO L226 Difference]: Without dead ends: 118284 [2019-12-27 00:22:41,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118284 states. [2019-12-27 00:22:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118284 to 35531. [2019-12-27 00:22:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 00:22:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 192612 transitions. [2019-12-27 00:22:47,432 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 192612 transitions. Word has length 25 [2019-12-27 00:22:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:47,432 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 192612 transitions. [2019-12-27 00:22:47,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 192612 transitions. [2019-12-27 00:22:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:22:47,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:47,436 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 00:22:47,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:47,637 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 00:22:47,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:47,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1556237038, now seen corresponding path program 1 times [2019-12-27 00:22:47,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:47,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144598067] [2019-12-27 00:22:47,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:47,680 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 00:22:47,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144598067] [2019-12-27 00:22:47,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278270063] [2019-12-27 00:22:47,681 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 00:22:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:47,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:22:47,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:22:47,770 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 00:22:47,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:22:47,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:22:47,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006056192] [2019-12-27 00:22:47,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:47,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:47,771 INFO L87 Difference]: Start difference. First operand 35531 states and 192612 transitions. Second operand 9 states. [2019-12-27 00:22:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:48,885 INFO L93 Difference]: Finished difference Result 117353 states and 541624 transitions. [2019-12-27 00:22:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:48,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:22:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:49,221 INFO L225 Difference]: With dead ends: 117353 [2019-12-27 00:22:49,221 INFO L226 Difference]: Without dead ends: 117343 [2019-12-27 00:22:49,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117343 states. [2019-12-27 00:22:51,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117343 to 35223. [2019-12-27 00:22:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35223 states. [2019-12-27 00:22:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35223 states to 35223 states and 190755 transitions. [2019-12-27 00:22:51,423 INFO L78 Accepts]: Start accepts. Automaton has 35223 states and 190755 transitions. Word has length 25 [2019-12-27 00:22:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:51,423 INFO L462 AbstractCegarLoop]: Abstraction has 35223 states and 190755 transitions. [2019-12-27 00:22:51,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35223 states and 190755 transitions. [2019-12-27 00:22:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:22:51,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:51,426 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 00:22:51,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:51,627 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 00:22:51,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:51,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1557427438, now seen corresponding path program 2 times [2019-12-27 00:22:51,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:51,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692519527] [2019-12-27 00:22:51,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:51,671 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 00:22:51,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692519527] [2019-12-27 00:22:51,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710455821] [2019-12-27 00:22:51,672 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 00:22:51,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:22:51,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:22:51,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:22:51,769 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:22:51,772 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 00:22:51,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:22:51,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:22:51,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602055915] [2019-12-27 00:22:51,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:51,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:51,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:51,773 INFO L87 Difference]: Start difference. First operand 35223 states and 190755 transitions. Second operand 9 states. [2019-12-27 00:22:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:52,981 INFO L93 Difference]: Finished difference Result 116621 states and 537886 transitions. [2019-12-27 00:22:52,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:52,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:22:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:53,347 INFO L225 Difference]: With dead ends: 116621 [2019-12-27 00:22:53,347 INFO L226 Difference]: Without dead ends: 116610 [2019-12-27 00:22:53,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116610 states. [2019-12-27 00:22:55,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116610 to 34934. [2019-12-27 00:22:55,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 00:22:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 00:22:55,732 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 00:22:55,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:55,732 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 00:22:55,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 00:22:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:22:55,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:55,736 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 00:22:55,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:55,936 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 00:22:55,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:22:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 249951642, now seen corresponding path program 3 times [2019-12-27 00:22:55,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:22:55,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221636972] [2019-12-27 00:22:55,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:22:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:22:56,017 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 00:22:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221636972] [2019-12-27 00:22:56,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632876346] [2019-12-27 00:22:56,017 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:22:56,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 00:22:56,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:22:56,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:22:56,135 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:22:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:22:56,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:22:56,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:22:56,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768992975] [2019-12-27 00:22:56,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:22:56,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:22:56,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:22:56,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:22:56,146 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 9 states. [2019-12-27 00:22:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:22:57,378 INFO L93 Difference]: Finished difference Result 116675 states and 538001 transitions. [2019-12-27 00:22:57,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:22:57,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:22:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:22:57,709 INFO L225 Difference]: With dead ends: 116675 [2019-12-27 00:22:57,709 INFO L226 Difference]: Without dead ends: 116665 [2019-12-27 00:22:57,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:22:57,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116665 states. [2019-12-27 00:22:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116665 to 34396. [2019-12-27 00:22:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34396 states. [2019-12-27 00:22:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34396 states to 34396 states and 186070 transitions. [2019-12-27 00:22:59,954 INFO L78 Accepts]: Start accepts. Automaton has 34396 states and 186070 transitions. Word has length 25 [2019-12-27 00:22:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:22:59,954 INFO L462 AbstractCegarLoop]: Abstraction has 34396 states and 186070 transitions. [2019-12-27 00:22:59,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:22:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 34396 states and 186070 transitions. [2019-12-27 00:22:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:22:59,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:22:59,957 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 00:23:00,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:23:00,158 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 00:23:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:00,158 INFO L82 PathProgramCache]: Analyzing trace with hash -923228474, now seen corresponding path program 4 times [2019-12-27 00:23:00,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:00,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417714608] [2019-12-27 00:23:00,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 00:23:00,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417714608] [2019-12-27 00:23:00,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15294030] [2019-12-27 00:23:00,214 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:23:00,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 00:23:00,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:23:00,335 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:23:00,336 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:23:00,343 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 00:23:00,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:23:00,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:23:00,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843540504] [2019-12-27 00:23:00,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:00,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:00,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:00,345 INFO L87 Difference]: Start difference. First operand 34396 states and 186070 transitions. Second operand 9 states. [2019-12-27 00:23:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:01,479 INFO L93 Difference]: Finished difference Result 117673 states and 542950 transitions. [2019-12-27 00:23:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:01,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:01,837 INFO L225 Difference]: With dead ends: 117673 [2019-12-27 00:23:01,837 INFO L226 Difference]: Without dead ends: 117662 [2019-12-27 00:23:01,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117662 states. [2019-12-27 00:23:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117662 to 34329. [2019-12-27 00:23:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34329 states. [2019-12-27 00:23:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34329 states to 34329 states and 185564 transitions. [2019-12-27 00:23:04,085 INFO L78 Accepts]: Start accepts. Automaton has 34329 states and 185564 transitions. Word has length 25 [2019-12-27 00:23:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:04,085 INFO L462 AbstractCegarLoop]: Abstraction has 34329 states and 185564 transitions. [2019-12-27 00:23:04,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 34329 states and 185564 transitions. [2019-12-27 00:23:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:04,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:04,088 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 00:23:04,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:23:04,288 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 00:23:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash -923237681, now seen corresponding path program 1 times [2019-12-27 00:23:04,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:04,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522278400] [2019-12-27 00:23:04,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:04,332 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 00:23:04,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522278400] [2019-12-27 00:23:04,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243763280] [2019-12-27 00:23:04,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:23:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:04,428 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:23:04,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:23:04,431 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 00:23:04,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:23:04,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:23:04,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540761474] [2019-12-27 00:23:04,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:04,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:04,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:04,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:04,433 INFO L87 Difference]: Start difference. First operand 34329 states and 185564 transitions. Second operand 9 states. [2019-12-27 00:23:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:06,108 INFO L93 Difference]: Finished difference Result 117232 states and 541547 transitions. [2019-12-27 00:23:06,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:06,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:06,480 INFO L225 Difference]: With dead ends: 117232 [2019-12-27 00:23:06,480 INFO L226 Difference]: Without dead ends: 117222 [2019-12-27 00:23:06,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117222 states. [2019-12-27 00:23:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117222 to 34129. [2019-12-27 00:23:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34129 states. [2019-12-27 00:23:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34129 states to 34129 states and 184355 transitions. [2019-12-27 00:23:08,114 INFO L78 Accepts]: Start accepts. Automaton has 34129 states and 184355 transitions. Word has length 25 [2019-12-27 00:23:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:08,114 INFO L462 AbstractCegarLoop]: Abstraction has 34129 states and 184355 transitions. [2019-12-27 00:23:08,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 34129 states and 184355 transitions. [2019-12-27 00:23:08,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:08,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:08,117 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 00:23:08,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:23:08,317 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 00:23:08,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash -922047281, now seen corresponding path program 2 times [2019-12-27 00:23:08,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:08,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526987991] [2019-12-27 00:23:08,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:08,371 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 00:23:08,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526987991] [2019-12-27 00:23:08,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789927484] [2019-12-27 00:23:08,372 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 00:23:08,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 00:23:08,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 00:23:08,466 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-27 00:23:08,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:23:08,470 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 00:23:08,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:23:08,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-12-27 00:23:08,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002690897] [2019-12-27 00:23:08,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:08,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:08,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:08,471 INFO L87 Difference]: Start difference. First operand 34129 states and 184355 transitions. Second operand 9 states. [2019-12-27 00:23:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:09,931 INFO L93 Difference]: Finished difference Result 116256 states and 536656 transitions. [2019-12-27 00:23:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:09,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:09,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:10,291 INFO L225 Difference]: With dead ends: 116256 [2019-12-27 00:23:10,291 INFO L226 Difference]: Without dead ends: 116242 [2019-12-27 00:23:10,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116242 states. [2019-12-27 00:23:11,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116242 to 33768. [2019-12-27 00:23:11,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 00:23:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182277 transitions. [2019-12-27 00:23:15,792 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182277 transitions. Word has length 25 [2019-12-27 00:23:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:15,792 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182277 transitions. [2019-12-27 00:23:15,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182277 transitions. [2019-12-27 00:23:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:15,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:15,795 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:23:15,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:23:15,999 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 00:23:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1156631685, now seen corresponding path program 1 times [2019-12-27 00:23:16,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:16,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777091549] [2019-12-27 00:23:16,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:16,021 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 00:23:16,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777091549] [2019-12-27 00:23:16,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:16,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 00:23:16,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492831524] [2019-12-27 00:23:16,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 00:23:16,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:16,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 00:23:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 00:23:16,023 INFO L87 Difference]: Start difference. First operand 33768 states and 182277 transitions. Second operand 5 states. [2019-12-27 00:23:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:16,453 INFO L93 Difference]: Finished difference Result 59584 states and 309872 transitions. [2019-12-27 00:23:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 00:23:16,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 00:23:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:16,662 INFO L225 Difference]: With dead ends: 59584 [2019-12-27 00:23:16,662 INFO L226 Difference]: Without dead ends: 59552 [2019-12-27 00:23:16,662 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 00:23:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59552 states. [2019-12-27 00:23:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59552 to 42643. [2019-12-27 00:23:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42643 states. [2019-12-27 00:23:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42643 states to 42643 states and 231050 transitions. [2019-12-27 00:23:17,792 INFO L78 Accepts]: Start accepts. Automaton has 42643 states and 231050 transitions. Word has length 25 [2019-12-27 00:23:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:17,792 INFO L462 AbstractCegarLoop]: Abstraction has 42643 states and 231050 transitions. [2019-12-27 00:23:17,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 00:23:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 42643 states and 231050 transitions. [2019-12-27 00:23:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:17,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:17,795 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 00:23:17,795 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash -46645394, now seen corresponding path program 5 times [2019-12-27 00:23:17,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:17,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829149815] [2019-12-27 00:23:17,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:17,849 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 00:23:17,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829149815] [2019-12-27 00:23:17,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:17,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:17,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497095674] [2019-12-27 00:23:17,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:17,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:17,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:17,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:17,851 INFO L87 Difference]: Start difference. First operand 42643 states and 231050 transitions. Second operand 9 states. [2019-12-27 00:23:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:19,580 INFO L93 Difference]: Finished difference Result 137478 states and 644727 transitions. [2019-12-27 00:23:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:19,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:20,005 INFO L225 Difference]: With dead ends: 137478 [2019-12-27 00:23:20,005 INFO L226 Difference]: Without dead ends: 137462 [2019-12-27 00:23:20,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137462 states. [2019-12-27 00:23:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137462 to 41717. [2019-12-27 00:23:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41717 states. [2019-12-27 00:23:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41717 states to 41717 states and 225875 transitions. [2019-12-27 00:23:26,012 INFO L78 Accepts]: Start accepts. Automaton has 41717 states and 225875 transitions. Word has length 25 [2019-12-27 00:23:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:26,012 INFO L462 AbstractCegarLoop]: Abstraction has 41717 states and 225875 transitions. [2019-12-27 00:23:26,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 41717 states and 225875 transitions. [2019-12-27 00:23:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:26,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:26,015 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 00:23:26,015 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -46654601, now seen corresponding path program 3 times [2019-12-27 00:23:26,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:26,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587575172] [2019-12-27 00:23:26,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:26,069 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 00:23:26,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587575172] [2019-12-27 00:23:26,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:26,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:26,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641713207] [2019-12-27 00:23:26,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:26,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:26,071 INFO L87 Difference]: Start difference. First operand 41717 states and 225875 transitions. Second operand 9 states. [2019-12-27 00:23:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:27,266 INFO L93 Difference]: Finished difference Result 136774 states and 641773 transitions. [2019-12-27 00:23:27,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:27,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:27,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:27,689 INFO L225 Difference]: With dead ends: 136774 [2019-12-27 00:23:27,690 INFO L226 Difference]: Without dead ends: 136758 [2019-12-27 00:23:27,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136758 states. [2019-12-27 00:23:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136758 to 41129. [2019-12-27 00:23:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41129 states. [2019-12-27 00:23:30,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41129 states to 41129 states and 222593 transitions. [2019-12-27 00:23:30,350 INFO L78 Accepts]: Start accepts. Automaton has 41129 states and 222593 transitions. Word has length 25 [2019-12-27 00:23:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:30,350 INFO L462 AbstractCegarLoop]: Abstraction has 41129 states and 222593 transitions. [2019-12-27 00:23:30,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 41129 states and 222593 transitions. [2019-12-27 00:23:30,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:30,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:30,353 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 00:23:30,353 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:30,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:30,353 INFO L82 PathProgramCache]: Analyzing trace with hash -61078994, now seen corresponding path program 6 times [2019-12-27 00:23:30,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:30,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225964136] [2019-12-27 00:23:30,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:30,404 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 00:23:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225964136] [2019-12-27 00:23:30,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:30,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:30,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530757877] [2019-12-27 00:23:30,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:30,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:30,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:30,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:30,406 INFO L87 Difference]: Start difference. First operand 41129 states and 222593 transitions. Second operand 9 states. [2019-12-27 00:23:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:31,667 INFO L93 Difference]: Finished difference Result 134734 states and 630461 transitions. [2019-12-27 00:23:31,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:31,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:32,074 INFO L225 Difference]: With dead ends: 134734 [2019-12-27 00:23:32,074 INFO L226 Difference]: Without dead ends: 134714 [2019-12-27 00:23:32,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134714 states. [2019-12-27 00:23:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134714 to 39950. [2019-12-27 00:23:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39950 states. [2019-12-27 00:23:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39950 states to 39950 states and 216201 transitions. [2019-12-27 00:23:34,839 INFO L78 Accepts]: Start accepts. Automaton has 39950 states and 216201 transitions. Word has length 25 [2019-12-27 00:23:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:34,840 INFO L462 AbstractCegarLoop]: Abstraction has 39950 states and 216201 transitions. [2019-12-27 00:23:34,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:34,840 INFO L276 IsEmpty]: Start isEmpty. Operand 39950 states and 216201 transitions. [2019-12-27 00:23:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:34,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:34,842 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 00:23:34,843 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash -61103236, now seen corresponding path program 3 times [2019-12-27 00:23:34,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:34,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701779972] [2019-12-27 00:23:34,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:34,890 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 00:23:34,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701779972] [2019-12-27 00:23:34,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:34,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:34,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115367296] [2019-12-27 00:23:34,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:34,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:34,893 INFO L87 Difference]: Start difference. First operand 39950 states and 216201 transitions. Second operand 9 states. [2019-12-27 00:23:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:36,722 INFO L93 Difference]: Finished difference Result 134487 states and 629694 transitions. [2019-12-27 00:23:36,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:36,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:37,151 INFO L225 Difference]: With dead ends: 134487 [2019-12-27 00:23:37,151 INFO L226 Difference]: Without dead ends: 134471 [2019-12-27 00:23:37,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134471 states. [2019-12-27 00:23:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134471 to 39586. [2019-12-27 00:23:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39586 states. [2019-12-27 00:23:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39586 states to 39586 states and 214214 transitions. [2019-12-27 00:23:43,372 INFO L78 Accepts]: Start accepts. Automaton has 39586 states and 214214 transitions. Word has length 25 [2019-12-27 00:23:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:43,372 INFO L462 AbstractCegarLoop]: Abstraction has 39586 states and 214214 transitions. [2019-12-27 00:23:43,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 39586 states and 214214 transitions. [2019-12-27 00:23:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:43,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:43,376 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 00:23:43,376 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash -69926921, now seen corresponding path program 4 times [2019-12-27 00:23:43,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:43,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671881596] [2019-12-27 00:23:43,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:43,427 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 00:23:43,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671881596] [2019-12-27 00:23:43,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:43,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:43,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49597046] [2019-12-27 00:23:43,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:43,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:43,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:43,429 INFO L87 Difference]: Start difference. First operand 39586 states and 214214 transitions. Second operand 9 states. [2019-12-27 00:23:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:44,707 INFO L93 Difference]: Finished difference Result 134693 states and 630836 transitions. [2019-12-27 00:23:44,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:44,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:45,124 INFO L225 Difference]: With dead ends: 134693 [2019-12-27 00:23:45,125 INFO L226 Difference]: Without dead ends: 134673 [2019-12-27 00:23:45,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134673 states. [2019-12-27 00:23:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134673 to 39511. [2019-12-27 00:23:47,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39511 states. [2019-12-27 00:23:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39511 states to 39511 states and 213636 transitions. [2019-12-27 00:23:47,636 INFO L78 Accepts]: Start accepts. Automaton has 39511 states and 213636 transitions. Word has length 25 [2019-12-27 00:23:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:47,636 INFO L462 AbstractCegarLoop]: Abstraction has 39511 states and 213636 transitions. [2019-12-27 00:23:47,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 39511 states and 213636 transitions. [2019-12-27 00:23:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:47,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:47,639 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 00:23:47,639 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:47,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -69941956, now seen corresponding path program 4 times [2019-12-27 00:23:47,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:47,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496289566] [2019-12-27 00:23:47,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:47,687 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 00:23:47,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496289566] [2019-12-27 00:23:47,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:47,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:47,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830758495] [2019-12-27 00:23:47,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:47,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:47,690 INFO L87 Difference]: Start difference. First operand 39511 states and 213636 transitions. Second operand 9 states. [2019-12-27 00:23:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:48,882 INFO L93 Difference]: Finished difference Result 133500 states and 624860 transitions. [2019-12-27 00:23:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:48,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:49,291 INFO L225 Difference]: With dead ends: 133500 [2019-12-27 00:23:49,291 INFO L226 Difference]: Without dead ends: 133480 [2019-12-27 00:23:49,291 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 00:23:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133480 states. [2019-12-27 00:23:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133480 to 39284. [2019-12-27 00:23:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39284 states. [2019-12-27 00:23:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39284 states to 39284 states and 212213 transitions. [2019-12-27 00:23:51,980 INFO L78 Accepts]: Start accepts. Automaton has 39284 states and 212213 transitions. Word has length 25 [2019-12-27 00:23:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:51,980 INFO L462 AbstractCegarLoop]: Abstraction has 39284 states and 212213 transitions. [2019-12-27 00:23:51,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 39284 states and 212213 transitions. [2019-12-27 00:23:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:51,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:51,983 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 00:23:51,983 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:51,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:51,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1098510199, now seen corresponding path program 5 times [2019-12-27 00:23:51,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:51,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431998244] [2019-12-27 00:23:51,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:52,029 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 00:23:52,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431998244] [2019-12-27 00:23:52,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:52,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:52,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98726311] [2019-12-27 00:23:52,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:52,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:52,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:52,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:52,031 INFO L87 Difference]: Start difference. First operand 39284 states and 212213 transitions. Second operand 9 states. [2019-12-27 00:23:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:53,250 INFO L93 Difference]: Finished difference Result 134278 states and 628555 transitions. [2019-12-27 00:23:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:53,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:54,416 INFO L225 Difference]: With dead ends: 134278 [2019-12-27 00:23:54,416 INFO L226 Difference]: Without dead ends: 134262 [2019-12-27 00:23:54,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134262 states. [2019-12-27 00:23:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134262 to 38762. [2019-12-27 00:23:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38762 states. [2019-12-27 00:23:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38762 states to 38762 states and 209279 transitions. [2019-12-27 00:23:56,292 INFO L78 Accepts]: Start accepts. Automaton has 38762 states and 209279 transitions. Word has length 25 [2019-12-27 00:23:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:23:56,292 INFO L462 AbstractCegarLoop]: Abstraction has 38762 states and 209279 transitions. [2019-12-27 00:23:56,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:23:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 38762 states and 209279 transitions. [2019-12-27 00:23:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:23:56,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:23:56,295 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 00:23:56,295 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 00:23:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:23:56,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1084061564, now seen corresponding path program 5 times [2019-12-27 00:23:56,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:23:56,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809641846] [2019-12-27 00:23:56,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:23:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:23:56,345 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 00:23:56,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809641846] [2019-12-27 00:23:56,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:23:56,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:23:56,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974090632] [2019-12-27 00:23:56,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:23:56,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:23:56,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:23:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:23:56,347 INFO L87 Difference]: Start difference. First operand 38762 states and 209279 transitions. Second operand 9 states. [2019-12-27 00:23:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:23:57,990 INFO L93 Difference]: Finished difference Result 133154 states and 622565 transitions. [2019-12-27 00:23:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:23:57,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:23:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:23:58,390 INFO L225 Difference]: With dead ends: 133154 [2019-12-27 00:23:58,391 INFO L226 Difference]: Without dead ends: 133138 [2019-12-27 00:23:58,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:23:58,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133138 states. [2019-12-27 00:24:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133138 to 38386. [2019-12-27 00:24:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38386 states. [2019-12-27 00:24:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38386 states to 38386 states and 207260 transitions. [2019-12-27 00:24:04,175 INFO L78 Accepts]: Start accepts. Automaton has 38386 states and 207260 transitions. Word has length 25 [2019-12-27 00:24:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:04,175 INFO L462 AbstractCegarLoop]: Abstraction has 38386 states and 207260 transitions. [2019-12-27 00:24:04,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:24:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38386 states and 207260 transitions. [2019-12-27 00:24:04,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:24:04,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:04,178 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 00:24:04,178 INFO L410 AbstractCegarLoop]: === Iteration 41 === [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 00:24:04,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:04,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1074047479, now seen corresponding path program 6 times [2019-12-27 00:24:04,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:04,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116940758] [2019-12-27 00:24:04,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:04,227 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 00:24:04,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116940758] [2019-12-27 00:24:04,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:04,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:24:04,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660840065] [2019-12-27 00:24:04,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:24:04,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:24:04,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:24:04,229 INFO L87 Difference]: Start difference. First operand 38386 states and 207260 transitions. Second operand 9 states. [2019-12-27 00:24:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:05,436 INFO L93 Difference]: Finished difference Result 132300 states and 618178 transitions. [2019-12-27 00:24:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:24:05,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:24:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:05,845 INFO L225 Difference]: With dead ends: 132300 [2019-12-27 00:24:05,845 INFO L226 Difference]: Without dead ends: 132280 [2019-12-27 00:24:05,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 00:24:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132280 states. [2019-12-27 00:24:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132280 to 37647. [2019-12-27 00:24:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37647 states. [2019-12-27 00:24:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37647 states to 37647 states and 203286 transitions. [2019-12-27 00:24:08,310 INFO L78 Accepts]: Start accepts. Automaton has 37647 states and 203286 transitions. Word has length 25 [2019-12-27 00:24:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:08,310 INFO L462 AbstractCegarLoop]: Abstraction has 37647 states and 203286 transitions. [2019-12-27 00:24:08,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:24:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 37647 states and 203286 transitions. [2019-12-27 00:24:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 00:24:08,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:08,312 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 00:24:08,312 INFO L410 AbstractCegarLoop]: === Iteration 42 === [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 00:24:08,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:08,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1074032444, now seen corresponding path program 6 times [2019-12-27 00:24:08,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:08,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5823131] [2019-12-27 00:24:08,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:08,366 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 00:24:08,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5823131] [2019-12-27 00:24:08,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 00:24:08,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 00:24:08,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721332467] [2019-12-27 00:24:08,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 00:24:08,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:08,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 00:24:08,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 00:24:08,367 INFO L87 Difference]: Start difference. First operand 37647 states and 203286 transitions. Second operand 9 states. [2019-12-27 00:24:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 00:24:09,529 INFO L93 Difference]: Finished difference Result 131107 states and 612202 transitions. [2019-12-27 00:24:09,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 00:24:09,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 00:24:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 00:24:09,943 INFO L225 Difference]: With dead ends: 131107 [2019-12-27 00:24:09,943 INFO L226 Difference]: Without dead ends: 131087 [2019-12-27 00:24:09,943 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 00:24:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131087 states. [2019-12-27 00:24:12,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131087 to 36710. [2019-12-27 00:24:12,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36710 states. [2019-12-27 00:24:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36710 states to 36710 states and 198310 transitions. [2019-12-27 00:24:12,625 INFO L78 Accepts]: Start accepts. Automaton has 36710 states and 198310 transitions. Word has length 25 [2019-12-27 00:24:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 00:24:12,625 INFO L462 AbstractCegarLoop]: Abstraction has 36710 states and 198310 transitions. [2019-12-27 00:24:12,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 00:24:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 36710 states and 198310 transitions. [2019-12-27 00:24:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 00:24:12,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 00:24:12,629 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 00:24:12,629 INFO L410 AbstractCegarLoop]: === Iteration 43 === [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 00:24:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 00:24:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash 729716532, now seen corresponding path program 1 times [2019-12-27 00:24:12,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 00:24:12,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740510380] [2019-12-27 00:24:12,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 00:24:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-27 00:24:12,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740510380] [2019-12-27 00:24:12,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648497749] [2019-12-27 00:24:12,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 00:24:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 00:24:12,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-27 00:24:12,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 00:24:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-27 00:24:12,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 00:24:12,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-12-27 00:24:12,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060089302] [2019-12-27 00:24:12,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 00:24:12,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 00:24:12,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 00:24:12,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 00:24:12,772 INFO L87 Difference]: Start difference. First operand 36710 states and 198310 transitions. Second operand 7 states. Received shutdown request... [2019-12-27 00:24:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 00:24:13,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 00:24:13,338 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 00:24:13,344 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 00:24:13,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:24:13 BasicIcfg [2019-12-27 00:24:13,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 00:24:13,345 INFO L168 Benchmark]: Toolchain (without parser) took 228535.84 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 102.1 MB in the beginning and 830.9 MB in the end (delta: -728.8 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 00:24:13,346 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 00:24:13,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.94 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.7 MB in the beginning and 161.4 MB in the end (delta: -59.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:24:13,346 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.90 ms. Allocated memory is still 204.5 MB. Free memory was 161.4 MB in the beginning and 159.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:24:13,346 INFO L168 Benchmark]: Boogie Preprocessor took 26.91 ms. Allocated memory is still 204.5 MB. Free memory was 159.5 MB in the beginning and 157.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 00:24:13,347 INFO L168 Benchmark]: RCFGBuilder took 416.97 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 138.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2019-12-27 00:24:13,347 INFO L168 Benchmark]: TraceAbstraction took 227259.82 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 138.6 MB in the beginning and 830.9 MB in the end (delta: -692.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 00:24:13,349 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.94 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.7 MB in the beginning and 161.4 MB in the end (delta: -59.7 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.90 ms. Allocated memory is still 204.5 MB. Free memory was 161.4 MB in the beginning and 159.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.91 ms. Allocated memory is still 204.5 MB. Free memory was 159.5 MB in the beginning and 157.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 416.97 ms. Allocated memory is still 204.5 MB. Free memory was 157.6 MB in the beginning and 138.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 227259.82 ms. Allocated memory was 204.5 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 138.6 MB in the beginning and 830.9 MB in the end (delta: -692.3 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.4s, 55 ProgramPointsBefore, 15 ProgramPointsAfterwards, 51 TransitionsBefore, 12 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 5 FixpointIterations, 13 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 366 VarBasedMoverChecksPositive, 5 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 5 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 524 CheckedPairsTotal, 42 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 1108 CoEnabledTransitionPairs, 6 FixpointIterations, 22 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 615 VarBasedMoverChecksPositive, 15 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1164 CheckedPairsTotal, 55 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 97 ProgramPointsBefore, 34 ProgramPointsAfterwards, 87 TransitionsBefore, 27 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 4 ChoiceCompositions, 786 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1613 CheckedPairsTotal, 72 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 118 ProgramPointsBefore, 42 ProgramPointsAfterwards, 105 TransitionsBefore, 33 TransitionsAfterwards, 2192 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 3 ConcurrentYvCompositions, 5 ChoiceCompositions, 1107 VarBasedMoverChecksPositive, 24 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 26 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 2358 CheckedPairsTotal, 87 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.1s, 139 ProgramPointsBefore, 50 ProgramPointsAfterwards, 123 TransitionsBefore, 39 TransitionsAfterwards, 2860 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1320 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 3115 CheckedPairsTotal, 100 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 160 ProgramPointsBefore, 58 ProgramPointsAfterwards, 141 TransitionsBefore, 45 TransitionsAfterwards, 3612 CoEnabledTransitionPairs, 6 FixpointIterations, 63 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1765 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.2s, 0 MoverChecksTotal, 4276 CheckedPairsTotal, 117 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 676). Cancelled while BasicCegarLoop was constructing difference of abstraction (36710states) and FLOYD_HOARE automaton (currently 13 states, 7 states before enhancement),while ReachableStatesComputation was computing reachable states (38826 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 49 locations, 1 error locations. Result: TIMEOUT, OverallTime: 160.5s, OverallIterations: 43, TraceHistogramMax: 5, AutomataDifference: 57.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3399 SDtfs, 10528 SDslu, 10350 SDs, 0 SdLazy, 11707 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1249 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 915 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5775 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42643occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 92.8s AutomataMinimizationTime, 42 MinimizatonAttempts, 2625345 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1276 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1226 ConstructedInterpolants, 0 QuantifiedInterpolants, 81156 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1809 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 58 InterpolantComputations, 28 PerfectInterpolantSequences, 630/846 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