/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:11:23,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:11:23,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:11:23,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:11:23,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:11:23,591 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:11:23,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:11:23,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:11:23,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:11:23,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:11:23,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:11:23,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:11:23,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:11:23,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:11:23,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:11:23,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:11:23,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:11:23,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:11:23,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:11:23,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:11:23,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:11:23,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:11:23,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:11:23,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:11:23,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:11:23,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:11:23,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:11:23,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:11:23,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:11:23,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:11:23,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:11:23,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:11:23,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:11:23,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:11:23,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:11:23,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:11:23,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:11:23,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:11:23,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:11:23,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:11:23,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:11:23,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 19:11:23,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:11:23,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:11:23,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:11:23,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:11:23,651 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:11:23,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:11:23,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:11:23,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:11:23,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:11:23,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:11:23,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:11:23,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:11:23,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:11:23,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:11:23,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:11:23,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:11:23,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:11:23,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:11:23,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:11:23,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:11:23,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:11:23,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:11:23,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:11:23,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:11:23,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:11:23,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:11:23,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:11:23,658 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:11:23,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:11:23,658 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:11:23,659 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:11:23,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:11:23,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:11:23,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:11:23,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:11:23,941 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:11:23,942 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2019-12-27 19:11:24,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33bcd49e/9a6c3c7d1404474fa6e024a347085638/FLAG8d0da3a00 [2019-12-27 19:11:24,560 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:11:24,561 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-nondet/nondet-loop-bound-2.i [2019-12-27 19:11:24,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33bcd49e/9a6c3c7d1404474fa6e024a347085638/FLAG8d0da3a00 [2019-12-27 19:11:24,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33bcd49e/9a6c3c7d1404474fa6e024a347085638 [2019-12-27 19:11:24,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:11:24,865 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:11:24,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:11:24,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:11:24,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:11:24,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:11:24" (1/1) ... [2019-12-27 19:11:24,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78830e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:24, skipping insertion in model container [2019-12-27 19:11:24,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:11:24" (1/1) ... [2019-12-27 19:11:24,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:11:24,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:11:25,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:11:25,428 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:11:25,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:11:25,580 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:11:25,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25 WrapperNode [2019-12-27 19:11:25,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:11:25,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:11:25,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:11:25,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:11:25,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25" (1/1) ... [2019-12-27 19:11: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 07:11:25" (1/1) ... [2019-12-27 19:11:25,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:11:25,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:11:25,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:11:25,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:11:25,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25" (1/1) ... [2019-12-27 19:11:25,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25" (1/1) ... [2019-12-27 19:11:25,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25" (1/1) ... [2019-12-27 19:11:25,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25" (1/1) ... [2019-12-27 19:11:25,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25" (1/1) ... [2019-12-27 19:11: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 07:11:25" (1/1) ... [2019-12-27 19:11: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 07:11:25" (1/1) ... [2019-12-27 19:11:25,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:11:25,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:11:25,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:11:25,666 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:11:25,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11: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 19:11:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2019-12-27 19:11:25,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2019-12-27 19:11:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-12-27 19:11:25,731 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-12-27 19:11:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:11:25,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:11:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:11:25,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:11:25,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:11:25,734 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:11:26,120 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:11:26,121 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-27 19:11:26,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:11:26 BoogieIcfgContainer [2019-12-27 19:11:26,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:11:26,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:11:26,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:11:26,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:11:26,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:11:24" (1/3) ... [2019-12-27 19:11:26,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf615dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:11:26, skipping insertion in model container [2019-12-27 19:11:26,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:11:25" (2/3) ... [2019-12-27 19:11:26,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf615dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:11:26, skipping insertion in model container [2019-12-27 19:11:26,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:11:26" (3/3) ... [2019-12-27 19:11:26,130 INFO L109 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-2.i [2019-12-27 19:11:26,141 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:11:26,141 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:11:26,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-27 19:11:26,150 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:11:26,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,181 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,182 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,183 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,184 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,185 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,185 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,186 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,186 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,187 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,187 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,194 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,194 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,194 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,195 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,195 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,201 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,202 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,202 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,203 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,203 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,203 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:26,221 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-27 19:11:26,241 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:26,241 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:26,241 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:26,241 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:26,241 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:26,242 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:26,242 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:26,242 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:26,256 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 53 transitions [2019-12-27 19:11:26,258 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 19:11:26,304 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 19:11:26,305 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:11:26,311 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 19:11:26,314 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions [2019-12-27 19:11:26,338 INFO L132 PetriNetUnfolder]: 3/63 cut-off events. [2019-12-27 19:11:26,338 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 19:11:26,340 INFO L76 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs. 0/57 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2019-12-27 19:11:26,342 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 592 [2019-12-27 19:11:26,344 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:27,705 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 19:11:27,812 INFO L206 etLargeBlockEncoding]: Checked pairs total: 489 [2019-12-27 19:11:27,812 INFO L214 etLargeBlockEncoding]: Total number of compositions: 46 [2019-12-27 19:11:27,816 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 15 places, 12 transitions [2019-12-27 19:11:27,825 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44 states. [2019-12-27 19:11:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-12-27 19:11:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:27,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:27,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:27,836 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:27,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:27,842 INFO L82 PathProgramCache]: Analyzing trace with hash 210014, now seen corresponding path program 1 times [2019-12-27 19:11:27,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:27,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186484407] [2019-12-27 19:11:27,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:28,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186484407] [2019-12-27 19:11:28,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:28,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:28,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360813181] [2019-12-27 19:11:28,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:28,168 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:28,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:28,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:28,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:28,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:28,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:28,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:28,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:28,203 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-12-27 19:11:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:28,246 INFO L93 Difference]: Finished difference Result 35 states and 59 transitions. [2019-12-27 19:11:28,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:28,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:28,274 INFO L225 Difference]: With dead ends: 35 [2019-12-27 19:11:28,275 INFO L226 Difference]: Without dead ends: 31 [2019-12-27 19:11:28,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-27 19:11:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-27 19:11:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-27 19:11:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-12-27 19:11:28,316 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 3 [2019-12-27 19:11:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:28,316 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-12-27 19:11:28,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-12-27 19:11:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:11:28,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:28,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:28,318 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash 647068079, now seen corresponding path program 1 times [2019-12-27 19:11:28,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:28,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736308516] [2019-12-27 19:11:28,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:28,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736308516] [2019-12-27 19:11:28,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:28,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:11:28,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42966891] [2019-12-27 19:11:28,448 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:28,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:28,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:11:28,452 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:28,453 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:28,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 19:11:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 19:11:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:11:28,455 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-12-27 19:11:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:28,473 INFO L93 Difference]: Finished difference Result 26 states and 42 transitions. [2019-12-27 19:11:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 19:11:28,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-27 19:11:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:28,475 INFO L225 Difference]: With dead ends: 26 [2019-12-27 19:11:28,475 INFO L226 Difference]: Without dead ends: 24 [2019-12-27 19:11:28,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 19:11:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-27 19:11:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-27 19:11:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-27 19:11:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions. [2019-12-27 19:11:28,481 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 7 [2019-12-27 19:11:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:28,481 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 39 transitions. [2019-12-27 19:11:28,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 19:11:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions. [2019-12-27 19:11:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:11:28,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:28,482 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:28,482 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:28,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1415732781, now seen corresponding path program 1 times [2019-12-27 19:11:28,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:28,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414855096] [2019-12-27 19:11:28,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:28,563 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:28,563 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:28,564 WARN L364 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:28,564 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2019-12-27 19:11:28,573 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,573 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,573 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,574 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,574 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,575 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,575 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,575 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,575 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,575 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,575 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,579 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,579 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,579 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,580 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,580 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,581 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,582 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,583 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,584 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,584 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,585 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,586 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,586 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,586 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,586 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,597 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,597 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,597 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,598 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,598 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,600 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,600 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,601 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,601 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,601 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,602 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,603 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,603 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,603 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:28,605 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 19:11:28,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:28,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:28,605 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:28,605 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:28,605 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:28,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:28,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:28,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:28,609 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 69 transitions [2019-12-27 19:11:28,609 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 19:11:28,650 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 19:11:28,651 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:11:28,653 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 19:11:28,656 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 76 places, 69 transitions [2019-12-27 19:11:28,696 INFO L132 PetriNetUnfolder]: 4/84 cut-off events. [2019-12-27 19:11:28,696 INFO L133 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2019-12-27 19:11:28,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 84 events. 4/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs. 0/76 useless extension candidates. Maximal degree in co-relation 93. Up to 6 conditions per place. [2019-12-27 19:11:28,706 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 920 [2019-12-27 19:11:28,706 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:30,047 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 19:11:30,146 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1034 [2019-12-27 19:11:30,147 INFO L214 etLargeBlockEncoding]: Total number of compositions: 57 [2019-12-27 19:11:30,147 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 21 transitions [2019-12-27 19:11:30,159 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 224 states. [2019-12-27 19:11:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2019-12-27 19:11:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:30,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:30,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:30,160 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:30,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash 353600, now seen corresponding path program 1 times [2019-12-27 19:11:30,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:30,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461709231] [2019-12-27 19:11:30,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:30,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461709231] [2019-12-27 19:11:30,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:30,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:30,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [231695580] [2019-12-27 19:11:30,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:30,198 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:30,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:30,199 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:30,199 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:30,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:30,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:30,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:30,200 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2019-12-27 19:11:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:30,230 INFO L93 Difference]: Finished difference Result 185 states and 459 transitions. [2019-12-27 19:11:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:30,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:30,235 INFO L225 Difference]: With dead ends: 185 [2019-12-27 19:11:30,235 INFO L226 Difference]: Without dead ends: 171 [2019-12-27 19:11:30,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-27 19:11:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-12-27 19:11:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-12-27 19:11:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 417 transitions. [2019-12-27 19:11:30,263 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 417 transitions. Word has length 3 [2019-12-27 19:11:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:30,263 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 417 transitions. [2019-12-27 19:11:30,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 417 transitions. [2019-12-27 19:11:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:30,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:30,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:30,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -677960350, now seen corresponding path program 1 times [2019-12-27 19:11:30,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:30,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025637315] [2019-12-27 19:11:30,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:30,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025637315] [2019-12-27 19:11:30,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:30,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:30,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139288326] [2019-12-27 19:11:30,318 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:30,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:30,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:30,321 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:30,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:30,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:30,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:30,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:30,322 INFO L87 Difference]: Start difference. First operand 169 states and 417 transitions. Second operand 5 states. [2019-12-27 19:11:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:30,402 INFO L93 Difference]: Finished difference Result 204 states and 460 transitions. [2019-12-27 19:11:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:30,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:30,405 INFO L225 Difference]: With dead ends: 204 [2019-12-27 19:11:30,405 INFO L226 Difference]: Without dead ends: 201 [2019-12-27 19:11:30,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-12-27 19:11:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 162. [2019-12-27 19:11:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-27 19:11:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 399 transitions. [2019-12-27 19:11:30,425 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 399 transitions. Word has length 9 [2019-12-27 19:11:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:30,425 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 399 transitions. [2019-12-27 19:11:30,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 399 transitions. [2019-12-27 19:11:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:30,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:30,427 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:30,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1901960811, now seen corresponding path program 1 times [2019-12-27 19:11:30,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:30,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573110537] [2019-12-27 19:11:30,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:30,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573110537] [2019-12-27 19:11:30,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:30,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:30,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [775910235] [2019-12-27 19:11:30,540 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:30,542 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:30,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:30,545 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:30,545 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:30,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:30,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:30,546 INFO L87 Difference]: Start difference. First operand 162 states and 399 transitions. Second operand 5 states. [2019-12-27 19:11:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:30,631 INFO L93 Difference]: Finished difference Result 189 states and 423 transitions. [2019-12-27 19:11:30,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:30,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:30,636 INFO L225 Difference]: With dead ends: 189 [2019-12-27 19:11:30,636 INFO L226 Difference]: Without dead ends: 185 [2019-12-27 19:11:30,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-27 19:11:30,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 153. [2019-12-27 19:11:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-12-27 19:11:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 367 transitions. [2019-12-27 19:11:30,651 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 367 transitions. Word has length 13 [2019-12-27 19:11:30,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:30,653 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 367 transitions. [2019-12-27 19:11:30,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 367 transitions. [2019-12-27 19:11:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:11:30,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:30,654 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:30,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:30,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1166778350, now seen corresponding path program 1 times [2019-12-27 19:11:30,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:30,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274275919] [2019-12-27 19:11:30,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:30,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:30,689 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:30,689 WARN L364 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:30,689 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2019-12-27 19:11:30,701 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,701 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,701 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,701 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,705 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,705 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,706 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,706 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,707 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,707 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,708 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,711 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,711 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,712 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,712 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,713 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,713 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,714 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,714 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,716 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,717 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,717 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,718 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,720 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,720 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,720 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,720 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,721 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,721 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,721 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,723 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,723 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,724 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,725 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,725 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,725 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,726 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,726 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,726 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,726 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,726 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,727 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,727 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,727 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,728 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,728 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,728 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,729 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,729 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,729 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,729 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,734 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,734 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,734 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,735 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,735 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,735 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:30,737 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 19:11:30,738 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:30,738 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:30,738 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:30,738 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:30,738 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:30,738 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:30,739 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:30,739 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:30,742 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 85 transitions [2019-12-27 19:11:30,743 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 19:11:30,760 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 19:11:30,760 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:11:30,762 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 19:11:30,765 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 95 places, 85 transitions [2019-12-27 19:11:30,778 INFO L132 PetriNetUnfolder]: 5/105 cut-off events. [2019-12-27 19:11:30,778 INFO L133 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2019-12-27 19:11:30,780 INFO L76 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 105 events. 5/105 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 153 event pairs. 0/95 useless extension candidates. Maximal degree in co-relation 119. Up to 8 conditions per place. [2019-12-27 19:11:30,783 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1308 [2019-12-27 19:11:30,783 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:32,320 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-27 19:11:32,424 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1615 [2019-12-27 19:11:32,425 INFO L214 etLargeBlockEncoding]: Total number of compositions: 69 [2019-12-27 19:11:32,425 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 27 transitions [2019-12-27 19:11:32,453 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 683 states. [2019-12-27 19:11:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states. [2019-12-27 19:11:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:32,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:32,454 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:32,455 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:32,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:32,455 INFO L82 PathProgramCache]: Analyzing trace with hash 525945, now seen corresponding path program 1 times [2019-12-27 19:11:32,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:32,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243749707] [2019-12-27 19:11:32,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:32,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243749707] [2019-12-27 19:11:32,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:32,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:32,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781589282] [2019-12-27 19:11:32,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:32,486 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:32,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:32,487 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:32,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:32,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:32,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:32,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:32,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:32,488 INFO L87 Difference]: Start difference. First operand 683 states. Second operand 3 states. [2019-12-27 19:11:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:32,519 INFO L93 Difference]: Finished difference Result 600 states and 1886 transitions. [2019-12-27 19:11:32,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:32,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:32,526 INFO L225 Difference]: With dead ends: 600 [2019-12-27 19:11:32,526 INFO L226 Difference]: Without dead ends: 559 [2019-12-27 19:11:32,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-27 19:11:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 547. [2019-12-27 19:11:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-27 19:11:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 1723 transitions. [2019-12-27 19:11:32,561 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 1723 transitions. Word has length 3 [2019-12-27 19:11:32,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:32,561 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 1723 transitions. [2019-12-27 19:11:32,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 1723 transitions. [2019-12-27 19:11:32,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:32,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:32,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:32,562 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:32,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash -2106616436, now seen corresponding path program 1 times [2019-12-27 19:11:32,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:32,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116745577] [2019-12-27 19:11:32,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:32,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116745577] [2019-12-27 19:11:32,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:32,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:32,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [136601646] [2019-12-27 19:11:32,619 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:32,620 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:32,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:32,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:32,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:32,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:32,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:32,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:32,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:32,622 INFO L87 Difference]: Start difference. First operand 547 states and 1723 transitions. Second operand 5 states. [2019-12-27 19:11:32,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:32,738 INFO L93 Difference]: Finished difference Result 802 states and 2304 transitions. [2019-12-27 19:11:32,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:32,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:32,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:32,746 INFO L225 Difference]: With dead ends: 802 [2019-12-27 19:11:32,746 INFO L226 Difference]: Without dead ends: 799 [2019-12-27 19:11:32,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-12-27 19:11:32,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 576. [2019-12-27 19:11:32,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-12-27 19:11:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 1822 transitions. [2019-12-27 19:11:32,777 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 1822 transitions. Word has length 9 [2019-12-27 19:11:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:32,777 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 1822 transitions. [2019-12-27 19:11:32,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 1822 transitions. [2019-12-27 19:11:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:32,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:32,783 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:32,783 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1813947824, now seen corresponding path program 1 times [2019-12-27 19:11:32,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:32,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909310804] [2019-12-27 19:11:32,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:32,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909310804] [2019-12-27 19:11:32,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:32,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1849763676] [2019-12-27 19:11:32,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:32,865 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:32,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:32,868 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:32,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:32,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:32,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:32,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:32,869 INFO L87 Difference]: Start difference. First operand 576 states and 1822 transitions. Second operand 5 states. [2019-12-27 19:11:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:32,970 INFO L93 Difference]: Finished difference Result 832 states and 2399 transitions. [2019-12-27 19:11:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:32,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:32,977 INFO L225 Difference]: With dead ends: 832 [2019-12-27 19:11:32,977 INFO L226 Difference]: Without dead ends: 828 [2019-12-27 19:11:32,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-27 19:11:32,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 605. [2019-12-27 19:11:32,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 19:11:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1901 transitions. [2019-12-27 19:11:33,003 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1901 transitions. Word has length 13 [2019-12-27 19:11:33,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:33,003 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1901 transitions. [2019-12-27 19:11:33,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:33,004 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1901 transitions. [2019-12-27 19:11:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:33,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:33,006 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:33,006 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:33,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash -693557262, now seen corresponding path program 1 times [2019-12-27 19:11:33,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:33,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293183329] [2019-12-27 19:11:33,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:33,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293183329] [2019-12-27 19:11:33,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405572942] [2019-12-27 19:11:33,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:33,193 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:33,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:33,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:33,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:33,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:33,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [381325412] [2019-12-27 19:11:33,280 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:33,282 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:33,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:11:33,285 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:33,321 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:33,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:33,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:33,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:33,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:33,322 INFO L87 Difference]: Start difference. First operand 605 states and 1901 transitions. Second operand 9 states. [2019-12-27 19:11:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:33,816 INFO L93 Difference]: Finished difference Result 1125 states and 2921 transitions. [2019-12-27 19:11:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:33,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 19:11:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:33,826 INFO L225 Difference]: With dead ends: 1125 [2019-12-27 19:11:33,826 INFO L226 Difference]: Without dead ends: 1120 [2019-12-27 19:11:33,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-12-27 19:11:33,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 587. [2019-12-27 19:11:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-12-27 19:11:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1837 transitions. [2019-12-27 19:11:33,851 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1837 transitions. Word has length 15 [2019-12-27 19:11:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:33,851 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 1837 transitions. [2019-12-27 19:11:33,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1837 transitions. [2019-12-27 19:11:33,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:33,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:33,852 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:34,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:34,056 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:34,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:34,056 INFO L82 PathProgramCache]: Analyzing trace with hash -552862538, now seen corresponding path program 2 times [2019-12-27 19:11:34,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:34,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085807278] [2019-12-27 19:11:34,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:34,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085807278] [2019-12-27 19:11:34,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:34,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:34,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [279416702] [2019-12-27 19:11:34,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:34,120 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:34,122 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:11:34,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:34,123 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:34,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:34,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:34,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:34,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:34,124 INFO L87 Difference]: Start difference. First operand 587 states and 1837 transitions. Second operand 7 states. [2019-12-27 19:11:34,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:34,385 INFO L93 Difference]: Finished difference Result 1050 states and 2805 transitions. [2019-12-27 19:11:34,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:34,385 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:11:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:34,392 INFO L225 Difference]: With dead ends: 1050 [2019-12-27 19:11:34,392 INFO L226 Difference]: Without dead ends: 1045 [2019-12-27 19:11:34,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-12-27 19:11:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 536. [2019-12-27 19:11:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-27 19:11:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1688 transitions. [2019-12-27 19:11:34,414 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1688 transitions. Word has length 15 [2019-12-27 19:11:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:34,415 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1688 transitions. [2019-12-27 19:11:34,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1688 transitions. [2019-12-27 19:11:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:11:34,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:34,416 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:34,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:34,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:34,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1197543999, now seen corresponding path program 1 times [2019-12-27 19:11:34,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:34,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955310180] [2019-12-27 19:11:34,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:11:34,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955310180] [2019-12-27 19:11:34,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:34,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:34,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [530167821] [2019-12-27 19:11:34,459 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:34,460 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:34,463 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:11:34,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:34,463 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:34,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:34,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:34,464 INFO L87 Difference]: Start difference. First operand 536 states and 1688 transitions. Second operand 5 states. [2019-12-27 19:11:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:34,559 INFO L93 Difference]: Finished difference Result 736 states and 2123 transitions. [2019-12-27 19:11:34,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:34,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:11:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:34,565 INFO L225 Difference]: With dead ends: 736 [2019-12-27 19:11:34,566 INFO L226 Difference]: Without dead ends: 728 [2019-12-27 19:11:34,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-12-27 19:11:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 549. [2019-12-27 19:11:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-12-27 19:11:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1684 transitions. [2019-12-27 19:11:34,584 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1684 transitions. Word has length 17 [2019-12-27 19:11:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:34,584 INFO L462 AbstractCegarLoop]: Abstraction has 549 states and 1684 transitions. [2019-12-27 19:11:34,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1684 transitions. [2019-12-27 19:11:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:11:34,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:34,585 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:34,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:34,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1527881090, now seen corresponding path program 1 times [2019-12-27 19:11:34,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:34,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027947818] [2019-12-27 19:11:34,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:34,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:34,613 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:34,614 WARN L364 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:34,614 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2019-12-27 19:11:34,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,625 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,625 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,626 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,626 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,627 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,627 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,628 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,628 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,629 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,629 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,630 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,631 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,631 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,632 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,632 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,633 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,633 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,634 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,634 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,634 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,634 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,635 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,635 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,636 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,636 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,636 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,636 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,637 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,640 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,640 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,640 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,641 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,641 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,648 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,649 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,649 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,649 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,650 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,650 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,651 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,651 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,651 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,652 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,652 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,652 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,653 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,653 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,654 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,654 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,655 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,655 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,655 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,656 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,656 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,656 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,657 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,657 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,657 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,659 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,659 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,659 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,659 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,659 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,660 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:34,661 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 19:11:34,661 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:34,661 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:34,661 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:34,661 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:34,661 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:34,662 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:34,662 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:34,662 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:34,664 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 101 transitions [2019-12-27 19:11:34,664 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 19:11:34,698 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 19:11:34,698 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:11:34,700 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 19:11:34,703 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 114 places, 101 transitions [2019-12-27 19:11:34,719 INFO L132 PetriNetUnfolder]: 6/126 cut-off events. [2019-12-27 19:11:34,719 INFO L133 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2019-12-27 19:11:34,721 INFO L76 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 126 events. 6/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 187 event pairs. 0/114 useless extension candidates. Maximal degree in co-relation 146. Up to 10 conditions per place. [2019-12-27 19:11:34,725 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1756 [2019-12-27 19:11:34,725 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:36,368 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-12-27 19:11:36,609 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2111 [2019-12-27 19:11:36,609 INFO L214 etLargeBlockEncoding]: Total number of compositions: 84 [2019-12-27 19:11:36,609 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions [2019-12-27 19:11:36,725 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2060 states. [2019-12-27 19:11:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states. [2019-12-27 19:11:36,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:36,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:36,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:36,726 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:36,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:36,727 INFO L82 PathProgramCache]: Analyzing trace with hash 729974, now seen corresponding path program 1 times [2019-12-27 19:11:36,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:36,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462945563] [2019-12-27 19:11:36,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:36,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462945563] [2019-12-27 19:11:36,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:36,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:36,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234201620] [2019-12-27 19:11:36,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:36,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:36,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:36,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:36,748 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:36,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:36,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:36,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:36,754 INFO L87 Difference]: Start difference. First operand 2060 states. Second operand 3 states. [2019-12-27 19:11:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:36,802 INFO L93 Difference]: Finished difference Result 1889 states and 7217 transitions. [2019-12-27 19:11:36,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:36,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:36,820 INFO L225 Difference]: With dead ends: 1889 [2019-12-27 19:11:36,821 INFO L226 Difference]: Without dead ends: 1767 [2019-12-27 19:11:36,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-12-27 19:11:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1717. [2019-12-27 19:11:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1717 states. [2019-12-27 19:11:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 6597 transitions. [2019-12-27 19:11:36,903 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 6597 transitions. Word has length 3 [2019-12-27 19:11:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:36,904 INFO L462 AbstractCegarLoop]: Abstraction has 1717 states and 6597 transitions. [2019-12-27 19:11:36,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 6597 transitions. [2019-12-27 19:11:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:36,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:36,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:36,905 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:36,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1449000874, now seen corresponding path program 1 times [2019-12-27 19:11:36,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:36,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432547693] [2019-12-27 19:11:36,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:36,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432547693] [2019-12-27 19:11:36,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:36,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:36,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [739131711] [2019-12-27 19:11:36,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:36,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:36,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:36,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:36,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:36,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:36,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:36,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:36,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:36,942 INFO L87 Difference]: Start difference. First operand 1717 states and 6597 transitions. Second operand 5 states. [2019-12-27 19:11:37,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:37,040 INFO L93 Difference]: Finished difference Result 2826 states and 10014 transitions. [2019-12-27 19:11:37,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:37,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:37,062 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 19:11:37,062 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 19:11:37,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 19:11:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1914. [2019-12-27 19:11:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 19:11:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 7409 transitions. [2019-12-27 19:11:37,143 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 7409 transitions. Word has length 9 [2019-12-27 19:11:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:37,143 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 7409 transitions. [2019-12-27 19:11:37,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 7409 transitions. [2019-12-27 19:11:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:37,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:37,144 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:37,144 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 302089454, now seen corresponding path program 1 times [2019-12-27 19:11:37,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:37,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138136950] [2019-12-27 19:11:37,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:37,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138136950] [2019-12-27 19:11:37,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:37,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:37,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515320774] [2019-12-27 19:11:37,187 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:37,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:37,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:37,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:37,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:37,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:37,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:37,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:37,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:37,192 INFO L87 Difference]: Start difference. First operand 1914 states and 7409 transitions. Second operand 5 states. [2019-12-27 19:11:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:37,294 INFO L93 Difference]: Finished difference Result 3124 states and 11194 transitions. [2019-12-27 19:11:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:37,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:37,328 INFO L225 Difference]: With dead ends: 3124 [2019-12-27 19:11:37,328 INFO L226 Difference]: Without dead ends: 3120 [2019-12-27 19:11:37,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:37,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-12-27 19:11:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2147. [2019-12-27 19:11:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-12-27 19:11:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 8364 transitions. [2019-12-27 19:11:37,449 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 8364 transitions. Word has length 13 [2019-12-27 19:11:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:37,452 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 8364 transitions. [2019-12-27 19:11:37,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 8364 transitions. [2019-12-27 19:11:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:37,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:37,454 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:37,454 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1953005855, now seen corresponding path program 1 times [2019-12-27 19:11:37,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:37,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095186687] [2019-12-27 19:11:37,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:37,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095186687] [2019-12-27 19:11:37,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523990460] [2019-12-27 19:11:37,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:37,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:37,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:37,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:37,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:37,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135127370] [2019-12-27 19:11:37,691 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:37,692 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:37,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:11:37,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:37,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:37,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:37,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:37,732 INFO L87 Difference]: Start difference. First operand 2147 states and 8364 transitions. Second operand 9 states. [2019-12-27 19:11:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:38,192 INFO L93 Difference]: Finished difference Result 4795 states and 15556 transitions. [2019-12-27 19:11:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:38,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 19:11:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:38,225 INFO L225 Difference]: With dead ends: 4795 [2019-12-27 19:11:38,226 INFO L226 Difference]: Without dead ends: 4790 [2019-12-27 19:11:38,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2019-12-27 19:11:38,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 2109. [2019-12-27 19:11:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-12-27 19:11:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 8197 transitions. [2019-12-27 19:11:38,333 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 8197 transitions. Word has length 15 [2019-12-27 19:11:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:38,334 INFO L462 AbstractCegarLoop]: Abstraction has 2109 states and 8197 transitions. [2019-12-27 19:11:38,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 8197 transitions. [2019-12-27 19:11:38,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:38,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:38,335 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:38,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:38,538 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825449, now seen corresponding path program 2 times [2019-12-27 19:11:38,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:38,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908714211] [2019-12-27 19:11:38,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:38,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908714211] [2019-12-27 19:11:38,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:38,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:38,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885083211] [2019-12-27 19:11:38,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:38,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:38,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:11:38,592 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:38,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:38,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:38,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:38,593 INFO L87 Difference]: Start difference. First operand 2109 states and 8197 transitions. Second operand 7 states. [2019-12-27 19:11:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:38,922 INFO L93 Difference]: Finished difference Result 4522 states and 14986 transitions. [2019-12-27 19:11:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:38,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:11:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:38,942 INFO L225 Difference]: With dead ends: 4522 [2019-12-27 19:11:38,943 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 19:11:38,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 19:11:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 1998. [2019-12-27 19:11:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2019-12-27 19:11:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7779 transitions. [2019-12-27 19:11:39,031 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7779 transitions. Word has length 15 [2019-12-27 19:11:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:39,031 INFO L462 AbstractCegarLoop]: Abstraction has 1998 states and 7779 transitions. [2019-12-27 19:11:39,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7779 transitions. [2019-12-27 19:11:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:11:39,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:39,032 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:39,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1726909890, now seen corresponding path program 1 times [2019-12-27 19:11:39,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:39,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227972121] [2019-12-27 19:11:39,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:11:39,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227972121] [2019-12-27 19:11:39,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:39,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:39,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1544971756] [2019-12-27 19:11:39,080 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:39,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:39,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:11:39,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:39,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:39,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:39,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:39,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:39,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:39,086 INFO L87 Difference]: Start difference. First operand 1998 states and 7779 transitions. Second operand 5 states. [2019-12-27 19:11:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:39,178 INFO L93 Difference]: Finished difference Result 3208 states and 11604 transitions. [2019-12-27 19:11:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:39,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:11:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:39,190 INFO L225 Difference]: With dead ends: 3208 [2019-12-27 19:11:39,191 INFO L226 Difference]: Without dead ends: 3200 [2019-12-27 19:11:39,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:39,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2019-12-27 19:11:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 2245. [2019-12-27 19:11:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2245 states. [2019-12-27 19:11:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2245 states to 2245 states and 8702 transitions. [2019-12-27 19:11:39,267 INFO L78 Accepts]: Start accepts. Automaton has 2245 states and 8702 transitions. Word has length 17 [2019-12-27 19:11:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:39,267 INFO L462 AbstractCegarLoop]: Abstraction has 2245 states and 8702 transitions. [2019-12-27 19:11:39,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2245 states and 8702 transitions. [2019-12-27 19:11:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:39,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:39,269 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:39,269 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:39,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:39,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2140493091, now seen corresponding path program 1 times [2019-12-27 19:11:39,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:39,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304391700] [2019-12-27 19:11:39,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:11:39,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304391700] [2019-12-27 19:11:39,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878945600] [2019-12-27 19:11:39,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:39,392 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:39,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:11:39,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:39,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:39,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [500003789] [2019-12-27 19:11:39,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:39,448 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:39,453 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 19:11:39,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:39,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:39,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:11:39,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:39,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:11:39,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:39,504 INFO L87 Difference]: Start difference. First operand 2245 states and 8702 transitions. Second operand 10 states. [2019-12-27 19:11:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:40,072 INFO L93 Difference]: Finished difference Result 5135 states and 16723 transitions. [2019-12-27 19:11:40,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:40,072 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 19:11:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:40,090 INFO L225 Difference]: With dead ends: 5135 [2019-12-27 19:11:40,091 INFO L226 Difference]: Without dead ends: 5126 [2019-12-27 19:11:40,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:11:40,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5126 states. [2019-12-27 19:11:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5126 to 2270. [2019-12-27 19:11:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2270 states. [2019-12-27 19:11:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 8766 transitions. [2019-12-27 19:11:40,189 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 8766 transitions. Word has length 19 [2019-12-27 19:11:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:40,191 INFO L462 AbstractCegarLoop]: Abstraction has 2270 states and 8766 transitions. [2019-12-27 19:11:40,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:11:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 8766 transitions. [2019-12-27 19:11:40,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:40,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:40,195 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:40,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:40,400 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1012596352, now seen corresponding path program 1 times [2019-12-27 19:11:40,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:40,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509808746] [2019-12-27 19:11:40,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:40,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509808746] [2019-12-27 19:11:40,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942843870] [2019-12-27 19:11:40,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:40,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:40,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:40,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:40,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:40,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1491694504] [2019-12-27 19:11:40,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:40,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:40,647 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 19:11:40,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:40,695 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:40,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:40,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:40,696 INFO L87 Difference]: Start difference. First operand 2270 states and 8766 transitions. Second operand 9 states. [2019-12-27 19:11:41,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:41,190 INFO L93 Difference]: Finished difference Result 5272 states and 17168 transitions. [2019-12-27 19:11:41,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:41,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 19:11:41,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:41,204 INFO L225 Difference]: With dead ends: 5272 [2019-12-27 19:11:41,205 INFO L226 Difference]: Without dead ends: 5259 [2019-12-27 19:11:41,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-12-27 19:11:41,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 2267. [2019-12-27 19:11:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2019-12-27 19:11:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 8739 transitions. [2019-12-27 19:11:41,323 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 8739 transitions. Word has length 19 [2019-12-27 19:11:41,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:41,323 INFO L462 AbstractCegarLoop]: Abstraction has 2267 states and 8739 transitions. [2019-12-27 19:11:41,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:41,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 8739 transitions. [2019-12-27 19:11:41,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:41,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:41,325 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:41,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:41,536 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1703029164, now seen corresponding path program 2 times [2019-12-27 19:11:41,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:41,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55842391] [2019-12-27 19:11:41,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:11:41,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55842391] [2019-12-27 19:11:41,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:41,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:41,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700054994] [2019-12-27 19:11:41,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:41,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:41,645 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:11:41,646 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:41,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:41,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:41,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:41,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:41,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:41,649 INFO L87 Difference]: Start difference. First operand 2267 states and 8739 transitions. Second operand 7 states. [2019-12-27 19:11:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:41,962 INFO L93 Difference]: Finished difference Result 4884 states and 16339 transitions. [2019-12-27 19:11:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:41,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:11:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:41,977 INFO L225 Difference]: With dead ends: 4884 [2019-12-27 19:11:41,977 INFO L226 Difference]: Without dead ends: 4875 [2019-12-27 19:11:41,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-12-27 19:11:42,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 2192. [2019-12-27 19:11:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-27 19:11:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 8446 transitions. [2019-12-27 19:11:42,059 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 8446 transitions. Word has length 19 [2019-12-27 19:11:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:42,060 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 8446 transitions. [2019-12-27 19:11:42,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 8446 transitions. [2019-12-27 19:11:42,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:11:42,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:42,061 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:42,061 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:42,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1703042649, now seen corresponding path program 2 times [2019-12-27 19:11:42,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:42,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515007936] [2019-12-27 19:11:42,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:11:42,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515007936] [2019-12-27 19:11:42,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:42,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:42,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1592719734] [2019-12-27 19:11:42,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:42,115 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:42,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:11:42,118 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:42,119 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:42,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:42,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:42,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:42,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:42,120 INFO L87 Difference]: Start difference. First operand 2192 states and 8446 transitions. Second operand 7 states. [2019-12-27 19:11:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:42,380 INFO L93 Difference]: Finished difference Result 4737 states and 15791 transitions. [2019-12-27 19:11:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:42,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:11:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:42,391 INFO L225 Difference]: With dead ends: 4737 [2019-12-27 19:11:42,391 INFO L226 Difference]: Without dead ends: 4728 [2019-12-27 19:11:42,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2019-12-27 19:11:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 2133. [2019-12-27 19:11:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 19:11:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 8224 transitions. [2019-12-27 19:11:42,468 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 8224 transitions. Word has length 19 [2019-12-27 19:11:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:42,468 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 8224 transitions. [2019-12-27 19:11:42,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:11:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 8224 transitions. [2019-12-27 19:11:42,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:42,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:42,470 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:42,470 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:42,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:42,471 INFO L82 PathProgramCache]: Analyzing trace with hash 269937843, now seen corresponding path program 1 times [2019-12-27 19:11:42,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:42,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669315327] [2019-12-27 19:11:42,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:11:42,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669315327] [2019-12-27 19:11:42,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938198132] [2019-12-27 19:11:42,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:42,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:42,625 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:11:42,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:42,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:42,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38256577] [2019-12-27 19:11:42,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:42,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:42,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 19:11:42,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:42,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:11:42,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:11:42,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:42,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:11:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:11:42,922 INFO L87 Difference]: Start difference. First operand 2133 states and 8224 transitions. Second operand 16 states. [2019-12-27 19:11:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:45,069 INFO L93 Difference]: Finished difference Result 6643 states and 19902 transitions. [2019-12-27 19:11:45,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:11:45,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 19:11:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:45,083 INFO L225 Difference]: With dead ends: 6643 [2019-12-27 19:11:45,084 INFO L226 Difference]: Without dead ends: 6636 [2019-12-27 19:11:45,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=4676, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 19:11:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6636 states. [2019-12-27 19:11:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6636 to 2101. [2019-12-27 19:11:45,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-12-27 19:11:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 8089 transitions. [2019-12-27 19:11:45,175 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 8089 transitions. Word has length 21 [2019-12-27 19:11:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:45,175 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 8089 transitions. [2019-12-27 19:11:45,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:11:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 8089 transitions. [2019-12-27 19:11:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:45,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:45,177 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:45,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:45,382 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 275473203, now seen corresponding path program 2 times [2019-12-27 19:11:45,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:45,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171155640] [2019-12-27 19:11:45,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:45,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:11:45,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171155640] [2019-12-27 19:11:45,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870704897] [2019-12-27 19:11:45,442 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:45,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:11:45,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:11:45,513 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:45,514 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:11:45,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:45,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:45,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205379851] [2019-12-27 19:11:45,611 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:45,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:45,618 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:11:45,618 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:45,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:11:45,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:11:45,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:45,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:11:45,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:11:45,695 INFO L87 Difference]: Start difference. First operand 2101 states and 8089 transitions. Second operand 12 states. [2019-12-27 19:11:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:46,929 INFO L93 Difference]: Finished difference Result 6356 states and 19271 transitions. [2019-12-27 19:11:46,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:11:46,930 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 19:11:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:46,939 INFO L225 Difference]: With dead ends: 6356 [2019-12-27 19:11:46,939 INFO L226 Difference]: Without dead ends: 6347 [2019-12-27 19:11:46,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=628, Invalid=2564, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:11:46,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6347 states. [2019-12-27 19:11:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6347 to 2071. [2019-12-27 19:11:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2019-12-27 19:11:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 7960 transitions. [2019-12-27 19:11:47,018 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 7960 transitions. Word has length 21 [2019-12-27 19:11:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:47,019 INFO L462 AbstractCegarLoop]: Abstraction has 2071 states and 7960 transitions. [2019-12-27 19:11:47,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:11:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 7960 transitions. [2019-12-27 19:11:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:47,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:47,022 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:47,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:47,226 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:47,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1870977495, now seen corresponding path program 3 times [2019-12-27 19:11:47,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:47,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340680464] [2019-12-27 19:11:47,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:47,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340680464] [2019-12-27 19:11:47,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524266314] [2019-12-27 19:11:47,326 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:47,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:11:47,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:11:47,405 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:47,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:47,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:47,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:47,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [756354496] [2019-12-27 19:11:47,505 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:47,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:47,513 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:11:47,513 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:47,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:11:47,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:11:47,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:47,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:11:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:11:47,614 INFO L87 Difference]: Start difference. First operand 2071 states and 7960 transitions. Second operand 15 states. [2019-12-27 19:11:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:49,520 INFO L93 Difference]: Finished difference Result 6519 states and 19507 transitions. [2019-12-27 19:11:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:11:49,520 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-27 19:11:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:49,529 INFO L225 Difference]: With dead ends: 6519 [2019-12-27 19:11:49,529 INFO L226 Difference]: Without dead ends: 6512 [2019-12-27 19:11:49,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1135, Invalid=4565, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:11:49,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6512 states. [2019-12-27 19:11:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6512 to 1997. [2019-12-27 19:11:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-12-27 19:11:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 7687 transitions. [2019-12-27 19:11:49,608 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 7687 transitions. Word has length 21 [2019-12-27 19:11:49,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:49,608 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 7687 transitions. [2019-12-27 19:11:49,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:11:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 7687 transitions. [2019-12-27 19:11:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:49,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:49,611 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:49,814 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:49,815 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:49,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1852496535, now seen corresponding path program 4 times [2019-12-27 19:11:49,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:49,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211534430] [2019-12-27 19:11:49,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:49,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:49,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211534430] [2019-12-27 19:11:49,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431145575] [2019-12-27 19:11:49,875 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:49,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:11:49,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:11:49,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:11:49,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:50,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:50,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:11:50,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1109816335] [2019-12-27 19:11:50,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:50,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:50,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 19:11:50,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:50,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:50,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:11:50,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:50,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:11:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:11:50,088 INFO L87 Difference]: Start difference. First operand 1997 states and 7687 transitions. Second operand 11 states. [2019-12-27 19:11:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:51,468 INFO L93 Difference]: Finished difference Result 6273 states and 19028 transitions. [2019-12-27 19:11:51,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:11:51,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 19:11:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:51,486 INFO L225 Difference]: With dead ends: 6273 [2019-12-27 19:11:51,486 INFO L226 Difference]: Without dead ends: 6264 [2019-12-27 19:11:51,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=594, Invalid=2486, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:11:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6264 states. [2019-12-27 19:11:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6264 to 1967. [2019-12-27 19:11:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1967 states. [2019-12-27 19:11:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 7558 transitions. [2019-12-27 19:11:51,538 INFO L78 Accepts]: Start accepts. Automaton has 1967 states and 7558 transitions. Word has length 21 [2019-12-27 19:11:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:51,539 INFO L462 AbstractCegarLoop]: Abstraction has 1967 states and 7558 transitions. [2019-12-27 19:11:51,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:11:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1967 states and 7558 transitions. [2019-12-27 19:11:51,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:51,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:51,540 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:51,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:51,744 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:51,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:51,745 INFO L82 PathProgramCache]: Analyzing trace with hash -748339188, now seen corresponding path program 1 times [2019-12-27 19:11:51,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:51,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362296105] [2019-12-27 19:11:51,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:11:51,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362296105] [2019-12-27 19:11:51,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:51,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:51,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1501937141] [2019-12-27 19:11:51,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:51,787 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:51,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:51,790 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:51,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:51,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:51,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:51,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:51,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:51,793 INFO L87 Difference]: Start difference. First operand 1967 states and 7558 transitions. Second operand 5 states. [2019-12-27 19:11:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:51,902 INFO L93 Difference]: Finished difference Result 3010 states and 10835 transitions. [2019-12-27 19:11:51,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:51,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 19:11:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:51,910 INFO L225 Difference]: With dead ends: 3010 [2019-12-27 19:11:51,910 INFO L226 Difference]: Without dead ends: 2994 [2019-12-27 19:11:51,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-12-27 19:11:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2174. [2019-12-27 19:11:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2019-12-27 19:11:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 8201 transitions. [2019-12-27 19:11:51,967 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 8201 transitions. Word has length 21 [2019-12-27 19:11:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:51,967 INFO L462 AbstractCegarLoop]: Abstraction has 2174 states and 8201 transitions. [2019-12-27 19:11:51,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 8201 transitions. [2019-12-27 19:11:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:51,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:51,969 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:51,969 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash -228501443, now seen corresponding path program 5 times [2019-12-27 19:11:51,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:51,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656002994] [2019-12-27 19:11:51,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:11:52,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656002994] [2019-12-27 19:11:52,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:52,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:52,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [715644615] [2019-12-27 19:11:52,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:52,041 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:52,045 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:52,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:52,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:52,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:52,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:52,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:52,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:11:52,047 INFO L87 Difference]: Start difference. First operand 2174 states and 8201 transitions. Second operand 9 states. [2019-12-27 19:11:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:52,835 INFO L93 Difference]: Finished difference Result 6140 states and 19238 transitions. [2019-12-27 19:11:52,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:11:52,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:11:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:52,844 INFO L225 Difference]: With dead ends: 6140 [2019-12-27 19:11:52,844 INFO L226 Difference]: Without dead ends: 6133 [2019-12-27 19:11:52,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:11:52,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6133 states. [2019-12-27 19:11:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6133 to 2090. [2019-12-27 19:11:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2019-12-27 19:11:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7871 transitions. [2019-12-27 19:11:52,897 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7871 transitions. Word has length 21 [2019-12-27 19:11:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:52,897 INFO L462 AbstractCegarLoop]: Abstraction has 2090 states and 7871 transitions. [2019-12-27 19:11:52,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7871 transitions. [2019-12-27 19:11:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:11:52,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:52,899 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:52,899 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:52,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash -241447043, now seen corresponding path program 6 times [2019-12-27 19:11:52,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:52,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173197581] [2019-12-27 19:11:52,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:11:52,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173197581] [2019-12-27 19:11:52,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:52,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:11:52,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [219825050] [2019-12-27 19:11:52,974 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:52,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:52,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:11:52,981 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:52,981 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:52,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:52,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:52,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:11:52,982 INFO L87 Difference]: Start difference. First operand 2090 states and 7871 transitions. Second operand 9 states. [2019-12-27 19:11:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:53,644 INFO L93 Difference]: Finished difference Result 6012 states and 18787 transitions. [2019-12-27 19:11:53,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:11:53,645 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:11:53,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:53,656 INFO L225 Difference]: With dead ends: 6012 [2019-12-27 19:11:53,657 INFO L226 Difference]: Without dead ends: 6002 [2019-12-27 19:11:53,657 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 19:11:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6002 states. [2019-12-27 19:11:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6002 to 1965. [2019-12-27 19:11:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-27 19:11:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 7429 transitions. [2019-12-27 19:11:53,729 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 7429 transitions. Word has length 21 [2019-12-27 19:11:53,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:53,729 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 7429 transitions. [2019-12-27 19:11:53,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 7429 transitions. [2019-12-27 19:11:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 19:11:53,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:53,732 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:53,733 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-27 19:11:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1727522141, now seen corresponding path program 1 times [2019-12-27 19:11:53,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:53,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567708926] [2019-12-27 19:11:53,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:11:53,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:11:53,778 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:11:53,778 WARN L364 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:11:53,779 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2019-12-27 19:11:53,793 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,793 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,794 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,795 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,795 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,795 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,795 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,795 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,795 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,797 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,797 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,797 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,798 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,798 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,799 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,799 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,799 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,799 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,799 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,799 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,799 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,800 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,800 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,800 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,800 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,800 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,800 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,801 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,802 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,802 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,802 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,802 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,803 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,803 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,803 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,803 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,803 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,804 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,804 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,805 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,805 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,805 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,805 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,805 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,806 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,806 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,806 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,807 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,807 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,807 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,807 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,807 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,807 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,807 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,808 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,808 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,808 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,808 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,808 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,808 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,809 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,809 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,809 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,810 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,812 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,813 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,813 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,814 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,814 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,814 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,815 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,816 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,817 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,817 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,817 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,817 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,817 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,818 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,818 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,819 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,819 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,819 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,819 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,820 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,821 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,822 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,822 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,822 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,822 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,822 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,823 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,823 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,823 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,824 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,824 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,824 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,825 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,825 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,825 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,825 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,825 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,826 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:11:53,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-12-27 19:11:53,827 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:11:53,827 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:11:53,827 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:11:53,827 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:11:53,827 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:11:53,827 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:11:53,828 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:11:53,828 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:11:53,832 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 117 transitions [2019-12-27 19:11:53,832 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 19:11:53,853 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 19:11:53,853 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:11:53,855 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 19:11:53,863 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 133 places, 117 transitions [2019-12-27 19:11:53,884 INFO L132 PetriNetUnfolder]: 7/147 cut-off events. [2019-12-27 19:11:53,885 INFO L133 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2019-12-27 19:11:53,887 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 147 events. 7/147 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 222 event pairs. 0/133 useless extension candidates. Maximal degree in co-relation 174. Up to 12 conditions per place. [2019-12-27 19:11:53,894 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2264 [2019-12-27 19:11:53,894 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:11:55,432 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 19:11:55,658 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2604 [2019-12-27 19:11:55,658 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 19:11:55,658 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 50 places, 39 transitions [2019-12-27 19:11:55,924 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6191 states. [2019-12-27 19:11:55,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6191 states. [2019-12-27 19:11:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:11:55,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:55,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:11:55,924 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:55,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash 963853, now seen corresponding path program 1 times [2019-12-27 19:11:55,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:55,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726961834] [2019-12-27 19:11:55,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:55,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726961834] [2019-12-27 19:11:55,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:55,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:11:55,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378616280] [2019-12-27 19:11:55,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:55,963 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:55,963 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:11:55,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:55,963 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:55,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:11:55,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:55,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:11:55,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:55,964 INFO L87 Difference]: Start difference. First operand 6191 states. Second operand 3 states. [2019-12-27 19:11:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:56,045 INFO L93 Difference]: Finished difference Result 5844 states and 26316 transitions. [2019-12-27 19:11:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:11:56,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:11:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:56,065 INFO L225 Difference]: With dead ends: 5844 [2019-12-27 19:11:56,065 INFO L226 Difference]: Without dead ends: 5479 [2019-12-27 19:11:56,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:11:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-27 19:11:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 5299. [2019-12-27 19:11:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-27 19:11:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 24031 transitions. [2019-12-27 19:11:56,217 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 24031 transitions. Word has length 3 [2019-12-27 19:11:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:56,218 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 24031 transitions. [2019-12-27 19:11:56,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:11:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 24031 transitions. [2019-12-27 19:11:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:11:56,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:56,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:56,218 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:56,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash 91439009, now seen corresponding path program 1 times [2019-12-27 19:11:56,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:56,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224140507] [2019-12-27 19:11:56,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:56,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224140507] [2019-12-27 19:11:56,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:56,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:56,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972172186] [2019-12-27 19:11:56,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:56,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:56,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:11:56,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:56,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:56,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:56,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:56,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:56,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:56,268 INFO L87 Difference]: Start difference. First operand 5299 states and 24031 transitions. Second operand 5 states. [2019-12-27 19:11:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:56,408 INFO L93 Difference]: Finished difference Result 9358 states and 39616 transitions. [2019-12-27 19:11:56,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:56,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:11:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:56,438 INFO L225 Difference]: With dead ends: 9358 [2019-12-27 19:11:56,438 INFO L226 Difference]: Without dead ends: 9355 [2019-12-27 19:11:56,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9355 states. [2019-12-27 19:11:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9355 to 6120. [2019-12-27 19:11:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6120 states. [2019-12-27 19:11:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6120 states to 6120 states and 28016 transitions. [2019-12-27 19:11:57,249 INFO L78 Accepts]: Start accepts. Automaton has 6120 states and 28016 transitions. Word has length 9 [2019-12-27 19:11:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:57,249 INFO L462 AbstractCegarLoop]: Abstraction has 6120 states and 28016 transitions. [2019-12-27 19:11:57,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 6120 states and 28016 transitions. [2019-12-27 19:11:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:11:57,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:57,250 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:57,250 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:57,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:57,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1001063187, now seen corresponding path program 1 times [2019-12-27 19:11:57,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:57,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559402429] [2019-12-27 19:11:57,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:57,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559402429] [2019-12-27 19:11:57,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:57,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:11:57,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716064844] [2019-12-27 19:11:57,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:57,288 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:57,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:11:57,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:57,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:57,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:11:57,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:57,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:11:57,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:11:57,290 INFO L87 Difference]: Start difference. First operand 6120 states and 28016 transitions. Second operand 5 states. [2019-12-27 19:11:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:57,454 INFO L93 Difference]: Finished difference Result 10720 states and 46025 transitions. [2019-12-27 19:11:57,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:11:57,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:11:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:57,486 INFO L225 Difference]: With dead ends: 10720 [2019-12-27 19:11:57,486 INFO L226 Difference]: Without dead ends: 10716 [2019-12-27 19:11:57,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10716 states. [2019-12-27 19:11:57,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10716 to 7145. [2019-12-27 19:11:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-27 19:11:57,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 33093 transitions. [2019-12-27 19:11:57,769 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 33093 transitions. Word has length 13 [2019-12-27 19:11:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:57,770 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 33093 transitions. [2019-12-27 19:11:57,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:11:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 33093 transitions. [2019-12-27 19:11:57,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:57,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:57,771 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:57,771 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:57,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:57,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1798371701, now seen corresponding path program 1 times [2019-12-27 19:11:57,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:57,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454529064] [2019-12-27 19:11:57,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:57,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454529064] [2019-12-27 19:11:57,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437062364] [2019-12-27 19:11:57,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:57,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:11:57,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:11:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:11:57,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:11:57,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:11:57,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309790944] [2019-12-27 19:11:57,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:57,964 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:57,967 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:11:57,967 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:57,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:11:57,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:11:57,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:57,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:11:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:11:57,999 INFO L87 Difference]: Start difference. First operand 7145 states and 33093 transitions. Second operand 9 states. [2019-12-27 19:11:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:58,644 INFO L93 Difference]: Finished difference Result 17481 states and 68797 transitions. [2019-12-27 19:11:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:11:58,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-27 19:11:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:58,708 INFO L225 Difference]: With dead ends: 17481 [2019-12-27 19:11:58,709 INFO L226 Difference]: Without dead ends: 17476 [2019-12-27 19:11:58,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:11:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17476 states. [2019-12-27 19:11:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17476 to 7067. [2019-12-27 19:11:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7067 states. [2019-12-27 19:11:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7067 states to 7067 states and 32681 transitions. [2019-12-27 19:11:59,184 INFO L78 Accepts]: Start accepts. Automaton has 7067 states and 32681 transitions. Word has length 15 [2019-12-27 19:11:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:11:59,185 INFO L462 AbstractCegarLoop]: Abstraction has 7067 states and 32681 transitions. [2019-12-27 19:11:59,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:11:59,185 INFO L276 IsEmpty]: Start isEmpty. Operand 7067 states and 32681 transitions. [2019-12-27 19:11:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:11:59,185 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:11:59,185 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:11:59,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:11:59,389 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:11:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:11:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash -50954293, now seen corresponding path program 2 times [2019-12-27 19:11:59,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:11:59,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856288186] [2019-12-27 19:11:59,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:11:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:11:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:11:59,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856288186] [2019-12-27 19:11:59,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:11:59,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:11:59,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [437044136] [2019-12-27 19:11:59,444 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:11:59,446 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:11:59,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:11:59,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:11:59,448 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:11:59,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:11:59,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:11:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:11:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:11:59,449 INFO L87 Difference]: Start difference. First operand 7067 states and 32681 transitions. Second operand 7 states. [2019-12-27 19:11:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:11:59,796 INFO L93 Difference]: Finished difference Result 16584 states and 66357 transitions. [2019-12-27 19:11:59,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:11:59,796 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:11:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:11:59,832 INFO L225 Difference]: With dead ends: 16584 [2019-12-27 19:11:59,832 INFO L226 Difference]: Without dead ends: 16579 [2019-12-27 19:11:59,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:11:59,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16579 states. [2019-12-27 19:12:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16579 to 6836. [2019-12-27 19:12:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6836 states. [2019-12-27 19:12:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 31606 transitions. [2019-12-27 19:12:00,026 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 31606 transitions. Word has length 15 [2019-12-27 19:12:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:00,026 INFO L462 AbstractCegarLoop]: Abstraction has 6836 states and 31606 transitions. [2019-12-27 19:12:00,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 31606 transitions. [2019-12-27 19:12:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:12:00,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:00,027 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:00,027 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:00,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:00,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2086390321, now seen corresponding path program 1 times [2019-12-27 19:12:00,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:00,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375956617] [2019-12-27 19:12:00,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:00,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375956617] [2019-12-27 19:12:00,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:00,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:12:00,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358849914] [2019-12-27 19:12:00,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:00,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:00,075 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:12:00,075 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:00,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:00,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:12:00,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:00,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:12:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:12:00,076 INFO L87 Difference]: Start difference. First operand 6836 states and 31606 transitions. Second operand 5 states. [2019-12-27 19:12:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:00,332 INFO L93 Difference]: Finished difference Result 11876 states and 51707 transitions. [2019-12-27 19:12:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:12:00,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:12:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:00,358 INFO L225 Difference]: With dead ends: 11876 [2019-12-27 19:12:00,358 INFO L226 Difference]: Without dead ends: 11868 [2019-12-27 19:12:00,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11868 states. [2019-12-27 19:12:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11868 to 8095. [2019-12-27 19:12:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-27 19:12:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 37697 transitions. [2019-12-27 19:12:00,530 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 37697 transitions. Word has length 17 [2019-12-27 19:12:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:00,530 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 37697 transitions. [2019-12-27 19:12:00,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:12:00,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 37697 transitions. [2019-12-27 19:12:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:12:00,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:00,532 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:00,532 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:00,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:00,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2036081631, now seen corresponding path program 1 times [2019-12-27 19:12:00,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:00,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204742159] [2019-12-27 19:12:00,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:12:00,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204742159] [2019-12-27 19:12:00,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65657377] [2019-12-27 19:12:00,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:00,672 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:12:00,673 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:12:00,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:00,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:12:00,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438231441] [2019-12-27 19:12:00,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:00,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:00,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 19:12:00,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:00,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:12:00,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:12:00,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:00,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:12:00,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:00,810 INFO L87 Difference]: Start difference. First operand 8095 states and 37697 transitions. Second operand 10 states. [2019-12-27 19:12:01,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:01,384 INFO L93 Difference]: Finished difference Result 20047 states and 79810 transitions. [2019-12-27 19:12:01,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:12:01,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-12-27 19:12:01,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:01,428 INFO L225 Difference]: With dead ends: 20047 [2019-12-27 19:12:01,429 INFO L226 Difference]: Without dead ends: 20038 [2019-12-27 19:12:01,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:12:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20038 states. [2019-12-27 19:12:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20038 to 8204. [2019-12-27 19:12:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-12-27 19:12:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 38127 transitions. [2019-12-27 19:12:01,839 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 38127 transitions. Word has length 19 [2019-12-27 19:12:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:01,839 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 38127 transitions. [2019-12-27 19:12:01,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:12:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 38127 transitions. [2019-12-27 19:12:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:12:01,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:01,840 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:02,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:02,041 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:02,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:02,042 INFO L82 PathProgramCache]: Analyzing trace with hash -728631447, now seen corresponding path program 2 times [2019-12-27 19:12:02,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:02,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078930494] [2019-12-27 19:12:02,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:02,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078930494] [2019-12-27 19:12:02,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:02,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:02,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1132664485] [2019-12-27 19:12:02,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:02,095 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:02,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:12:02,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:02,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:02,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:02,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:02,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:02,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:02,099 INFO L87 Difference]: Start difference. First operand 8204 states and 38127 transitions. Second operand 7 states. [2019-12-27 19:12:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:02,443 INFO L93 Difference]: Finished difference Result 18912 states and 76848 transitions. [2019-12-27 19:12:02,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:02,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:12:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:02,485 INFO L225 Difference]: With dead ends: 18912 [2019-12-27 19:12:02,485 INFO L226 Difference]: Without dead ends: 18903 [2019-12-27 19:12:02,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:02,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18903 states. [2019-12-27 19:12:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18903 to 7911. [2019-12-27 19:12:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7911 states. [2019-12-27 19:12:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7911 states to 7911 states and 36783 transitions. [2019-12-27 19:12:02,710 INFO L78 Accepts]: Start accepts. Automaton has 7911 states and 36783 transitions. Word has length 19 [2019-12-27 19:12:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:02,710 INFO L462 AbstractCegarLoop]: Abstraction has 7911 states and 36783 transitions. [2019-12-27 19:12:02,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7911 states and 36783 transitions. [2019-12-27 19:12:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:12:02,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:02,712 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:02,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:02,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash -728623232, now seen corresponding path program 1 times [2019-12-27 19:12:02,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:02,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53913015] [2019-12-27 19:12:02,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:02,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53913015] [2019-12-27 19:12:02,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:02,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:02,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [770087945] [2019-12-27 19:12:02,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:02,766 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:02,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:12:02,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:02,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:02,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:02,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:02,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:02,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:02,770 INFO L87 Difference]: Start difference. First operand 7911 states and 36783 transitions. Second operand 7 states. [2019-12-27 19:12:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:03,112 INFO L93 Difference]: Finished difference Result 18895 states and 76839 transitions. [2019-12-27 19:12:03,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:03,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:12:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:03,161 INFO L225 Difference]: With dead ends: 18895 [2019-12-27 19:12:03,161 INFO L226 Difference]: Without dead ends: 18886 [2019-12-27 19:12:03,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:03,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18886 states. [2019-12-27 19:12:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18886 to 8150. [2019-12-27 19:12:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8150 states. [2019-12-27 19:12:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8150 states to 8150 states and 37871 transitions. [2019-12-27 19:12:03,558 INFO L78 Accepts]: Start accepts. Automaton has 8150 states and 37871 transitions. Word has length 19 [2019-12-27 19:12:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:03,558 INFO L462 AbstractCegarLoop]: Abstraction has 8150 states and 37871 transitions. [2019-12-27 19:12:03,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 8150 states and 37871 transitions. [2019-12-27 19:12:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:12:03,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:03,559 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:03,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:03,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash -718028672, now seen corresponding path program 2 times [2019-12-27 19:12:03,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:03,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574878804] [2019-12-27 19:12:03,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:03,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574878804] [2019-12-27 19:12:03,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:03,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:03,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [483960937] [2019-12-27 19:12:03,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:03,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:03,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 19:12:03,616 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:03,673 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:12:03,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:12:03,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:03,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:12:03,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 19:12:03,675 INFO L87 Difference]: Start difference. First operand 8150 states and 37871 transitions. Second operand 11 states. [2019-12-27 19:12:04,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:04,443 INFO L93 Difference]: Finished difference Result 21439 states and 84534 transitions. [2019-12-27 19:12:04,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:12:04,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-12-27 19:12:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:04,488 INFO L225 Difference]: With dead ends: 21439 [2019-12-27 19:12:04,488 INFO L226 Difference]: Without dead ends: 21426 [2019-12-27 19:12:04,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=272, Invalid=658, Unknown=0, NotChecked=0, Total=930 [2019-12-27 19:12:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21426 states. [2019-12-27 19:12:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21426 to 8107. [2019-12-27 19:12:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8107 states. [2019-12-27 19:12:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8107 states to 8107 states and 37697 transitions. [2019-12-27 19:12:04,748 INFO L78 Accepts]: Start accepts. Automaton has 8107 states and 37697 transitions. Word has length 19 [2019-12-27 19:12:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:04,748 INFO L462 AbstractCegarLoop]: Abstraction has 8107 states and 37697 transitions. [2019-12-27 19:12:04,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:12:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8107 states and 37697 transitions. [2019-12-27 19:12:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:12:04,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:04,750 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:04,750 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:04,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1830634066, now seen corresponding path program 1 times [2019-12-27 19:12:04,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:04,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151143823] [2019-12-27 19:12:04,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:12:04,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151143823] [2019-12-27 19:12:04,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124655290] [2019-12-27 19:12:04,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:05,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:05,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:05,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:12:05,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:05,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:05,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223411831] [2019-12-27 19:12:05,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:05,116 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:05,120 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:12:05,120 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:05,211 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:12:05,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:12:05,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:05,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:12:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:12:05,212 INFO L87 Difference]: Start difference. First operand 8107 states and 37697 transitions. Second operand 12 states. [2019-12-27 19:12:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:06,725 INFO L93 Difference]: Finished difference Result 28620 states and 106676 transitions. [2019-12-27 19:12:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:06,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-27 19:12:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:06,786 INFO L225 Difference]: With dead ends: 28620 [2019-12-27 19:12:06,786 INFO L226 Difference]: Without dead ends: 28613 [2019-12-27 19:12:06,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:12:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28613 states. [2019-12-27 19:12:07,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28613 to 8003. [2019-12-27 19:12:07,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8003 states. [2019-12-27 19:12:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8003 states to 8003 states and 37166 transitions. [2019-12-27 19:12:07,090 INFO L78 Accepts]: Start accepts. Automaton has 8003 states and 37166 transitions. Word has length 21 [2019-12-27 19:12:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:07,090 INFO L462 AbstractCegarLoop]: Abstraction has 8003 states and 37166 transitions. [2019-12-27 19:12:07,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:12:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 8003 states and 37166 transitions. [2019-12-27 19:12:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:12:07,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:07,091 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:07,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:07,292 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:07,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1820039506, now seen corresponding path program 2 times [2019-12-27 19:12:07,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:07,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705667372] [2019-12-27 19:12:07,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:12:07,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705667372] [2019-12-27 19:12:07,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379293687] [2019-12-27 19:12:07,366 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:07,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:12:07,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:07,449 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:07,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:12:07,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:07,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:07,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1722301362] [2019-12-27 19:12:07,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:07,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:07,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 19:12:07,658 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:07,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:12:07,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:12:07,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:12:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:12:07,778 INFO L87 Difference]: Start difference. First operand 8003 states and 37166 transitions. Second operand 16 states. [2019-12-27 19:12:09,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:09,848 INFO L93 Difference]: Finished difference Result 29191 states and 107449 transitions. [2019-12-27 19:12:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:09,848 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-12-27 19:12:09,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:09,909 INFO L225 Difference]: With dead ends: 29191 [2019-12-27 19:12:09,910 INFO L226 Difference]: Without dead ends: 29182 [2019-12-27 19:12:09,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1255, Invalid=4597, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 19:12:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29182 states. [2019-12-27 19:12:10,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29182 to 7893. [2019-12-27 19:12:10,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7893 states. [2019-12-27 19:12:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7893 states to 7893 states and 36616 transitions. [2019-12-27 19:12:10,211 INFO L78 Accepts]: Start accepts. Automaton has 7893 states and 36616 transitions. Word has length 21 [2019-12-27 19:12:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:10,211 INFO L462 AbstractCegarLoop]: Abstraction has 7893 states and 36616 transitions. [2019-12-27 19:12:10,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:12:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 7893 states and 36616 transitions. [2019-12-27 19:12:10,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:12:10,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:10,212 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:10,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:10,413 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:10,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:10,414 INFO L82 PathProgramCache]: Analyzing trace with hash -135145800, now seen corresponding path program 3 times [2019-12-27 19:12:10,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:10,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637205614] [2019-12-27 19:12:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:10,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637205614] [2019-12-27 19:12:10,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:10,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:10,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [366576455] [2019-12-27 19:12:10,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:10,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:10,483 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:12:10,484 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:10,484 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:10,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:10,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:10,484 INFO L87 Difference]: Start difference. First operand 7893 states and 36616 transitions. Second operand 9 states. [2019-12-27 19:12:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:11,362 INFO L93 Difference]: Finished difference Result 26136 states and 99362 transitions. [2019-12-27 19:12:11,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:11,362 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:12:11,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:11,421 INFO L225 Difference]: With dead ends: 26136 [2019-12-27 19:12:11,421 INFO L226 Difference]: Without dead ends: 26132 [2019-12-27 19:12:11,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:12:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26132 states. [2019-12-27 19:12:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26132 to 7683. [2019-12-27 19:12:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7683 states. [2019-12-27 19:12:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7683 states to 7683 states and 35650 transitions. [2019-12-27 19:12:11,702 INFO L78 Accepts]: Start accepts. Automaton has 7683 states and 35650 transitions. Word has length 21 [2019-12-27 19:12:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:11,702 INFO L462 AbstractCegarLoop]: Abstraction has 7683 states and 35650 transitions. [2019-12-27 19:12:11,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7683 states and 35650 transitions. [2019-12-27 19:12:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:12:11,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:11,703 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:11,703 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash -127259400, now seen corresponding path program 4 times [2019-12-27 19:12:11,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:11,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779601690] [2019-12-27 19:12:11,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:11,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 19:12:11,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779601690] [2019-12-27 19:12:11,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:11,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:11,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283369658] [2019-12-27 19:12:11,770 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:11,772 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:11,777 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:12:11,777 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:11,777 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:11,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:11,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:11,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:11,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:12:11,778 INFO L87 Difference]: Start difference. First operand 7683 states and 35650 transitions. Second operand 9 states. [2019-12-27 19:12:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:12,542 INFO L93 Difference]: Finished difference Result 25967 states and 98669 transitions. [2019-12-27 19:12:12,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:12:12,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:12:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:12,604 INFO L225 Difference]: With dead ends: 25967 [2019-12-27 19:12:12,604 INFO L226 Difference]: Without dead ends: 25961 [2019-12-27 19:12:12,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:12:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25961 states. [2019-12-27 19:12:12,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25961 to 7577. [2019-12-27 19:12:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7577 states. [2019-12-27 19:12:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 35112 transitions. [2019-12-27 19:12:13,831 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 35112 transitions. Word has length 21 [2019-12-27 19:12:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:13,832 INFO L462 AbstractCegarLoop]: Abstraction has 7577 states and 35112 transitions. [2019-12-27 19:12:13,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 35112 transitions. [2019-12-27 19:12:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:12:13,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:13,833 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:13,834 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:13,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:13,834 INFO L82 PathProgramCache]: Analyzing trace with hash 980776630, now seen corresponding path program 1 times [2019-12-27 19:12:13,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:13,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348513212] [2019-12-27 19:12:13,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:13,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348513212] [2019-12-27 19:12:13,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:13,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:12:13,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1197780653] [2019-12-27 19:12:13,867 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:13,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:13,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:12:13,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:13,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:13,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:12:13,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:12:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:12:13,872 INFO L87 Difference]: Start difference. First operand 7577 states and 35112 transitions. Second operand 5 states. [2019-12-27 19:12:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:14,025 INFO L93 Difference]: Finished difference Result 12960 states and 56912 transitions. [2019-12-27 19:12:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:12:14,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 19:12:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:14,061 INFO L225 Difference]: With dead ends: 12960 [2019-12-27 19:12:14,062 INFO L226 Difference]: Without dead ends: 12944 [2019-12-27 19:12:14,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12944 states. [2019-12-27 19:12:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12944 to 9056. [2019-12-27 19:12:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9056 states. [2019-12-27 19:12:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9056 states to 9056 states and 41951 transitions. [2019-12-27 19:12:14,264 INFO L78 Accepts]: Start accepts. Automaton has 9056 states and 41951 transitions. Word has length 21 [2019-12-27 19:12:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:14,264 INFO L462 AbstractCegarLoop]: Abstraction has 9056 states and 41951 transitions. [2019-12-27 19:12:14,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:12:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9056 states and 41951 transitions. [2019-12-27 19:12:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:12:14,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:14,265 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:14,266 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1464178168, now seen corresponding path program 5 times [2019-12-27 19:12:14,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:14,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307449586] [2019-12-27 19:12:14,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:14,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307449586] [2019-12-27 19:12:14,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:14,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:14,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2021465008] [2019-12-27 19:12:14,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:14,343 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:14,348 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 19:12:14,349 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:14,410 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:12:14,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:12:14,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:14,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:12:14,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:12:14,412 INFO L87 Difference]: Start difference. First operand 9056 states and 41951 transitions. Second operand 13 states. [2019-12-27 19:12:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:16,487 INFO L93 Difference]: Finished difference Result 33065 states and 123155 transitions. [2019-12-27 19:12:16,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 19:12:16,487 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-12-27 19:12:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:16,556 INFO L225 Difference]: With dead ends: 33065 [2019-12-27 19:12:16,556 INFO L226 Difference]: Without dead ends: 33052 [2019-12-27 19:12:16,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1047, Invalid=3783, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 19:12:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33052 states. [2019-12-27 19:12:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33052 to 8780. [2019-12-27 19:12:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8780 states. [2019-12-27 19:12:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 40645 transitions. [2019-12-27 19:12:17,085 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 40645 transitions. Word has length 21 [2019-12-27 19:12:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:17,085 INFO L462 AbstractCegarLoop]: Abstraction has 8780 states and 40645 transitions. [2019-12-27 19:12:17,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:12:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 40645 transitions. [2019-12-27 19:12:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:12:17,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:17,086 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:17,086 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:17,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1466886328, now seen corresponding path program 6 times [2019-12-27 19:12:17,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:17,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551362611] [2019-12-27 19:12:17,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:17,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551362611] [2019-12-27 19:12:17,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:17,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:17,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2005676248] [2019-12-27 19:12:17,164 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:17,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:17,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:12:17,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:17,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:12:17,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:12:17,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:12:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:12:17,309 INFO L87 Difference]: Start difference. First operand 8780 states and 40645 transitions. Second operand 17 states. [2019-12-27 19:12:20,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:20,231 INFO L93 Difference]: Finished difference Result 33893 states and 124131 transitions. [2019-12-27 19:12:20,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 19:12:20,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-12-27 19:12:20,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:20,302 INFO L225 Difference]: With dead ends: 33893 [2019-12-27 19:12:20,302 INFO L226 Difference]: Without dead ends: 33877 [2019-12-27 19:12:20,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3258 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1937, Invalid=6993, Unknown=0, NotChecked=0, Total=8930 [2019-12-27 19:12:20,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33877 states. [2019-12-27 19:12:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33877 to 8405. [2019-12-27 19:12:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8405 states. [2019-12-27 19:12:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8405 states to 8405 states and 38987 transitions. [2019-12-27 19:12:20,900 INFO L78 Accepts]: Start accepts. Automaton has 8405 states and 38987 transitions. Word has length 21 [2019-12-27 19:12:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:20,901 INFO L462 AbstractCegarLoop]: Abstraction has 8405 states and 38987 transitions. [2019-12-27 19:12:20,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:12:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 8405 states and 38987 transitions. [2019-12-27 19:12:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:20,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:20,903 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:20,903 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:20,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:20,903 INFO L82 PathProgramCache]: Analyzing trace with hash 792940754, now seen corresponding path program 1 times [2019-12-27 19:12:20,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:20,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890072695] [2019-12-27 19:12:20,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:20,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890072695] [2019-12-27 19:12:20,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251681094] [2019-12-27 19:12:20,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:21,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:12:21,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:21,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:21,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:12:21,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [6757727] [2019-12-27 19:12:21,125 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:21,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:21,136 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 19:12:21,136 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:21,224 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:21,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:12:21,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:12:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:12:21,226 INFO L87 Difference]: Start difference. First operand 8405 states and 38987 transitions. Second operand 11 states. [2019-12-27 19:12:21,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:21,804 INFO L93 Difference]: Finished difference Result 21073 states and 84547 transitions. [2019-12-27 19:12:21,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:12:21,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-27 19:12:21,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:21,848 INFO L225 Difference]: With dead ends: 21073 [2019-12-27 19:12:21,848 INFO L226 Difference]: Without dead ends: 21054 [2019-12-27 19:12:21,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:12:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21054 states. [2019-12-27 19:12:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21054 to 8674. [2019-12-27 19:12:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8674 states. [2019-12-27 19:12:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8674 states to 8674 states and 40123 transitions. [2019-12-27 19:12:22,092 INFO L78 Accepts]: Start accepts. Automaton has 8674 states and 40123 transitions. Word has length 23 [2019-12-27 19:12:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:22,092 INFO L462 AbstractCegarLoop]: Abstraction has 8674 states and 40123 transitions. [2019-12-27 19:12:22,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:12:22,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8674 states and 40123 transitions. [2019-12-27 19:12:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:22,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:22,095 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:22,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:22,301 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash 568712663, now seen corresponding path program 1 times [2019-12-27 19:12:22,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:22,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568298130] [2019-12-27 19:12:22,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:22,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568298130] [2019-12-27 19:12:22,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161393608] [2019-12-27 19:12:22,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:22,432 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:12:22,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:22,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:22,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:12:22,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2145835410] [2019-12-27 19:12:22,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:22,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:22,491 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 19:12:22,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:22,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:12:22,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:12:22,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:22,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:12:22,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:12:22,520 INFO L87 Difference]: Start difference. First operand 8674 states and 40123 transitions. Second operand 9 states. [2019-12-27 19:12:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:23,106 INFO L93 Difference]: Finished difference Result 22123 states and 88756 transitions. [2019-12-27 19:12:23,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:12:23,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-27 19:12:23,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:23,153 INFO L225 Difference]: With dead ends: 22123 [2019-12-27 19:12:23,154 INFO L226 Difference]: Without dead ends: 22101 [2019-12-27 19:12:23,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:12:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22101 states. [2019-12-27 19:12:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22101 to 8934. [2019-12-27 19:12:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8934 states. [2019-12-27 19:12:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8934 states to 8934 states and 41293 transitions. [2019-12-27 19:12:23,411 INFO L78 Accepts]: Start accepts. Automaton has 8934 states and 41293 transitions. Word has length 23 [2019-12-27 19:12:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:23,412 INFO L462 AbstractCegarLoop]: Abstraction has 8934 states and 41293 transitions. [2019-12-27 19:12:23,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:12:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 8934 states and 41293 transitions. [2019-12-27 19:12:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:23,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:23,414 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:23,619 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:23,619 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:23,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:23,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1942317765, now seen corresponding path program 1 times [2019-12-27 19:12:23,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:23,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520566792] [2019-12-27 19:12:23,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:23,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520566792] [2019-12-27 19:12:23,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:23,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:23,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2011576474] [2019-12-27 19:12:23,668 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:23,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:23,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 19:12:23,678 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:23,781 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:12:23,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:12:23,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:12:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 19:12:23,782 INFO L87 Difference]: Start difference. First operand 8934 states and 41293 transitions. Second operand 13 states. [2019-12-27 19:12:24,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:24,645 INFO L93 Difference]: Finished difference Result 23819 states and 94551 transitions. [2019-12-27 19:12:24,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:12:24,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-12-27 19:12:24,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:24,697 INFO L225 Difference]: With dead ends: 23819 [2019-12-27 19:12:24,697 INFO L226 Difference]: Without dead ends: 23790 [2019-12-27 19:12:24,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=742, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 19:12:24,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23790 states. [2019-12-27 19:12:24,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23790 to 9143. [2019-12-27 19:12:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9143 states. [2019-12-27 19:12:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9143 states to 9143 states and 42279 transitions. [2019-12-27 19:12:24,964 INFO L78 Accepts]: Start accepts. Automaton has 9143 states and 42279 transitions. Word has length 23 [2019-12-27 19:12:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:24,964 INFO L462 AbstractCegarLoop]: Abstraction has 9143 states and 42279 transitions. [2019-12-27 19:12:24,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:12:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 9143 states and 42279 transitions. [2019-12-27 19:12:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:24,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:24,967 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:24,967 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:24,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1928498089, now seen corresponding path program 2 times [2019-12-27 19:12:24,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:24,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106779574] [2019-12-27 19:12:24,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:25,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106779574] [2019-12-27 19:12:25,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:25,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:25,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [854455245] [2019-12-27 19:12:25,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:25,020 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:25,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:12:25,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:25,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:25,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:25,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:25,025 INFO L87 Difference]: Start difference. First operand 9143 states and 42279 transitions. Second operand 7 states. [2019-12-27 19:12:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:25,448 INFO L93 Difference]: Finished difference Result 21118 states and 87107 transitions. [2019-12-27 19:12:25,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:25,448 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:12:25,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:25,493 INFO L225 Difference]: With dead ends: 21118 [2019-12-27 19:12:25,493 INFO L226 Difference]: Without dead ends: 21099 [2019-12-27 19:12:25,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21099 states. [2019-12-27 19:12:25,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21099 to 9234. [2019-12-27 19:12:25,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 19:12:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 42669 transitions. [2019-12-27 19:12:25,743 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 42669 transitions. Word has length 23 [2019-12-27 19:12:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:25,743 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 42669 transitions. [2019-12-27 19:12:25,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 42669 transitions. [2019-12-27 19:12:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:25,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:25,746 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:25,746 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1928500910, now seen corresponding path program 2 times [2019-12-27 19:12:25,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:25,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070883440] [2019-12-27 19:12:25,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:25,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070883440] [2019-12-27 19:12:25,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:25,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:25,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205346827] [2019-12-27 19:12:25,799 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:25,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:25,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:12:25,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:25,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:25,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:25,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:25,808 INFO L87 Difference]: Start difference. First operand 9234 states and 42669 transitions. Second operand 7 states. [2019-12-27 19:12:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:26,113 INFO L93 Difference]: Finished difference Result 20904 states and 85935 transitions. [2019-12-27 19:12:26,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:26,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:12:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:26,157 INFO L225 Difference]: With dead ends: 20904 [2019-12-27 19:12:26,157 INFO L226 Difference]: Without dead ends: 20885 [2019-12-27 19:12:26,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20885 states. [2019-12-27 19:12:26,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20885 to 9243. [2019-12-27 19:12:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9243 states. [2019-12-27 19:12:26,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9243 states to 9243 states and 42683 transitions. [2019-12-27 19:12:26,406 INFO L78 Accepts]: Start accepts. Automaton has 9243 states and 42683 transitions. Word has length 23 [2019-12-27 19:12:26,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:26,406 INFO L462 AbstractCegarLoop]: Abstraction has 9243 states and 42683 transitions. [2019-12-27 19:12:26,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:26,406 INFO L276 IsEmpty]: Start isEmpty. Operand 9243 states and 42683 transitions. [2019-12-27 19:12:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:12:26,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:26,408 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:26,408 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1928509125, now seen corresponding path program 2 times [2019-12-27 19:12:26,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:26,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894192554] [2019-12-27 19:12:26,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:26,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894192554] [2019-12-27 19:12:26,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:26,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:12:26,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [885132811] [2019-12-27 19:12:26,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:26,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:26,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:12:26,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:26,481 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:26,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:12:26,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:26,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:12:26,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:26,482 INFO L87 Difference]: Start difference. First operand 9243 states and 42683 transitions. Second operand 7 states. [2019-12-27 19:12:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:26,948 INFO L93 Difference]: Finished difference Result 20784 states and 85269 transitions. [2019-12-27 19:12:26,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:12:26,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:12:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:26,994 INFO L225 Difference]: With dead ends: 20784 [2019-12-27 19:12:26,994 INFO L226 Difference]: Without dead ends: 20765 [2019-12-27 19:12:26,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:27,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20765 states. [2019-12-27 19:12:27,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20765 to 9286. [2019-12-27 19:12:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-27 19:12:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 42799 transitions. [2019-12-27 19:12:27,251 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 42799 transitions. Word has length 23 [2019-12-27 19:12:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:27,251 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 42799 transitions. [2019-12-27 19:12:27,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:12:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 42799 transitions. [2019-12-27 19:12:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:27,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:27,254 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:27,255 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1810061765, now seen corresponding path program 1 times [2019-12-27 19:12:27,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:27,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197840691] [2019-12-27 19:12:27,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:27,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197840691] [2019-12-27 19:12:27,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37938280] [2019-12-27 19:12:27,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:27,387 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:27,388 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:27,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:27,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:27,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1498022630] [2019-12-27 19:12:27,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:27,487 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:27,495 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:12:27,496 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:27,653 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 19:12:27,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:12:27,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:27,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:12:27,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-12-27 19:12:27,654 INFO L87 Difference]: Start difference. First operand 9286 states and 42799 transitions. Second operand 17 states. [2019-12-27 19:12:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:29,642 INFO L93 Difference]: Finished difference Result 33531 states and 124595 transitions. [2019-12-27 19:12:29,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:29,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2019-12-27 19:12:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:29,710 INFO L225 Difference]: With dead ends: 33531 [2019-12-27 19:12:29,710 INFO L226 Difference]: Without dead ends: 33513 [2019-12-27 19:12:29,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1297, Invalid=4709, Unknown=0, NotChecked=0, Total=6006 [2019-12-27 19:12:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33513 states. [2019-12-27 19:12:30,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33513 to 9208. [2019-12-27 19:12:30,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9208 states. [2019-12-27 19:12:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9208 states to 9208 states and 42351 transitions. [2019-12-27 19:12:30,065 INFO L78 Accepts]: Start accepts. Automaton has 9208 states and 42351 transitions. Word has length 25 [2019-12-27 19:12:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:30,065 INFO L462 AbstractCegarLoop]: Abstraction has 9208 states and 42351 transitions. [2019-12-27 19:12:30,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:12:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 9208 states and 42351 transitions. [2019-12-27 19:12:30,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:30,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:30,068 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:30,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:30,269 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1820667361, now seen corresponding path program 1 times [2019-12-27 19:12:30,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:30,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826005035] [2019-12-27 19:12:30,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:30,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826005035] [2019-12-27 19:12:30,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672158935] [2019-12-27 19:12:30,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:30,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:30,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:30,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:30,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:30,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640305910] [2019-12-27 19:12:30,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:30,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:30,584 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 19:12:30,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:30,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 19:12:30,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:12:30,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:30,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:12:30,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:12:30,797 INFO L87 Difference]: Start difference. First operand 9208 states and 42351 transitions. Second operand 19 states. [2019-12-27 19:12:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:32,862 INFO L93 Difference]: Finished difference Result 33056 states and 122674 transitions. [2019-12-27 19:12:32,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:32,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 19:12:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:32,938 INFO L225 Difference]: With dead ends: 33056 [2019-12-27 19:12:32,938 INFO L226 Difference]: Without dead ends: 33038 [2019-12-27 19:12:32,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1403, Invalid=4917, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 19:12:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33038 states. [2019-12-27 19:12:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33038 to 9154. [2019-12-27 19:12:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9154 states. [2019-12-27 19:12:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9154 states to 9154 states and 42049 transitions. [2019-12-27 19:12:33,296 INFO L78 Accepts]: Start accepts. Automaton has 9154 states and 42049 transitions. Word has length 25 [2019-12-27 19:12:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:33,296 INFO L462 AbstractCegarLoop]: Abstraction has 9154 states and 42049 transitions. [2019-12-27 19:12:33,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:12:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 9154 states and 42049 transitions. [2019-12-27 19:12:33,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:33,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:33,299 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:33,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:33,500 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1806847685, now seen corresponding path program 2 times [2019-12-27 19:12:33,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:33,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170644500] [2019-12-27 19:12:33,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:33,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170644500] [2019-12-27 19:12:33,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950546029] [2019-12-27 19:12:33,569 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:33,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:12:33,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:33,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:33,651 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:33,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:33,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:33,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [78864634] [2019-12-27 19:12:33,764 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:33,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:33,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:12:33,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:33,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:33,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:12:33,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:12:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:12:33,918 INFO L87 Difference]: Start difference. First operand 9154 states and 42049 transitions. Second operand 13 states. [2019-12-27 19:12:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:35,494 INFO L93 Difference]: Finished difference Result 31510 states and 118366 transitions. [2019-12-27 19:12:35,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:35,495 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 19:12:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:35,563 INFO L225 Difference]: With dead ends: 31510 [2019-12-27 19:12:35,563 INFO L226 Difference]: Without dead ends: 31491 [2019-12-27 19:12:35,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=717, Invalid=2589, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 19:12:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31491 states. [2019-12-27 19:12:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31491 to 9151. [2019-12-27 19:12:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-27 19:12:36,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 41998 transitions. [2019-12-27 19:12:36,070 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 41998 transitions. Word has length 25 [2019-12-27 19:12:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:36,070 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 41998 transitions. [2019-12-27 19:12:36,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:12:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 41998 transitions. [2019-12-27 19:12:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:36,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:36,073 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:36,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:36,274 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1806858721, now seen corresponding path program 2 times [2019-12-27 19:12:36,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:36,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292312232] [2019-12-27 19:12:36,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:36,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292312232] [2019-12-27 19:12:36,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104980882] [2019-12-27 19:12:36,337 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:36,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:12:36,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:36,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:36,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-27 19:12:36,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:36,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:36,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1927093048] [2019-12-27 19:12:36,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:36,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:36,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:12:36,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:36,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:36,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 19:12:36,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:36,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 19:12:36,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:12:36,650 INFO L87 Difference]: Start difference. First operand 9151 states and 41998 transitions. Second operand 13 states. [2019-12-27 19:12:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:38,012 INFO L93 Difference]: Finished difference Result 31144 states and 116954 transitions. [2019-12-27 19:12:38,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:38,013 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-27 19:12:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:38,077 INFO L225 Difference]: With dead ends: 31144 [2019-12-27 19:12:38,077 INFO L226 Difference]: Without dead ends: 31125 [2019-12-27 19:12:38,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=717, Invalid=2589, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 19:12:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31125 states. [2019-12-27 19:12:38,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31125 to 9044. [2019-12-27 19:12:38,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-12-27 19:12:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 41462 transitions. [2019-12-27 19:12:38,412 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 41462 transitions. Word has length 25 [2019-12-27 19:12:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:38,412 INFO L462 AbstractCegarLoop]: Abstraction has 9044 states and 41462 transitions. [2019-12-27 19:12:38,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 19:12:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 41462 transitions. [2019-12-27 19:12:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:38,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:38,415 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:38,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:38,616 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:38,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:38,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1077942095, now seen corresponding path program 3 times [2019-12-27 19:12:38,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:38,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772772132] [2019-12-27 19:12:38,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:38,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772772132] [2019-12-27 19:12:38,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687690162] [2019-12-27 19:12:38,690 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:38,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:12:38,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:38,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:38,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:38,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:38,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:38,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1688587818] [2019-12-27 19:12:38,863 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:38,866 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:38,874 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:12:38,875 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:38,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:38,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:12:38,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:38,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:12:38,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:12:38,972 INFO L87 Difference]: Start difference. First operand 9044 states and 41462 transitions. Second operand 15 states. [2019-12-27 19:12:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:41,158 INFO L93 Difference]: Finished difference Result 32342 states and 119750 transitions. [2019-12-27 19:12:41,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:41,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:12:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:41,223 INFO L225 Difference]: With dead ends: 32342 [2019-12-27 19:12:41,224 INFO L226 Difference]: Without dead ends: 32324 [2019-12-27 19:12:41,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1214, Invalid=4486, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:12:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32324 states. [2019-12-27 19:12:41,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32324 to 8878. [2019-12-27 19:12:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-12-27 19:12:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 40685 transitions. [2019-12-27 19:12:41,558 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 40685 transitions. Word has length 25 [2019-12-27 19:12:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:41,559 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 40685 transitions. [2019-12-27 19:12:41,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:12:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 40685 transitions. [2019-12-27 19:12:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:41,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:41,562 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:41,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:41,763 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1085836710, now seen corresponding path program 1 times [2019-12-27 19:12:41,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:41,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648183052] [2019-12-27 19:12:41,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:41,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648183052] [2019-12-27 19:12:41,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83040913] [2019-12-27 19:12:41,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:41,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:41,908 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:41,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:41,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:41,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691137417] [2019-12-27 19:12:41,997 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:42,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:42,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:12:42,008 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:42,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:12:42,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:12:42,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:42,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:12:42,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:12:42,098 INFO L87 Difference]: Start difference. First operand 8878 states and 40685 transitions. Second operand 15 states. [2019-12-27 19:12:44,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:44,215 INFO L93 Difference]: Finished difference Result 32735 states and 121625 transitions. [2019-12-27 19:12:44,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:12:44,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:12:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:44,283 INFO L225 Difference]: With dead ends: 32735 [2019-12-27 19:12:44,283 INFO L226 Difference]: Without dead ends: 32717 [2019-12-27 19:12:44,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1214, Invalid=4486, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:12:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32717 states. [2019-12-27 19:12:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32717 to 8860. [2019-12-27 19:12:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2019-12-27 19:12:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 40559 transitions. [2019-12-27 19:12:44,618 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 40559 transitions. Word has length 25 [2019-12-27 19:12:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:44,618 INFO L462 AbstractCegarLoop]: Abstraction has 8860 states and 40559 transitions. [2019-12-27 19:12:44,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:12:44,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 40559 transitions. [2019-12-27 19:12:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:44,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:44,621 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:44,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:44,824 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:44,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1072019855, now seen corresponding path program 4 times [2019-12-27 19:12:44,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:44,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682752409] [2019-12-27 19:12:44,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:44,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682752409] [2019-12-27 19:12:44,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945195115] [2019-12-27 19:12:44,907 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:44,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:12:44,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:44,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:44,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:45,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:45,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:45,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [386724619] [2019-12-27 19:12:45,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:45,077 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:45,083 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 19:12:45,083 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:45,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:12:45,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:12:45,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:45,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:12:45,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:12:45,111 INFO L87 Difference]: Start difference. First operand 8860 states and 40559 transitions. Second operand 11 states. [2019-12-27 19:12:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:46,586 INFO L93 Difference]: Finished difference Result 31097 states and 116701 transitions. [2019-12-27 19:12:46,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:46,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 19:12:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:46,650 INFO L225 Difference]: With dead ends: 31097 [2019-12-27 19:12:46,651 INFO L226 Difference]: Without dead ends: 31078 [2019-12-27 19:12:46,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2432, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:12:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31078 states. [2019-12-27 19:12:46,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31078 to 8857. [2019-12-27 19:12:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8857 states. [2019-12-27 19:12:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8857 states to 8857 states and 40508 transitions. [2019-12-27 19:12:46,977 INFO L78 Accepts]: Start accepts. Automaton has 8857 states and 40508 transitions. Word has length 25 [2019-12-27 19:12:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:46,977 INFO L462 AbstractCegarLoop]: Abstraction has 8857 states and 40508 transitions. [2019-12-27 19:12:46,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:12:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 8857 states and 40508 transitions. [2019-12-27 19:12:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:46,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:46,981 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:47,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:47,181 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:47,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:47,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1072028070, now seen corresponding path program 2 times [2019-12-27 19:12:47,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:47,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970363515] [2019-12-27 19:12:47,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:47,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970363515] [2019-12-27 19:12:47,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328587492] [2019-12-27 19:12:47,240 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:47,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:12:47,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:12:47,315 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:12:47,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:12:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:12:47,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:12:47,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:12:47,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1298665573] [2019-12-27 19:12:47,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:47,398 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:47,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 41 transitions. [2019-12-27 19:12:47,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:47,445 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:12:47,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:12:47,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:12:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:12:47,446 INFO L87 Difference]: Start difference. First operand 8857 states and 40508 transitions. Second operand 11 states. [2019-12-27 19:12:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:48,882 INFO L93 Difference]: Finished difference Result 30950 states and 116337 transitions. [2019-12-27 19:12:48,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:12:48,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-27 19:12:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:48,947 INFO L225 Difference]: With dead ends: 30950 [2019-12-27 19:12:48,948 INFO L226 Difference]: Without dead ends: 30927 [2019-12-27 19:12:48,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2432, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:12:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30927 states. [2019-12-27 19:12:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30927 to 8722. [2019-12-27 19:12:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8722 states. [2019-12-27 19:12:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8722 states to 8722 states and 39857 transitions. [2019-12-27 19:12:49,263 INFO L78 Accepts]: Start accepts. Automaton has 8722 states and 39857 transitions. Word has length 25 [2019-12-27 19:12:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:49,263 INFO L462 AbstractCegarLoop]: Abstraction has 8722 states and 39857 transitions. [2019-12-27 19:12:49,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:12:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 8722 states and 39857 transitions. [2019-12-27 19:12:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:49,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:49,268 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:49,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:12:49,470 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2071430200, now seen corresponding path program 1 times [2019-12-27 19:12:49,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:49,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972262858] [2019-12-27 19:12:49,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-27 19:12:49,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972262858] [2019-12-27 19:12:49,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:49,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:12:49,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1536419031] [2019-12-27 19:12:49,503 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:49,510 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:49,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:12:49,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:49,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:12:49,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:12:49,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:12:49,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:12:49,523 INFO L87 Difference]: Start difference. First operand 8722 states and 39857 transitions. Second operand 5 states. [2019-12-27 19:12:49,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:49,685 INFO L93 Difference]: Finished difference Result 14188 states and 62117 transitions. [2019-12-27 19:12:49,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:12:49,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 19:12:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:49,717 INFO L225 Difference]: With dead ends: 14188 [2019-12-27 19:12:49,717 INFO L226 Difference]: Without dead ends: 14156 [2019-12-27 19:12:49,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:12:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14156 states. [2019-12-27 19:12:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14156 to 10325. [2019-12-27 19:12:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10325 states. [2019-12-27 19:12:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10325 states to 10325 states and 46869 transitions. [2019-12-27 19:12:49,920 INFO L78 Accepts]: Start accepts. Automaton has 10325 states and 46869 transitions. Word has length 25 [2019-12-27 19:12:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:49,921 INFO L462 AbstractCegarLoop]: Abstraction has 10325 states and 46869 transitions. [2019-12-27 19:12:49,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:12:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10325 states and 46869 transitions. [2019-12-27 19:12:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:49,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:49,924 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:49,924 INFO L410 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1740193032, now seen corresponding path program 3 times [2019-12-27 19:12:49,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:49,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944616144] [2019-12-27 19:12:49,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:49,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944616144] [2019-12-27 19:12:49,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:49,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:49,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671670447] [2019-12-27 19:12:49,984 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:49,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:49,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:12:49,997 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:50,161 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 19:12:50,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:12:50,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:50,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:12:50,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:12:50,162 INFO L87 Difference]: Start difference. First operand 10325 states and 46869 transitions. Second operand 19 states. [2019-12-27 19:12:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:53,352 INFO L93 Difference]: Finished difference Result 37672 states and 138225 transitions. [2019-12-27 19:12:53,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 19:12:53,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2019-12-27 19:12:53,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:53,431 INFO L225 Difference]: With dead ends: 37672 [2019-12-27 19:12:53,431 INFO L226 Difference]: Without dead ends: 37642 [2019-12-27 19:12:53,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3151 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2051, Invalid=7261, Unknown=0, NotChecked=0, Total=9312 [2019-12-27 19:12:53,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2019-12-27 19:12:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 10175. [2019-12-27 19:12:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10175 states. [2019-12-27 19:12:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10175 states to 10175 states and 46142 transitions. [2019-12-27 19:12:53,839 INFO L78 Accepts]: Start accepts. Automaton has 10175 states and 46142 transitions. Word has length 25 [2019-12-27 19:12:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:53,839 INFO L462 AbstractCegarLoop]: Abstraction has 10175 states and 46142 transitions. [2019-12-27 19:12:53,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:12:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 10175 states and 46142 transitions. [2019-12-27 19:12:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:53,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:53,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 19:12:53,842 INFO L410 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:53,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1737482051, now seen corresponding path program 3 times [2019-12-27 19:12:53,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:53,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885517805] [2019-12-27 19:12:53,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:53,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885517805] [2019-12-27 19:12:53,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:53,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:53,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1968779619] [2019-12-27 19:12:53,916 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:53,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:53,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:12:53,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:54,159 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 19:12:54,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 19:12:54,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:54,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 19:12:54,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:12:54,160 INFO L87 Difference]: Start difference. First operand 10175 states and 46142 transitions. Second operand 21 states. [2019-12-27 19:12:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:12:57,084 INFO L93 Difference]: Finished difference Result 37241 states and 136421 transitions. [2019-12-27 19:12:57,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 19:12:57,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 25 [2019-12-27 19:12:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:12:57,163 INFO L225 Difference]: With dead ends: 37241 [2019-12-27 19:12:57,163 INFO L226 Difference]: Without dead ends: 37211 [2019-12-27 19:12:57,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3231 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2189, Invalid=7513, Unknown=0, NotChecked=0, Total=9702 [2019-12-27 19:12:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37211 states. [2019-12-27 19:12:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37211 to 10057. [2019-12-27 19:12:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10057 states. [2019-12-27 19:12:57,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10057 states to 10057 states and 45612 transitions. [2019-12-27 19:12:57,750 INFO L78 Accepts]: Start accepts. Automaton has 10057 states and 45612 transitions. Word has length 25 [2019-12-27 19:12:57,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:12:57,750 INFO L462 AbstractCegarLoop]: Abstraction has 10057 states and 45612 transitions. [2019-12-27 19:12:57,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 19:12:57,750 INFO L276 IsEmpty]: Start isEmpty. Operand 10057 states and 45612 transitions. [2019-12-27 19:12:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:12:57,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:12:57,753 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:12:57,753 INFO L410 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:12:57,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:12:57,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1743407112, now seen corresponding path program 4 times [2019-12-27 19:12:57,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:12:57,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355864751] [2019-12-27 19:12:57,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:12:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:12:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:12:57,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355864751] [2019-12-27 19:12:57,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:12:57,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:12:57,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755236415] [2019-12-27 19:12:57,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:12:57,822 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:12:57,831 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:12:57,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:12:57,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:12:57,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:12:57,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:12:57,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:12:57,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:12:57,961 INFO L87 Difference]: Start difference. First operand 10057 states and 45612 transitions. Second operand 15 states. [2019-12-27 19:13:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:00,132 INFO L93 Difference]: Finished difference Result 36263 states and 135250 transitions. [2019-12-27 19:13:00,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 19:13:00,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:13:00,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:00,207 INFO L225 Difference]: With dead ends: 36263 [2019-12-27 19:13:00,208 INFO L226 Difference]: Without dead ends: 36228 [2019-12-27 19:13:00,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1138, Invalid=3974, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 19:13:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36228 states. [2019-12-27 19:13:00,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36228 to 10010. [2019-12-27 19:13:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10010 states. [2019-12-27 19:13:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 45376 transitions. [2019-12-27 19:13:00,595 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 45376 transitions. Word has length 25 [2019-12-27 19:13:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:00,595 INFO L462 AbstractCegarLoop]: Abstraction has 10010 states and 45376 transitions. [2019-12-27 19:13:00,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:13:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 45376 transitions. [2019-12-27 19:13:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:13:00,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:00,598 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:00,598 INFO L410 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:00,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:00,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1743404291, now seen corresponding path program 4 times [2019-12-27 19:13:00,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:00,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846742414] [2019-12-27 19:13:00,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:00,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846742414] [2019-12-27 19:13:00,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:00,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:00,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [231501921] [2019-12-27 19:13:00,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:00,657 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:00,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:13:00,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:00,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:13:00,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:13:00,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:13:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:13:00,763 INFO L87 Difference]: Start difference. First operand 10010 states and 45376 transitions. Second operand 15 states. [2019-12-27 19:13:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:02,845 INFO L93 Difference]: Finished difference Result 35790 states and 133386 transitions. [2019-12-27 19:13:02,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 19:13:02,845 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2019-12-27 19:13:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:02,919 INFO L225 Difference]: With dead ends: 35790 [2019-12-27 19:13:02,919 INFO L226 Difference]: Without dead ends: 35755 [2019-12-27 19:13:02,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1138, Invalid=3974, Unknown=0, NotChecked=0, Total=5112 [2019-12-27 19:13:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35755 states. [2019-12-27 19:13:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35755 to 9827. [2019-12-27 19:13:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9827 states. [2019-12-27 19:13:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 44489 transitions. [2019-12-27 19:13:03,475 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 44489 transitions. Word has length 25 [2019-12-27 19:13:03,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:03,475 INFO L462 AbstractCegarLoop]: Abstraction has 9827 states and 44489 transitions. [2019-12-27 19:13:03,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:13:03,475 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 44489 transitions. [2019-12-27 19:13:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:13:03,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:03,479 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:03,479 INFO L410 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2139211039, now seen corresponding path program 5 times [2019-12-27 19:13:03,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:03,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647504663] [2019-12-27 19:13:03,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:03,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647504663] [2019-12-27 19:13:03,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:03,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:03,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [817792206] [2019-12-27 19:13:03,545 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:03,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:03,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:13:03,551 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:03,551 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:03,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:03,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:03,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:03,552 INFO L87 Difference]: Start difference. First operand 9827 states and 44489 transitions. Second operand 9 states. [2019-12-27 19:13:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:04,378 INFO L93 Difference]: Finished difference Result 31623 states and 123094 transitions. [2019-12-27 19:13:04,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:04,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:13:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:04,441 INFO L225 Difference]: With dead ends: 31623 [2019-12-27 19:13:04,441 INFO L226 Difference]: Without dead ends: 31607 [2019-12-27 19:13:04,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:13:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31607 states. [2019-12-27 19:13:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31607 to 9671. [2019-12-27 19:13:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9671 states. [2019-12-27 19:13:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9671 states to 9671 states and 43725 transitions. [2019-12-27 19:13:04,770 INFO L78 Accepts]: Start accepts. Automaton has 9671 states and 43725 transitions. Word has length 25 [2019-12-27 19:13:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:04,770 INFO L462 AbstractCegarLoop]: Abstraction has 9671 states and 43725 transitions. [2019-12-27 19:13:04,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 9671 states and 43725 transitions. [2019-12-27 19:13:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:13:04,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:04,773 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:04,773 INFO L410 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:04,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2139202824, now seen corresponding path program 5 times [2019-12-27 19:13:04,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:04,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480947753] [2019-12-27 19:13:04,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:04,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480947753] [2019-12-27 19:13:04,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:04,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:04,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431502727] [2019-12-27 19:13:04,840 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:04,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:04,846 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:13:04,846 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:04,846 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:04,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:04,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:04,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:04,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:04,847 INFO L87 Difference]: Start difference. First operand 9671 states and 43725 transitions. Second operand 9 states. [2019-12-27 19:13:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:05,703 INFO L93 Difference]: Finished difference Result 31103 states and 120876 transitions. [2019-12-27 19:13:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:05,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:13:05,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:05,764 INFO L225 Difference]: With dead ends: 31103 [2019-12-27 19:13:05,765 INFO L226 Difference]: Without dead ends: 31087 [2019-12-27 19:13:05,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:13:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31087 states. [2019-12-27 19:13:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31087 to 9503. [2019-12-27 19:13:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9503 states. [2019-12-27 19:13:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9503 states to 9503 states and 42917 transitions. [2019-12-27 19:13:06,077 INFO L78 Accepts]: Start accepts. Automaton has 9503 states and 42917 transitions. Word has length 25 [2019-12-27 19:13:06,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:06,078 INFO L462 AbstractCegarLoop]: Abstraction has 9503 states and 42917 transitions. [2019-12-27 19:13:06,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9503 states and 42917 transitions. [2019-12-27 19:13:06,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:13:06,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:06,080 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:06,081 INFO L410 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:06,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:06,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2136502879, now seen corresponding path program 6 times [2019-12-27 19:13:06,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:06,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520850162] [2019-12-27 19:13:06,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:06,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520850162] [2019-12-27 19:13:06,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:06,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:06,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [826562921] [2019-12-27 19:13:06,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:06,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:06,147 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:13:06,147 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:06,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:06,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:06,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:06,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:06,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:06,148 INFO L87 Difference]: Start difference. First operand 9503 states and 42917 transitions. Second operand 9 states. [2019-12-27 19:13:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:07,010 INFO L93 Difference]: Finished difference Result 30789 states and 119448 transitions. [2019-12-27 19:13:07,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:07,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:13:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:07,070 INFO L225 Difference]: With dead ends: 30789 [2019-12-27 19:13:07,070 INFO L226 Difference]: Without dead ends: 30769 [2019-12-27 19:13:07,071 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 19:13:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30769 states. [2019-12-27 19:13:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30769 to 9172. [2019-12-27 19:13:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9172 states. [2019-12-27 19:13:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9172 states to 9172 states and 41398 transitions. [2019-12-27 19:13:07,375 INFO L78 Accepts]: Start accepts. Automaton has 9172 states and 41398 transitions. Word has length 25 [2019-12-27 19:13:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:07,375 INFO L462 AbstractCegarLoop]: Abstraction has 9172 states and 41398 transitions. [2019-12-27 19:13:07,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 9172 states and 41398 transitions. [2019-12-27 19:13:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:13:07,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:07,378 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:07,378 INFO L410 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:07,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2136491843, now seen corresponding path program 5 times [2019-12-27 19:13:07,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:07,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712288005] [2019-12-27 19:13:07,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:07,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:07,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712288005] [2019-12-27 19:13:07,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:07,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:07,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [340668183] [2019-12-27 19:13:07,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:07,442 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:07,447 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:13:07,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:07,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:07,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:07,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:07,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:07,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:07,448 INFO L87 Difference]: Start difference. First operand 9172 states and 41398 transitions. Second operand 9 states. [2019-12-27 19:13:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:08,364 INFO L93 Difference]: Finished difference Result 30398 states and 117772 transitions. [2019-12-27 19:13:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:08,365 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:13:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:08,424 INFO L225 Difference]: With dead ends: 30398 [2019-12-27 19:13:08,424 INFO L226 Difference]: Without dead ends: 30382 [2019-12-27 19:13:08,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:13:08,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30382 states. [2019-12-27 19:13:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30382 to 9066. [2019-12-27 19:13:08,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-27 19:13:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 40900 transitions. [2019-12-27 19:13:08,729 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 40900 transitions. Word has length 25 [2019-12-27 19:13:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:08,729 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 40900 transitions. [2019-12-27 19:13:08,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 40900 transitions. [2019-12-27 19:13:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:13:08,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:08,732 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:08,732 INFO L410 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2128608264, now seen corresponding path program 6 times [2019-12-27 19:13:08,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:08,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327092659] [2019-12-27 19:13:08,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:08,802 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:08,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327092659] [2019-12-27 19:13:08,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:08,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:08,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1679221996] [2019-12-27 19:13:08,803 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:08,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:08,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:13:08,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:08,812 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:08,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:08,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:08,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:08,812 INFO L87 Difference]: Start difference. First operand 9066 states and 40900 transitions. Second operand 9 states. [2019-12-27 19:13:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:09,607 INFO L93 Difference]: Finished difference Result 30130 states and 116617 transitions. [2019-12-27 19:13:09,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:09,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:13:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:09,666 INFO L225 Difference]: With dead ends: 30130 [2019-12-27 19:13:09,666 INFO L226 Difference]: Without dead ends: 30110 [2019-12-27 19:13:09,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:13:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30110 states. [2019-12-27 19:13:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30110 to 8819. [2019-12-27 19:13:09,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8819 states. [2019-12-27 19:13:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8819 states to 8819 states and 39792 transitions. [2019-12-27 19:13:09,960 INFO L78 Accepts]: Start accepts. Automaton has 8819 states and 39792 transitions. Word has length 25 [2019-12-27 19:13:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:09,960 INFO L462 AbstractCegarLoop]: Abstraction has 8819 states and 39792 transitions. [2019-12-27 19:13:09,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8819 states and 39792 transitions. [2019-12-27 19:13:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:13:09,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:09,963 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:09,963 INFO L410 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2128605443, now seen corresponding path program 6 times [2019-12-27 19:13:09,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:09,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243410578] [2019-12-27 19:13:09,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:10,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243410578] [2019-12-27 19:13:10,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:10,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:10,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1570199436] [2019-12-27 19:13:10,035 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:10,037 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:10,041 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 19:13:10,041 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:10,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:10,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:10,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:10,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:10,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:10,042 INFO L87 Difference]: Start difference. First operand 8819 states and 39792 transitions. Second operand 9 states. [2019-12-27 19:13:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:10,831 INFO L93 Difference]: Finished difference Result 29741 states and 115009 transitions. [2019-12-27 19:13:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:10,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:13:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:10,889 INFO L225 Difference]: With dead ends: 29741 [2019-12-27 19:13:10,889 INFO L226 Difference]: Without dead ends: 29721 [2019-12-27 19:13:10,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:13:10,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29721 states. [2019-12-27 19:13:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29721 to 8516. [2019-12-27 19:13:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8516 states. [2019-12-27 19:13:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8516 states to 8516 states and 38438 transitions. [2019-12-27 19:13:11,175 INFO L78 Accepts]: Start accepts. Automaton has 8516 states and 38438 transitions. Word has length 25 [2019-12-27 19:13:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:11,175 INFO L462 AbstractCegarLoop]: Abstraction has 8516 states and 38438 transitions. [2019-12-27 19:13:11,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:11,175 INFO L276 IsEmpty]: Start isEmpty. Operand 8516 states and 38438 transitions. [2019-12-27 19:13:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 19:13:11,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:11,178 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:11,178 INFO L410 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:11,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:11,179 INFO L82 PathProgramCache]: Analyzing trace with hash -214879977, now seen corresponding path program 1 times [2019-12-27 19:13:11,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:11,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808999085] [2019-12-27 19:13:11,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:13:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 19:13:11,195 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 19:13:11,195 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 19:13:11,195 WARN L364 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2019-12-27 19:13:11,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2019-12-27 19:13:11,211 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,211 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,211 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,211 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,211 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,211 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,212 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,213 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,213 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,213 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,213 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,213 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,213 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,213 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,214 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,214 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,214 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,214 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,214 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,214 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,214 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,215 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,216 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,216 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,216 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,216 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,216 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,216 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,216 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,217 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,218 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,219 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,219 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,219 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,220 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,220 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,220 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,220 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,220 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,220 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,220 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,221 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,222 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,222 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,222 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,222 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,222 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,223 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,224 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,224 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,224 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,224 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,224 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,224 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,224 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,225 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,225 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,225 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,225 WARN L315 ript$VariableManager]: TermVariabe thr2Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,235 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,235 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,235 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,236 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,236 WARN L315 ript$VariableManager]: TermVariabe thr2Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,237 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,237 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,237 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,237 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,237 WARN L315 ript$VariableManager]: TermVariabe thr2Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,238 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,238 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,239 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,239 WARN L315 ript$VariableManager]: TermVariabe thr2Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,239 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,240 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,240 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,240 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,240 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,240 WARN L315 ript$VariableManager]: TermVariabe thr2Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,241 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,242 WARN L315 ript$VariableManager]: TermVariabe |thr2Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,242 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,242 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,242 WARN L315 ript$VariableManager]: TermVariabe thr2Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,243 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,243 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,244 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,245 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,245 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,245 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,245 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,246 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,246 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,246 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,247 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,247 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,247 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,248 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,248 WARN L315 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,249 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,250 WARN L315 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,250 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,251 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,252 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,252 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,252 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,252 WARN L315 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork1___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,252 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:13:11,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-12-27 19:13:11,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:13:11,254 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:13:11,254 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:13:11,254 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:13:11,254 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:13:11,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:13:11,255 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:13:11,255 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:13:11,256 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 133 transitions [2019-12-27 19:13:11,256 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 19:13:11,279 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 19:13:11,279 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:13:11,282 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 19:13:11,289 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 152 places, 133 transitions [2019-12-27 19:13:11,314 INFO L132 PetriNetUnfolder]: 8/168 cut-off events. [2019-12-27 19:13:11,314 INFO L133 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2019-12-27 19:13:11,317 INFO L76 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 168 events. 8/168 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 260 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 203. Up to 14 conditions per place. [2019-12-27 19:13:11,325 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2832 [2019-12-27 19:13:11,325 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:13:13,092 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-12-27 19:13:13,270 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-27 19:13:13,526 WARN L192 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-12-27 19:13:13,611 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3471 [2019-12-27 19:13:13,612 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 19:13:13,612 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 45 transitions [2019-12-27 19:13:14,766 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18584 states. [2019-12-27 19:13:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 18584 states. [2019-12-27 19:13:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 19:13:14,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:14,767 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 19:13:14,767 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:14,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1229452, now seen corresponding path program 1 times [2019-12-27 19:13:14,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:14,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790190231] [2019-12-27 19:13:14,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:13:14,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790190231] [2019-12-27 19:13:14,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:14,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 19:13:14,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1684702853] [2019-12-27 19:13:14,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:14,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:14,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 19:13:14,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:14,780 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:14,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:13:14,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:14,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:13:14,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:13:14,781 INFO L87 Difference]: Start difference. First operand 18584 states. Second operand 3 states. [2019-12-27 19:13:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:14,905 INFO L93 Difference]: Finished difference Result 17885 states and 92755 transitions. [2019-12-27 19:13:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:13:14,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 19:13:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:14,948 INFO L225 Difference]: With dead ends: 17885 [2019-12-27 19:13:14,949 INFO L226 Difference]: Without dead ends: 16791 [2019-12-27 19:13:14,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:13:15,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16791 states. [2019-12-27 19:13:15,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16791 to 16189. [2019-12-27 19:13:15,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16189 states. [2019-12-27 19:13:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16189 states to 16189 states and 84585 transitions. [2019-12-27 19:13:15,302 INFO L78 Accepts]: Start accepts. Automaton has 16189 states and 84585 transitions. Word has length 3 [2019-12-27 19:13:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:15,302 INFO L462 AbstractCegarLoop]: Abstraction has 16189 states and 84585 transitions. [2019-12-27 19:13:15,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:13:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 16189 states and 84585 transitions. [2019-12-27 19:13:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 19:13:15,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:15,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:15,302 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:15,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:15,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2087713608, now seen corresponding path program 1 times [2019-12-27 19:13:15,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:15,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238418556] [2019-12-27 19:13:15,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:13:15,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238418556] [2019-12-27 19:13:15,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:15,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:13:15,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242671699] [2019-12-27 19:13:15,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:15,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:15,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 19:13:15,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:15,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:15,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:13:15,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:15,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:13:15,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:13:15,327 INFO L87 Difference]: Start difference. First operand 16189 states and 84585 transitions. Second operand 5 states. [2019-12-27 19:13:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:15,576 INFO L93 Difference]: Finished difference Result 29874 states and 147254 transitions. [2019-12-27 19:13:15,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:13:15,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-27 19:13:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:15,652 INFO L225 Difference]: With dead ends: 29874 [2019-12-27 19:13:15,653 INFO L226 Difference]: Without dead ends: 29871 [2019-12-27 19:13:15,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:15,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29871 states. [2019-12-27 19:13:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29871 to 19122. [2019-12-27 19:13:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19122 states. [2019-12-27 19:13:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19122 states to 19122 states and 100971 transitions. [2019-12-27 19:13:16,153 INFO L78 Accepts]: Start accepts. Automaton has 19122 states and 100971 transitions. Word has length 9 [2019-12-27 19:13:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:16,153 INFO L462 AbstractCegarLoop]: Abstraction has 19122 states and 100971 transitions. [2019-12-27 19:13:16,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:13:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 19122 states and 100971 transitions. [2019-12-27 19:13:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 19:13:16,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:16,154 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:16,154 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:16,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:16,155 INFO L82 PathProgramCache]: Analyzing trace with hash -973722539, now seen corresponding path program 1 times [2019-12-27 19:13:16,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:16,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905701278] [2019-12-27 19:13:16,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:13:16,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905701278] [2019-12-27 19:13:16,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:16,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:13:16,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [902294654] [2019-12-27 19:13:16,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:16,189 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:16,190 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 19:13:16,190 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:16,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:16,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:13:16,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:16,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:13:16,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:13:16,191 INFO L87 Difference]: Start difference. First operand 19122 states and 100971 transitions. Second operand 5 states. [2019-12-27 19:13:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:16,458 INFO L93 Difference]: Finished difference Result 34948 states and 174870 transitions. [2019-12-27 19:13:16,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:13:16,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 19:13:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:16,555 INFO L225 Difference]: With dead ends: 34948 [2019-12-27 19:13:16,556 INFO L226 Difference]: Without dead ends: 34944 [2019-12-27 19:13:16,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34944 states. [2019-12-27 19:13:18,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34944 to 22883. [2019-12-27 19:13:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22883 states. [2019-12-27 19:13:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22883 states to 22883 states and 122526 transitions. [2019-12-27 19:13:18,876 INFO L78 Accepts]: Start accepts. Automaton has 22883 states and 122526 transitions. Word has length 13 [2019-12-27 19:13:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:18,877 INFO L462 AbstractCegarLoop]: Abstraction has 22883 states and 122526 transitions. [2019-12-27 19:13:18,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:13:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 22883 states and 122526 transitions. [2019-12-27 19:13:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:13:18,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:18,877 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:18,877 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1543295844, now seen corresponding path program 1 times [2019-12-27 19:13:18,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:18,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65636715] [2019-12-27 19:13:18,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:13:18,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65636715] [2019-12-27 19:13:18,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572936953] [2019-12-27 19:13:18,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:19,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:19,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:13:19,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:19,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:19,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [124679140] [2019-12-27 19:13:19,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:19,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:19,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 31 transitions. [2019-12-27 19:13:19,062 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:19,062 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:13:19,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:19,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:19,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:19,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:13:19,063 INFO L87 Difference]: Start difference. First operand 22883 states and 122526 transitions. Second operand 7 states. [2019-12-27 19:13:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:19,600 INFO L93 Difference]: Finished difference Result 54752 states and 257250 transitions. [2019-12-27 19:13:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:19,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:13:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:19,742 INFO L225 Difference]: With dead ends: 54752 [2019-12-27 19:13:19,742 INFO L226 Difference]: Without dead ends: 54748 [2019-12-27 19:13:19,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:13:19,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54748 states. [2019-12-27 19:13:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54748 to 22725. [2019-12-27 19:13:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22725 states. [2019-12-27 19:13:20,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 121545 transitions. [2019-12-27 19:13:20,524 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 121545 transitions. Word has length 15 [2019-12-27 19:13:20,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:20,524 INFO L462 AbstractCegarLoop]: Abstraction has 22725 states and 121545 transitions. [2019-12-27 19:13:20,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:20,524 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 121545 transitions. [2019-12-27 19:13:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:13:20,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:20,525 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:20,727 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:20,727 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:20,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash 555508526, now seen corresponding path program 2 times [2019-12-27 19:13:20,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:20,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799620427] [2019-12-27 19:13:20,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:20,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-27 19:13:20,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799620427] [2019-12-27 19:13:20,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:20,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:13:20,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1004345471] [2019-12-27 19:13:20,767 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:20,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:20,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 19:13:20,770 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:20,770 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:20,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:20,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:20,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:20,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:20,770 INFO L87 Difference]: Start difference. First operand 22725 states and 121545 transitions. Second operand 7 states. [2019-12-27 19:13:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:21,296 INFO L93 Difference]: Finished difference Result 56062 states and 263636 transitions. [2019-12-27 19:13:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:21,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 19:13:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:21,442 INFO L225 Difference]: With dead ends: 56062 [2019-12-27 19:13:21,442 INFO L226 Difference]: Without dead ends: 56057 [2019-12-27 19:13:21,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:13:21,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56057 states. [2019-12-27 19:13:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56057 to 22254. [2019-12-27 19:13:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22254 states. [2019-12-27 19:13:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22254 states to 22254 states and 118917 transitions. [2019-12-27 19:13:24,390 INFO L78 Accepts]: Start accepts. Automaton has 22254 states and 118917 transitions. Word has length 15 [2019-12-27 19:13:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:24,390 INFO L462 AbstractCegarLoop]: Abstraction has 22254 states and 118917 transitions. [2019-12-27 19:13:24,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 22254 states and 118917 transitions. [2019-12-27 19:13:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:13:24,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:24,391 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:24,391 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:24,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:24,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1552042877, now seen corresponding path program 1 times [2019-12-27 19:13:24,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:24,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810982683] [2019-12-27 19:13:24,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:13:24,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810982683] [2019-12-27 19:13:24,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:24,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:13:24,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [643047278] [2019-12-27 19:13:24,417 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:24,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:24,419 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 19:13:24,419 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:24,420 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:24,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:13:24,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:13:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:13:24,420 INFO L87 Difference]: Start difference. First operand 22254 states and 118917 transitions. Second operand 5 states. [2019-12-27 19:13:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:24,721 INFO L93 Difference]: Finished difference Result 40360 states and 205156 transitions. [2019-12-27 19:13:24,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:13:24,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 19:13:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:24,828 INFO L225 Difference]: With dead ends: 40360 [2019-12-27 19:13:24,828 INFO L226 Difference]: Without dead ends: 40352 [2019-12-27 19:13:24,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40352 states. [2019-12-27 19:13:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40352 to 27169. [2019-12-27 19:13:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27169 states. [2019-12-27 19:13:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27169 states to 27169 states and 146914 transitions. [2019-12-27 19:13:25,540 INFO L78 Accepts]: Start accepts. Automaton has 27169 states and 146914 transitions. Word has length 17 [2019-12-27 19:13:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:25,540 INFO L462 AbstractCegarLoop]: Abstraction has 27169 states and 146914 transitions. [2019-12-27 19:13:25,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:13:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 27169 states and 146914 transitions. [2019-12-27 19:13:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:25,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:25,541 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:25,541 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1878511684, now seen corresponding path program 1 times [2019-12-27 19:13:25,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:25,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221498195] [2019-12-27 19:13:25,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:25,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221498195] [2019-12-27 19:13:25,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831207261] [2019-12-27 19:13:25,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:25,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:25,669 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:25,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:25,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:25,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [862443659] [2019-12-27 19:13:25,732 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:25,734 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:25,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 51 transitions. [2019-12-27 19:13:25,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:25,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:13:25,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:25,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:13:25,739 INFO L87 Difference]: Start difference. First operand 27169 states and 146914 transitions. Second operand 7 states. [2019-12-27 19:13:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:26,363 INFO L93 Difference]: Finished difference Result 64531 states and 308602 transitions. [2019-12-27 19:13:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:26,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:13:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:26,534 INFO L225 Difference]: With dead ends: 64531 [2019-12-27 19:13:26,535 INFO L226 Difference]: Without dead ends: 64525 [2019-12-27 19:13:26,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:13:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64525 states. [2019-12-27 19:13:28,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64525 to 27590. [2019-12-27 19:13:28,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27590 states. [2019-12-27 19:13:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27590 states to 27590 states and 148998 transitions. [2019-12-27 19:13:28,157 INFO L78 Accepts]: Start accepts. Automaton has 27590 states and 148998 transitions. Word has length 19 [2019-12-27 19:13:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:28,158 INFO L462 AbstractCegarLoop]: Abstraction has 27590 states and 148998 transitions. [2019-12-27 19:13:28,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 27590 states and 148998 transitions. [2019-12-27 19:13:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:28,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:28,158 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:28,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:28,359 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:28,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash -90006000, now seen corresponding path program 1 times [2019-12-27 19:13:28,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:28,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487956454] [2019-12-27 19:13:28,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:28,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487956454] [2019-12-27 19:13:28,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48025320] [2019-12-27 19:13:28,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:28,484 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:13:28,484 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:28,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 19:13:28,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:28,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:13:28,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1698488553] [2019-12-27 19:13:28,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:28,531 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:28,534 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 35 transitions. [2019-12-27 19:13:28,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:28,554 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:13:28,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:28,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:13:28,555 INFO L87 Difference]: Start difference. First operand 27590 states and 148998 transitions. Second operand 9 states. [2019-12-27 19:13:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:29,344 INFO L93 Difference]: Finished difference Result 72790 states and 343256 transitions. [2019-12-27 19:13:29,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:13:29,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-12-27 19:13:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:29,547 INFO L225 Difference]: With dead ends: 72790 [2019-12-27 19:13:29,547 INFO L226 Difference]: Without dead ends: 72777 [2019-12-27 19:13:29,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:13:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72777 states. [2019-12-27 19:13:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72777 to 27791. [2019-12-27 19:13:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27791 states. [2019-12-27 19:13:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 150081 transitions. [2019-12-27 19:13:30,575 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 150081 transitions. Word has length 19 [2019-12-27 19:13:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:30,576 INFO L462 AbstractCegarLoop]: Abstraction has 27791 states and 150081 transitions. [2019-12-27 19:13:30,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 150081 transitions. [2019-12-27 19:13:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:30,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:30,577 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:30,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:30,777 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:30,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551062, now seen corresponding path program 2 times [2019-12-27 19:13:30,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:30,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057772179] [2019-12-27 19:13:30,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:13:30,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057772179] [2019-12-27 19:13:30,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:30,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:13:30,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579865037] [2019-12-27 19:13:30,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:30,820 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:30,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:13:30,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:30,823 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:30,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:30,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:30,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:30,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:30,824 INFO L87 Difference]: Start difference. First operand 27791 states and 150081 transitions. Second operand 7 states. [2019-12-27 19:13:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:32,009 INFO L93 Difference]: Finished difference Result 68100 states and 326949 transitions. [2019-12-27 19:13:32,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:32,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:13:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:32,198 INFO L225 Difference]: With dead ends: 68100 [2019-12-27 19:13:32,198 INFO L226 Difference]: Without dead ends: 68091 [2019-12-27 19:13:32,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:13:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-27 19:13:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 27884. [2019-12-27 19:13:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27884 states. [2019-12-27 19:13:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27884 states to 27884 states and 150616 transitions. [2019-12-27 19:13:33,160 INFO L78 Accepts]: Start accepts. Automaton has 27884 states and 150616 transitions. Word has length 19 [2019-12-27 19:13:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:33,160 INFO L462 AbstractCegarLoop]: Abstraction has 27884 states and 150616 transitions. [2019-12-27 19:13:33,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 27884 states and 150616 transitions. [2019-12-27 19:13:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 19:13:33,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:33,161 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:33,162 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:33,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1159551992, now seen corresponding path program 2 times [2019-12-27 19:13:33,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:33,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516185852] [2019-12-27 19:13:33,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:33,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 19:13:33,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516185852] [2019-12-27 19:13:33,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:33,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:13:33,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1789334671] [2019-12-27 19:13:33,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:33,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:33,204 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 19 transitions. [2019-12-27 19:13:33,204 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:33,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:33,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:13:33,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:33,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:13:33,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:33,205 INFO L87 Difference]: Start difference. First operand 27884 states and 150616 transitions. Second operand 7 states. [2019-12-27 19:13:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:33,809 INFO L93 Difference]: Finished difference Result 67749 states and 324931 transitions. [2019-12-27 19:13:33,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:13:33,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-27 19:13:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:33,992 INFO L225 Difference]: With dead ends: 67749 [2019-12-27 19:13:33,993 INFO L226 Difference]: Without dead ends: 67740 [2019-12-27 19:13:33,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:13:34,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67740 states. [2019-12-27 19:13:35,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67740 to 28053. [2019-12-27 19:13:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-12-27 19:13:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 151628 transitions. [2019-12-27 19:13:35,646 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 151628 transitions. Word has length 19 [2019-12-27 19:13:35,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:35,646 INFO L462 AbstractCegarLoop]: Abstraction has 28053 states and 151628 transitions. [2019-12-27 19:13:35,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:13:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 151628 transitions. [2019-12-27 19:13:35,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:35,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:35,647 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:35,648 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:35,648 INFO L82 PathProgramCache]: Analyzing trace with hash 113904919, now seen corresponding path program 1 times [2019-12-27 19:13:35,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:35,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733770761] [2019-12-27 19:13:35,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:13:35,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733770761] [2019-12-27 19:13:35,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744110425] [2019-12-27 19:13:35,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:35,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:35,790 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:13:35,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:35,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:35,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1879396109] [2019-12-27 19:13:35,880 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:35,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:35,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 69 transitions. [2019-12-27 19:13:35,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:35,923 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:13:35,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:13:35,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:13:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:13:35,924 INFO L87 Difference]: Start difference. First operand 28053 states and 151628 transitions. Second operand 11 states. [2019-12-27 19:13:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:37,502 INFO L93 Difference]: Finished difference Result 104572 states and 466018 transitions. [2019-12-27 19:13:37,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 19:13:37,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 19:13:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:37,773 INFO L225 Difference]: With dead ends: 104572 [2019-12-27 19:13:37,773 INFO L226 Difference]: Without dead ends: 104567 [2019-12-27 19:13:37,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=585, Invalid=2067, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 19:13:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104567 states. [2019-12-27 19:13:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104567 to 27697. [2019-12-27 19:13:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27697 states. [2019-12-27 19:13:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27697 states to 27697 states and 149567 transitions. [2019-12-27 19:13:42,121 INFO L78 Accepts]: Start accepts. Automaton has 27697 states and 149567 transitions. Word has length 21 [2019-12-27 19:13:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:42,121 INFO L462 AbstractCegarLoop]: Abstraction has 27697 states and 149567 transitions. [2019-12-27 19:13:42,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:13:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 27697 states and 149567 transitions. [2019-12-27 19:13:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:42,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:42,122 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:42,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:42,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1363462911, now seen corresponding path program 2 times [2019-12-27 19:13:42,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:42,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875254020] [2019-12-27 19:13:42,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:42,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875254020] [2019-12-27 19:13:42,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268546256] [2019-12-27 19:13:42,378 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:42,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:13:42,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:13:42,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:42,464 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:42,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:42,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:42,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764346291] [2019-12-27 19:13:42,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:42,539 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:42,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:13:42,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:42,545 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:13:42,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:42,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:42,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:42,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:13:42,545 INFO L87 Difference]: Start difference. First operand 27697 states and 149567 transitions. Second operand 9 states. [2019-12-27 19:13:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:43,748 INFO L93 Difference]: Finished difference Result 96837 states and 436529 transitions. [2019-12-27 19:13:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:43,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:13:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:43,999 INFO L225 Difference]: With dead ends: 96837 [2019-12-27 19:13:43,999 INFO L226 Difference]: Without dead ends: 96831 [2019-12-27 19:13:43,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:13:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96831 states. [2019-12-27 19:13:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96831 to 27343. [2019-12-27 19:13:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-27 19:13:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 147510 transitions. [2019-12-27 19:13:45,744 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 147510 transitions. Word has length 21 [2019-12-27 19:13:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:45,744 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 147510 transitions. [2019-12-27 19:13:45,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:13:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 147510 transitions. [2019-12-27 19:13:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:45,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:45,745 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:45,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:45,946 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash -596422103, now seen corresponding path program 3 times [2019-12-27 19:13:45,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:45,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460798158] [2019-12-27 19:13:45,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:45,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460798158] [2019-12-27 19:13:45,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728635274] [2019-12-27 19:13:45,999 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:46,077 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:13:46,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:13:46,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:46,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:46,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:46,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:46,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1868576263] [2019-12-27 19:13:46,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:46,154 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:46,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 37 transitions. [2019-12-27 19:13:46,158 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:46,189 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 19:13:46,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 19:13:46,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:46,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 19:13:46,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 19:13:46,190 INFO L87 Difference]: Start difference. First operand 27343 states and 147510 transitions. Second operand 11 states. [2019-12-27 19:13:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:48,022 INFO L93 Difference]: Finished difference Result 105437 states and 468029 transitions. [2019-12-27 19:13:48,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:13:48,023 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-27 19:13:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:48,298 INFO L225 Difference]: With dead ends: 105437 [2019-12-27 19:13:48,299 INFO L226 Difference]: Without dead ends: 105430 [2019-12-27 19:13:48,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=648, Invalid=2432, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:13:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105430 states. [2019-12-27 19:13:50,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105430 to 26991. [2019-12-27 19:13:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26991 states. [2019-12-27 19:13:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26991 states to 26991 states and 145461 transitions. [2019-12-27 19:13:50,262 INFO L78 Accepts]: Start accepts. Automaton has 26991 states and 145461 transitions. Word has length 21 [2019-12-27 19:13:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:50,263 INFO L462 AbstractCegarLoop]: Abstraction has 26991 states and 145461 transitions. [2019-12-27 19:13:50,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 19:13:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 26991 states and 145461 transitions. [2019-12-27 19:13:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:50,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:50,264 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:50,464 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:50,465 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:50,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:50,465 INFO L82 PathProgramCache]: Analyzing trace with hash -607849943, now seen corresponding path program 4 times [2019-12-27 19:13:50,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:50,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645924492] [2019-12-27 19:13:50,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:50,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645924492] [2019-12-27 19:13:50,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625005089] [2019-12-27 19:13:50,517 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:50,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:13:50,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:13:50,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:13:50,599 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:13:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:13:50,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:13:50,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:13:50,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599809520] [2019-12-27 19:13:50,674 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:50,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:50,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 38 states and 53 transitions. [2019-12-27 19:13:50,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:50,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 19:13:50,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:13:50,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:50,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:13:50,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-27 19:13:50,772 INFO L87 Difference]: Start difference. First operand 26991 states and 145461 transitions. Second operand 15 states. [2019-12-27 19:13:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:53,107 INFO L93 Difference]: Finished difference Result 107711 states and 472765 transitions. [2019-12-27 19:13:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:13:53,108 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-12-27 19:13:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:53,387 INFO L225 Difference]: With dead ends: 107711 [2019-12-27 19:13:53,387 INFO L226 Difference]: Without dead ends: 107702 [2019-12-27 19:13:53,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1214, Invalid=4486, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 19:13:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107702 states. [2019-12-27 19:13:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107702 to 26339. [2019-12-27 19:13:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26339 states. [2019-12-27 19:13:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26339 states to 26339 states and 142000 transitions. [2019-12-27 19:13:55,238 INFO L78 Accepts]: Start accepts. Automaton has 26339 states and 142000 transitions. Word has length 21 [2019-12-27 19:13:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:55,238 INFO L462 AbstractCegarLoop]: Abstraction has 26339 states and 142000 transitions. [2019-12-27 19:13:55,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:13:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 26339 states and 142000 transitions. [2019-12-27 19:13:55,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:55,239 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:55,239 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:55,439 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:13:55,440 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:55,440 INFO L82 PathProgramCache]: Analyzing trace with hash 671564070, now seen corresponding path program 1 times [2019-12-27 19:13:55,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:55,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648845980] [2019-12-27 19:13:55,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:13:55,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648845980] [2019-12-27 19:13:55,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:55,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:13:55,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910315893] [2019-12-27 19:13:55,467 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:55,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:55,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:13:55,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:55,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:55,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 19:13:55,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:55,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 19:13:55,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 19:13:55,471 INFO L87 Difference]: Start difference. First operand 26339 states and 142000 transitions. Second operand 5 states. [2019-12-27 19:13:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:55,804 INFO L93 Difference]: Finished difference Result 47340 states and 243927 transitions. [2019-12-27 19:13:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 19:13:55,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 19:13:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:55,932 INFO L225 Difference]: With dead ends: 47340 [2019-12-27 19:13:55,932 INFO L226 Difference]: Without dead ends: 47324 [2019-12-27 19:13:55,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:13:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47324 states. [2019-12-27 19:13:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47324 to 32794. [2019-12-27 19:13:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32794 states. [2019-12-27 19:13:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32794 states to 32794 states and 178171 transitions. [2019-12-27 19:13:57,132 INFO L78 Accepts]: Start accepts. Automaton has 32794 states and 178171 transitions. Word has length 21 [2019-12-27 19:13:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:13:57,132 INFO L462 AbstractCegarLoop]: Abstraction has 32794 states and 178171 transitions. [2019-12-27 19:13:57,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 19:13:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 32794 states and 178171 transitions. [2019-12-27 19:13:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:13:57,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:13:57,133 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:13:57,134 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:13:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:13:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1932039825, now seen corresponding path program 5 times [2019-12-27 19:13:57,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:13:57,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278699572] [2019-12-27 19:13:57,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:13:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:13:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:13:57,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278699572] [2019-12-27 19:13:57,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:13:57,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:13:57,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1494323085] [2019-12-27 19:13:57,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:13:57,192 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:13:57,196 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:13:57,196 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:13:57,196 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:13:57,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:13:57,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:13:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:13:57,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:13:57,197 INFO L87 Difference]: Start difference. First operand 32794 states and 178171 transitions. Second operand 9 states. [2019-12-27 19:13:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:13:58,430 INFO L93 Difference]: Finished difference Result 112140 states and 515003 transitions. [2019-12-27 19:13:58,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:13:58,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:13:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:13:58,727 INFO L225 Difference]: With dead ends: 112140 [2019-12-27 19:13:58,728 INFO L226 Difference]: Without dead ends: 112133 [2019-12-27 19:13:58,728 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 19:13:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112133 states. [2019-12-27 19:14:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112133 to 31942. [2019-12-27 19:14:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31942 states. [2019-12-27 19:14:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31942 states to 31942 states and 173493 transitions. [2019-12-27 19:14:00,795 INFO L78 Accepts]: Start accepts. Automaton has 31942 states and 173493 transitions. Word has length 21 [2019-12-27 19:14:00,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:00,796 INFO L462 AbstractCegarLoop]: Abstraction has 31942 states and 173493 transitions. [2019-12-27 19:14:00,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 31942 states and 173493 transitions. [2019-12-27 19:14:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 19:14:00,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:00,797 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:00,797 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:00,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1932932625, now seen corresponding path program 6 times [2019-12-27 19:14:00,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:00,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153685989] [2019-12-27 19:14:00,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-27 19:14:00,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153685989] [2019-12-27 19:14:00,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:14:00,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:14:00,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924776626] [2019-12-27 19:14:00,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:00,857 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:00,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 21 transitions. [2019-12-27 19:14:00,860 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:00,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:14:00,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:00,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:14:00,861 INFO L87 Difference]: Start difference. First operand 31942 states and 173493 transitions. Second operand 9 states. [2019-12-27 19:14:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:02,093 INFO L93 Difference]: Finished difference Result 111030 states and 509192 transitions. [2019-12-27 19:14:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:02,093 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-12-27 19:14:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:02,389 INFO L225 Difference]: With dead ends: 111030 [2019-12-27 19:14:02,389 INFO L226 Difference]: Without dead ends: 111020 [2019-12-27 19:14:02,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=728, Unknown=0, NotChecked=0, Total=992 [2019-12-27 19:14:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111020 states. [2019-12-27 19:14:04,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111020 to 30899. [2019-12-27 19:14:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30899 states. [2019-12-27 19:14:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30899 states to 30899 states and 167948 transitions. [2019-12-27 19:14:04,391 INFO L78 Accepts]: Start accepts. Automaton has 30899 states and 167948 transitions. Word has length 21 [2019-12-27 19:14:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:04,391 INFO L462 AbstractCegarLoop]: Abstraction has 30899 states and 167948 transitions. [2019-12-27 19:14:04,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 30899 states and 167948 transitions. [2019-12-27 19:14:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:04,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:04,393 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:04,393 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -938538387, now seen corresponding path program 1 times [2019-12-27 19:14:04,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:04,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796381378] [2019-12-27 19:14:04,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:04,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796381378] [2019-12-27 19:14:04,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380427408] [2019-12-27 19:14:04,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:04,515 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:14:04,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:04,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:04,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:14:04,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [838257809] [2019-12-27 19:14:04,565 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:04,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:04,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 19:14:04,573 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:04,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:14:04,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:14:04,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:04,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:14:04,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:14:04,573 INFO L87 Difference]: Start difference. First operand 30899 states and 167948 transitions. Second operand 7 states. [2019-12-27 19:14:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:05,247 INFO L93 Difference]: Finished difference Result 73073 states and 355163 transitions. [2019-12-27 19:14:05,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:14:05,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:14:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:05,452 INFO L225 Difference]: With dead ends: 73073 [2019-12-27 19:14:05,452 INFO L226 Difference]: Without dead ends: 73061 [2019-12-27 19:14:05,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:14:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73061 states. [2019-12-27 19:14:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73061 to 31876. [2019-12-27 19:14:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31876 states. [2019-12-27 19:14:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31876 states to 31876 states and 173008 transitions. [2019-12-27 19:14:06,957 INFO L78 Accepts]: Start accepts. Automaton has 31876 states and 173008 transitions. Word has length 23 [2019-12-27 19:14:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:06,957 INFO L462 AbstractCegarLoop]: Abstraction has 31876 states and 173008 transitions. [2019-12-27 19:14:06,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:06,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31876 states and 173008 transitions. [2019-12-27 19:14:06,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:06,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:06,959 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:07,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:07,160 INFO L410 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:07,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:07,160 INFO L82 PathProgramCache]: Analyzing trace with hash -912298617, now seen corresponding path program 1 times [2019-12-27 19:14:07,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:07,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288688250] [2019-12-27 19:14:07,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:07,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288688250] [2019-12-27 19:14:07,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307317172] [2019-12-27 19:14:07,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:07,284 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:14:07,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:07,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:07,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:14:07,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [239453414] [2019-12-27 19:14:07,335 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:07,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:07,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 55 transitions. [2019-12-27 19:14:07,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:07,385 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:14:07,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 19:14:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 19:14:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:14:07,387 INFO L87 Difference]: Start difference. First operand 31876 states and 173008 transitions. Second operand 10 states. [2019-12-27 19:14:08,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:08,275 INFO L93 Difference]: Finished difference Result 84143 states and 401649 transitions. [2019-12-27 19:14:08,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:14:08,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-27 19:14:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:08,506 INFO L225 Difference]: With dead ends: 84143 [2019-12-27 19:14:08,506 INFO L226 Difference]: Without dead ends: 84121 [2019-12-27 19:14:08,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:14:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84121 states. [2019-12-27 19:14:10,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84121 to 32848. [2019-12-27 19:14:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32848 states. [2019-12-27 19:14:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32848 states to 32848 states and 178265 transitions. [2019-12-27 19:14:10,159 INFO L78 Accepts]: Start accepts. Automaton has 32848 states and 178265 transitions. Word has length 23 [2019-12-27 19:14:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:10,159 INFO L462 AbstractCegarLoop]: Abstraction has 32848 states and 178265 transitions. [2019-12-27 19:14:10,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 19:14:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32848 states and 178265 transitions. [2019-12-27 19:14:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:10,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:10,161 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:10,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:10,362 INFO L410 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash 475670957, now seen corresponding path program 1 times [2019-12-27 19:14:10,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:10,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842715287] [2019-12-27 19:14:10,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:10,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842715287] [2019-12-27 19:14:10,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671224337] [2019-12-27 19:14:10,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:10,491 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-27 19:14:10,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:10,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:10,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2019-12-27 19:14:10,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [760407621] [2019-12-27 19:14:10,543 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:10,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:10,550 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 32 states and 39 transitions. [2019-12-27 19:14:10,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:10,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 19:14:10,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:14:10,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:10,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:14:10,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 19:14:10,551 INFO L87 Difference]: Start difference. First operand 32848 states and 178265 transitions. Second operand 7 states. [2019-12-27 19:14:11,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:11,194 INFO L93 Difference]: Finished difference Result 80192 states and 391837 transitions. [2019-12-27 19:14:11,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:14:11,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:14:11,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:11,418 INFO L225 Difference]: With dead ends: 80192 [2019-12-27 19:14:11,418 INFO L226 Difference]: Without dead ends: 80173 [2019-12-27 19:14:11,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:14:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80173 states. [2019-12-27 19:14:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80173 to 33665. [2019-12-27 19:14:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33665 states. [2019-12-27 19:14:13,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33665 states to 33665 states and 182914 transitions. [2019-12-27 19:14:13,061 INFO L78 Accepts]: Start accepts. Automaton has 33665 states and 182914 transitions. Word has length 23 [2019-12-27 19:14:13,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:13,061 INFO L462 AbstractCegarLoop]: Abstraction has 33665 states and 182914 transitions. [2019-12-27 19:14:13,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 33665 states and 182914 transitions. [2019-12-27 19:14:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:13,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:13,063 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:13,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:13,264 INFO L410 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1127986751, now seen corresponding path program 2 times [2019-12-27 19:14:13,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:13,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026958653] [2019-12-27 19:14:13,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:14:13,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026958653] [2019-12-27 19:14:13,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:14:13,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:14:13,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [635960768] [2019-12-27 19:14:13,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:13,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:13,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:14:13,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:13,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:14:13,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:14:13,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:14:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:14:13,312 INFO L87 Difference]: Start difference. First operand 33665 states and 182914 transitions. Second operand 7 states. [2019-12-27 19:14:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:13,971 INFO L93 Difference]: Finished difference Result 80956 states and 395965 transitions. [2019-12-27 19:14:13,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:14:13,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:14:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:14,196 INFO L225 Difference]: With dead ends: 80956 [2019-12-27 19:14:14,196 INFO L226 Difference]: Without dead ends: 80937 [2019-12-27 19:14:14,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:14:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80937 states. [2019-12-27 19:14:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80937 to 34532. [2019-12-27 19:14:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34532 states. [2019-12-27 19:14:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34532 states to 34532 states and 187636 transitions. [2019-12-27 19:14:15,896 INFO L78 Accepts]: Start accepts. Automaton has 34532 states and 187636 transitions. Word has length 23 [2019-12-27 19:14:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:15,896 INFO L462 AbstractCegarLoop]: Abstraction has 34532 states and 187636 transitions. [2019-12-27 19:14:15,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 34532 states and 187636 transitions. [2019-12-27 19:14:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:15,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:15,898 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:15,898 INFO L410 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:15,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:15,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1127974847, now seen corresponding path program 2 times [2019-12-27 19:14:15,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:15,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280966629] [2019-12-27 19:14:15,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:14:15,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280966629] [2019-12-27 19:14:15,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:14:15,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:14:15,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801480051] [2019-12-27 19:14:15,948 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:15,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:15,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:14:15,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:15,954 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:14:15,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:14:15,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:14:15,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:14:15,955 INFO L87 Difference]: Start difference. First operand 34532 states and 187636 transitions. Second operand 7 states. [2019-12-27 19:14:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:16,623 INFO L93 Difference]: Finished difference Result 81082 states and 396008 transitions. [2019-12-27 19:14:16,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:14:16,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:14:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:16,846 INFO L225 Difference]: With dead ends: 81082 [2019-12-27 19:14:16,846 INFO L226 Difference]: Without dead ends: 81063 [2019-12-27 19:14:16,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:14:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81063 states. [2019-12-27 19:14:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81063 to 35153. [2019-12-27 19:14:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35153 states. [2019-12-27 19:14:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35153 states to 35153 states and 191087 transitions. [2019-12-27 19:14:18,692 INFO L78 Accepts]: Start accepts. Automaton has 35153 states and 191087 transitions. Word has length 23 [2019-12-27 19:14:18,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:18,693 INFO L462 AbstractCegarLoop]: Abstraction has 35153 states and 191087 transitions. [2019-12-27 19:14:18,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35153 states and 191087 transitions. [2019-12-27 19:14:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 19:14:18,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:18,695 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:18,695 INFO L410 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:18,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1127975777, now seen corresponding path program 2 times [2019-12-27 19:14:18,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:18,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059037752] [2019-12-27 19:14:18,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-27 19:14:18,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059037752] [2019-12-27 19:14:18,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:14:18,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 19:14:18,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2016441915] [2019-12-27 19:14:18,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:18,742 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:18,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 23 transitions. [2019-12-27 19:14:18,745 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:18,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:14:18,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 19:14:18,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:18,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 19:14:18,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 19:14:18,746 INFO L87 Difference]: Start difference. First operand 35153 states and 191087 transitions. Second operand 7 states. [2019-12-27 19:14:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:19,418 INFO L93 Difference]: Finished difference Result 81506 states and 397808 transitions. [2019-12-27 19:14:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 19:14:19,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 19:14:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:19,644 INFO L225 Difference]: With dead ends: 81506 [2019-12-27 19:14:19,644 INFO L226 Difference]: Without dead ends: 81487 [2019-12-27 19:14:19,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:14:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81487 states. [2019-12-27 19:14:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81487 to 35912. [2019-12-27 19:14:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35912 states. [2019-12-27 19:14:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35912 states to 35912 states and 195109 transitions. [2019-12-27 19:14:24,245 INFO L78 Accepts]: Start accepts. Automaton has 35912 states and 195109 transitions. Word has length 23 [2019-12-27 19:14:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:24,245 INFO L462 AbstractCegarLoop]: Abstraction has 35912 states and 195109 transitions. [2019-12-27 19:14:24,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 19:14:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 35912 states and 195109 transitions. [2019-12-27 19:14:24,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:24,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:24,248 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:24,248 INFO L410 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:24,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:24,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2032533234, now seen corresponding path program 1 times [2019-12-27 19:14:24,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:24,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279607831] [2019-12-27 19:14:24,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:14:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279607831] [2019-12-27 19:14:24,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465305925] [2019-12-27 19:14:24,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:24,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:24,397 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-27 19:14:24,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:24,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:24,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2116737347] [2019-12-27 19:14:24,470 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:24,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:24,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 19:14:24,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:24,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:14:24,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:14:24,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:24,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:14:24,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:14:24,548 INFO L87 Difference]: Start difference. First operand 35912 states and 195109 transitions. Second operand 12 states. [2019-12-27 19:14:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:26,299 INFO L93 Difference]: Finished difference Result 129266 states and 587409 transitions. [2019-12-27 19:14:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 19:14:26,299 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 19:14:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:26,642 INFO L225 Difference]: With dead ends: 129266 [2019-12-27 19:14:26,642 INFO L226 Difference]: Without dead ends: 129252 [2019-12-27 19:14:26,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=621, Invalid=2135, Unknown=0, NotChecked=0, Total=2756 [2019-12-27 19:14:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129252 states. [2019-12-27 19:14:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129252 to 35590. [2019-12-27 19:14:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-12-27 19:14:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 193098 transitions. [2019-12-27 19:14:28,759 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 193098 transitions. Word has length 25 [2019-12-27 19:14:28,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:28,759 INFO L462 AbstractCegarLoop]: Abstraction has 35590 states and 193098 transitions. [2019-12-27 19:14:28,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:14:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 193098 transitions. [2019-12-27 19:14:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:28,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:28,762 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:28,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:28,963 INFO L410 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:28,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash -644563660, now seen corresponding path program 1 times [2019-12-27 19:14:28,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:28,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922685394] [2019-12-27 19:14:28,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:14:29,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922685394] [2019-12-27 19:14:29,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935691298] [2019-12-27 19:14:29,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:29,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:29,121 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-27 19:14:29,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:29,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:29,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1587613615] [2019-12-27 19:14:29,199 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:29,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:29,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:14:29,213 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:29,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 19:14:29,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:29,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:29,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:29,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:14:29,214 INFO L87 Difference]: Start difference. First operand 35590 states and 193098 transitions. Second operand 9 states. [2019-12-27 19:14:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:30,775 INFO L93 Difference]: Finished difference Result 118371 states and 546721 transitions. [2019-12-27 19:14:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:30,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:14:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:31,769 INFO L225 Difference]: With dead ends: 118371 [2019-12-27 19:14:31,769 INFO L226 Difference]: Without dead ends: 118361 [2019-12-27 19:14:31,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:14:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118361 states. [2019-12-27 19:14:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118361 to 35384. [2019-12-27 19:14:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35384 states. [2019-12-27 19:14:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35384 states to 35384 states and 191757 transitions. [2019-12-27 19:14:33,254 INFO L78 Accepts]: Start accepts. Automaton has 35384 states and 191757 transitions. Word has length 25 [2019-12-27 19:14:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:33,254 INFO L462 AbstractCegarLoop]: Abstraction has 35384 states and 191757 transitions. [2019-12-27 19:14:33,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 35384 states and 191757 transitions. [2019-12-27 19:14:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:33,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:33,258 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:33,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:33,458 INFO L410 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 7752134, now seen corresponding path program 2 times [2019-12-27 19:14:33,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:33,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037357533] [2019-12-27 19:14:33,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:33,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037357533] [2019-12-27 19:14:33,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501096354] [2019-12-27 19:14:33,512 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:33,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:14:33,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:33,600 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:33,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:33,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:33,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:33,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:33,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [911828929] [2019-12-27 19:14:33,678 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:33,680 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:33,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:14:33,688 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:33,688 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:14:33,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:33,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:33,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:14:33,688 INFO L87 Difference]: Start difference. First operand 35384 states and 191757 transitions. Second operand 9 states. [2019-12-27 19:14:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:35,370 INFO L93 Difference]: Finished difference Result 117247 states and 540902 transitions. [2019-12-27 19:14:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:35,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:14:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:35,687 INFO L225 Difference]: With dead ends: 117247 [2019-12-27 19:14:35,687 INFO L226 Difference]: Without dead ends: 117236 [2019-12-27 19:14:35,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:14:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117236 states. [2019-12-27 19:14:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117236 to 35317. [2019-12-27 19:14:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35317 states. [2019-12-27 19:14:40,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35317 states to 35317 states and 191252 transitions. [2019-12-27 19:14:40,686 INFO L78 Accepts]: Start accepts. Automaton has 35317 states and 191252 transitions. Word has length 25 [2019-12-27 19:14:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:40,687 INFO L462 AbstractCegarLoop]: Abstraction has 35317 states and 191252 transitions. [2019-12-27 19:14:40,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:40,687 INFO L276 IsEmpty]: Start isEmpty. Operand 35317 states and 191252 transitions. [2019-12-27 19:14:40,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:40,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:40,689 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:40,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:40,891 INFO L410 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 7741160, now seen corresponding path program 2 times [2019-12-27 19:14:40,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:40,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586477682] [2019-12-27 19:14:40,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:40,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586477682] [2019-12-27 19:14:40,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264026193] [2019-12-27 19:14:40,972 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:41,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:14:41,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:41,098 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:41,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:14:41,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:41,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:41,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [571737436] [2019-12-27 19:14:41,184 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:41,186 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:41,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:14:41,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:41,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 19:14:41,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:14:41,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:14:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:14:41,196 INFO L87 Difference]: Start difference. First operand 35317 states and 191252 transitions. Second operand 9 states. [2019-12-27 19:14:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:42,514 INFO L93 Difference]: Finished difference Result 116261 states and 536103 transitions. [2019-12-27 19:14:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:14:42,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:14:42,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:42,825 INFO L225 Difference]: With dead ends: 116261 [2019-12-27 19:14:42,825 INFO L226 Difference]: Without dead ends: 116250 [2019-12-27 19:14:42,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:14:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116250 states. [2019-12-27 19:14:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116250 to 34934. [2019-12-27 19:14:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34934 states. [2019-12-27 19:14:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34934 states to 34934 states and 189032 transitions. [2019-12-27 19:14:44,843 INFO L78 Accepts]: Start accepts. Automaton has 34934 states and 189032 transitions. Word has length 25 [2019-12-27 19:14:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:44,843 INFO L462 AbstractCegarLoop]: Abstraction has 34934 states and 189032 transitions. [2019-12-27 19:14:44,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 19:14:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 34934 states and 189032 transitions. [2019-12-27 19:14:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:44,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:44,846 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:45,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:45,047 INFO L410 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash -545632672, now seen corresponding path program 1 times [2019-12-27 19:14:45,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:45,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493811778] [2019-12-27 19:14:45,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:45,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:45,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493811778] [2019-12-27 19:14:45,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642736996] [2019-12-27 19:14:45,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:45,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:45,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:45,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:45,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:45,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [470969643] [2019-12-27 19:14:45,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:45,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:45,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:14:45,296 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:45,354 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:14:45,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:14:45,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:45,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:14:45,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:14:45,355 INFO L87 Difference]: Start difference. First operand 34934 states and 189032 transitions. Second operand 12 states. [2019-12-27 19:14:47,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:47,475 INFO L93 Difference]: Finished difference Result 129922 states and 588511 transitions. [2019-12-27 19:14:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:14:47,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 19:14:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:48,605 INFO L225 Difference]: With dead ends: 129922 [2019-12-27 19:14:48,606 INFO L226 Difference]: Without dead ends: 129904 [2019-12-27 19:14:48,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:14:48,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129904 states. [2019-12-27 19:14:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129904 to 35058. [2019-12-27 19:14:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35058 states. [2019-12-27 19:14:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35058 states to 35058 states and 189558 transitions. [2019-12-27 19:14:50,173 INFO L78 Accepts]: Start accepts. Automaton has 35058 states and 189558 transitions. Word has length 25 [2019-12-27 19:14:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:50,174 INFO L462 AbstractCegarLoop]: Abstraction has 35058 states and 189558 transitions. [2019-12-27 19:14:50,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:14:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 35058 states and 189558 transitions. [2019-12-27 19:14:50,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:50,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:50,176 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:50,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:50,377 INFO L410 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:50,378 INFO L82 PathProgramCache]: Analyzing trace with hash -545644576, now seen corresponding path program 3 times [2019-12-27 19:14:50,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:50,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070128421] [2019-12-27 19:14:50,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:50,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070128421] [2019-12-27 19:14:50,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092488634] [2019-12-27 19:14:50,429 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:50,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-27 19:14:50,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:50,514 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:50,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:50,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:50,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:50,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [331593380] [2019-12-27 19:14:50,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:50,598 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:50,606 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:14:50,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:50,669 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 19:14:50,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 19:14:50,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:50,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 19:14:50,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:14:50,669 INFO L87 Difference]: Start difference. First operand 35058 states and 189558 transitions. Second operand 12 states. [2019-12-27 19:14:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:14:53,060 INFO L93 Difference]: Finished difference Result 128374 states and 580360 transitions. [2019-12-27 19:14:53,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 19:14:53,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-12-27 19:14:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:14:53,402 INFO L225 Difference]: With dead ends: 128374 [2019-12-27 19:14:53,402 INFO L226 Difference]: Without dead ends: 128356 [2019-12-27 19:14:53,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=682, Invalid=2510, Unknown=0, NotChecked=0, Total=3192 [2019-12-27 19:14:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128356 states. [2019-12-27 19:14:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128356 to 34750. [2019-12-27 19:14:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34750 states. [2019-12-27 19:14:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34750 states to 34750 states and 187700 transitions. [2019-12-27 19:14:58,548 INFO L78 Accepts]: Start accepts. Automaton has 34750 states and 187700 transitions. Word has length 25 [2019-12-27 19:14:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:14:58,549 INFO L462 AbstractCegarLoop]: Abstraction has 34750 states and 187700 transitions. [2019-12-27 19:14:58,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 19:14:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 34750 states and 187700 transitions. [2019-12-27 19:14:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:14:58,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:14:58,551 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:14:58,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:58,752 INFO L410 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:14:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:14:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash -530395552, now seen corresponding path program 2 times [2019-12-27 19:14:58,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:14:58,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914491196] [2019-12-27 19:14:58,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:14:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:14:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:58,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914491196] [2019-12-27 19:14:58,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092095239] [2019-12-27 19:14:58,809 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:14:58,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-27 19:14:58,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:14:58,900 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:14:58,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:14:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:14:58,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:14:58,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:14:58,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1176875375] [2019-12-27 19:14:58,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:14:58,977 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:14:58,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 19:14:58,984 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:14:59,098 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 19:14:59,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 19:14:59,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:14:59,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 19:14:59,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:14:59,099 INFO L87 Difference]: Start difference. First operand 34750 states and 187700 transitions. Second operand 16 states. [2019-12-27 19:15:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:15:01,525 INFO L93 Difference]: Finished difference Result 132603 states and 593294 transitions. [2019-12-27 19:15:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:15:01,526 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-12-27 19:15:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:15:01,892 INFO L225 Difference]: With dead ends: 132603 [2019-12-27 19:15:01,892 INFO L226 Difference]: Without dead ends: 132580 [2019-12-27 19:15:01,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1255, Invalid=4597, Unknown=0, NotChecked=0, Total=5852 [2019-12-27 19:15:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132580 states. [2019-12-27 19:15:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132580 to 34277. [2019-12-27 19:15:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34277 states. [2019-12-27 19:15:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34277 states to 34277 states and 184965 transitions. [2019-12-27 19:15:04,082 INFO L78 Accepts]: Start accepts. Automaton has 34277 states and 184965 transitions. Word has length 25 [2019-12-27 19:15:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:15:04,082 INFO L462 AbstractCegarLoop]: Abstraction has 34277 states and 184965 transitions. [2019-12-27 19:15:04,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 19:15:04,082 INFO L276 IsEmpty]: Start isEmpty. Operand 34277 states and 184965 transitions. [2019-12-27 19:15:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:15:04,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:15:04,084 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:15:04,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:15:04,285 INFO L410 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:15:04,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:15:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash -541835296, now seen corresponding path program 4 times [2019-12-27 19:15:04,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:15:04,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807071088] [2019-12-27 19:15:04,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:15:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:15:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:15:04,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807071088] [2019-12-27 19:15:04,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952609455] [2019-12-27 19:15:04,359 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:15:04,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-27 19:15:04,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:15:04,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:15:04,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:15:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-27 19:15:04,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:15:04,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:15:04,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482132430] [2019-12-27 19:15:04,522 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:15:04,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:15:04,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 89 transitions. [2019-12-27 19:15:04,532 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:15:04,717 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 19:15:04,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 19:15:04,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:15:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 19:15:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:15:04,718 INFO L87 Difference]: Start difference. First operand 34277 states and 184965 transitions. Second operand 18 states. [2019-12-27 19:15:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:15:07,985 INFO L93 Difference]: Finished difference Result 128459 states and 572031 transitions. [2019-12-27 19:15:07,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-27 19:15:07,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2019-12-27 19:15:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:15:08,330 INFO L225 Difference]: With dead ends: 128459 [2019-12-27 19:15:08,330 INFO L226 Difference]: Without dead ends: 128440 [2019-12-27 19:15:08,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1361, Invalid=4801, Unknown=0, NotChecked=0, Total=6162 [2019-12-27 19:15:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128440 states. [2019-12-27 19:15:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128440 to 33768. [2019-12-27 19:15:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33768 states. [2019-12-27 19:15:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33768 states to 33768 states and 182281 transitions. [2019-12-27 19:15:09,930 INFO L78 Accepts]: Start accepts. Automaton has 33768 states and 182281 transitions. Word has length 25 [2019-12-27 19:15:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:15:09,930 INFO L462 AbstractCegarLoop]: Abstraction has 33768 states and 182281 transitions. [2019-12-27 19:15:09,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 19:15:09,931 INFO L276 IsEmpty]: Start isEmpty. Operand 33768 states and 182281 transitions. [2019-12-27 19:15:09,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 19:15:09,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:15:09,933 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:15:10,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:15:10,136 INFO L410 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:15:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:15:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash -298046732, now seen corresponding path program 3 times [2019-12-27 19:15:10,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:15:10,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88506485] [2019-12-27 19:15:10,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:15:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:15:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:15:10,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88506485] [2019-12-27 19:15:10,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096342767] [2019-12-27 19:15:10,208 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:15:10,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-27 19:15:10,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-27 19:15:10,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-27 19:15:10,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-27 19:15:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-27 19:15:10,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-27 19:15:10,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2019-12-27 19:15:10,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560592701] [2019-12-27 19:15:10,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:15:10,397 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:15:10,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 57 transitions. [2019-12-27 19:15:10,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:15:10,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 19:15:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 19:15:10,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:15:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 19:15:10,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-12-27 19:15:10,404 INFO L87 Difference]: Start difference. First operand 33768 states and 182281 transitions. Second operand 9 states. [2019-12-27 19:15:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:15:11,935 INFO L93 Difference]: Finished difference Result 115987 states and 535173 transitions. [2019-12-27 19:15:11,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:15:11,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 19:15:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:15:12,247 INFO L225 Difference]: With dead ends: 115987 [2019-12-27 19:15:12,248 INFO L226 Difference]: Without dead ends: 115977 [2019-12-27 19:15:12,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=1139, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 19:15:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115977 states. [2019-12-27 19:15:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115977 to 33338. [2019-12-27 19:15:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33338 states. Received shutdown request... [2019-12-27 19:15:17,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-27 19:15:17,533 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:15:17,539 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:15:17,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:15:17 BasicIcfg [2019-12-27 19:15:17,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:15:17,540 INFO L168 Benchmark]: Toolchain (without parser) took 232676.08 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.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:15:17,540 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 19:15:17,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.47 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 162.9 MB in the end (delta: -60.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 19:15:17,541 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.55 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:15:17,541 INFO L168 Benchmark]: Boogie Preprocessor took 27.39 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:15:17,541 INFO L168 Benchmark]: RCFGBuilder took 456.41 ms. Allocated memory is still 202.9 MB. Free memory was 158.9 MB in the beginning and 139.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:15:17,542 INFO L168 Benchmark]: TraceAbstraction took 231415.73 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 139.0 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-27 19:15:17,543 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.45 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 715.47 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 102.3 MB in the beginning and 162.9 MB in the end (delta: -60.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.55 ms. Allocated memory is still 202.9 MB. Free memory was 162.9 MB in the beginning and 160.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.39 ms. Allocated memory is still 202.9 MB. Free memory was 160.2 MB in the beginning and 158.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 456.41 ms. Allocated memory is still 202.9 MB. Free memory was 158.9 MB in the beginning and 139.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231415.73 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 139.0 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 57 ProgramPointsBefore, 15 ProgramPointsAfterwards, 53 TransitionsBefore, 12 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 6 FixpointIterations, 17 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 326 VarBasedMoverChecksPositive, 3 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 3 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 489 CheckedPairsTotal, 46 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.5s, 76 ProgramPointsBefore, 26 ProgramPointsAfterwards, 69 TransitionsBefore, 21 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 516 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 15 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.1s, 0 MoverChecksTotal, 1034 CheckedPairsTotal, 57 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.6s, 95 ProgramPointsBefore, 34 ProgramPointsAfterwards, 85 TransitionsBefore, 27 TransitionsAfterwards, 1308 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 4 ChoiceCompositions, 625 VarBasedMoverChecksPositive, 16 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 1615 CheckedPairsTotal, 69 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 114 ProgramPointsBefore, 42 ProgramPointsAfterwards, 101 TransitionsBefore, 33 TransitionsAfterwards, 1756 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 5 ChoiceCompositions, 851 VarBasedMoverChecksPositive, 17 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 19 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2111 CheckedPairsTotal, 84 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.8s, 133 ProgramPointsBefore, 50 ProgramPointsAfterwards, 117 TransitionsBefore, 39 TransitionsAfterwards, 2264 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 3 ConcurrentYvCompositions, 6 ChoiceCompositions, 1089 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 21 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2604 CheckedPairsTotal, 97 TotalNumberOfCompositions - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 152 ProgramPointsBefore, 58 ProgramPointsAfterwards, 133 TransitionsBefore, 45 TransitionsAfterwards, 2832 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 9 TrivialYvCompositions, 4 ConcurrentYvCompositions, 7 ChoiceCompositions, 1357 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 27 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3471 CheckedPairsTotal, 112 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 675). Cancelled while ReachableStatesComputation was computing reachable states (28521 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. Result: TIMEOUT, OverallTime: 126.2s, OverallIterations: 32, TraceHistogramMax: 4, AutomataDifference: 46.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1919 SDtfs, 8459 SDslu, 6057 SDs, 0 SdLazy, 13052 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1327 GetRequests, 361 SyntacticMatches, 8 SemanticMatches, 958 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12038 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35912occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 67.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 1743395 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1089 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1038 ConstructedInterpolants, 0 QuantifiedInterpolants, 146236 SizeOfPredicates, 102 NumberOfNonLiveVariables, 2119 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 51 InterpolantComputations, 13 PerfectInterpolantSequences, 320/648 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown